./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/twostage_3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/twostage_3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0db6974abead9f0b145be669e8625acba9e17feac06fbf7c6b45d50c107fdab8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:22:34,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:22:34,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:22:34,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:22:34,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:22:34,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:22:34,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:22:34,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:22:34,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:22:34,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:22:34,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:22:34,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:22:34,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:22:34,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:22:34,295 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:22:34,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:22:34,296 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:22:34,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:22:34,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:22:34,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:22:34,301 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:22:34,301 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:22:34,302 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:22:34,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:22:34,302 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:22:34,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:22:34,302 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:22:34,303 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:22:34,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:22:34,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:22:34,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:22:34,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:22:34,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:22:34,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:34,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:22:34,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:22:34,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:22:34,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:22:34,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:22:34,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:22:34,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:22:34,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:22:34,308 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 0db6974abead9f0b145be669e8625acba9e17feac06fbf7c6b45d50c107fdab8 [2024-11-09 10:22:34,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:22:34,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:22:34,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:22:34,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:22:34,591 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:22:34,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/twostage_3-2.i [2024-11-09 10:22:36,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:22:36,485 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:22:36,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3-2.i [2024-11-09 10:22:36,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb581ecb3/6bebbefac5214103ae966e8c09bea2af/FLAG11831432a [2024-11-09 10:22:36,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb581ecb3/6bebbefac5214103ae966e8c09bea2af [2024-11-09 10:22:36,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:22:36,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:22:36,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:36,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:22:36,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:22:36,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:36" (1/1) ... [2024-11-09 10:22:36,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e96d541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:36, skipping insertion in model container [2024-11-09 10:22:36,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:36" (1/1) ... [2024-11-09 10:22:36,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:22:37,173 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:22:37,174 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:22:37,190 WARN L1674 CHandler]: Possible shadowing of function lock [2024-11-09 10:22:37,191 WARN L1674 CHandler]: Possible shadowing of function lock [2024-11-09 10:22:37,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:37,207 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:22:37,281 WARN L1674 CHandler]: Possible shadowing of function lock [2024-11-09 10:22:37,282 WARN L1674 CHandler]: Possible shadowing of function lock [2024-11-09 10:22:37,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:37,376 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:22:37,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37 WrapperNode [2024-11-09 10:22:37,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:37,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:37,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:22:37,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:22:37,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,448 INFO L138 Inliner]: procedures = 373, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 173 [2024-11-09 10:22:37,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:37,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:22:37,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:22:37,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:22:37,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,481 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-09 10:22:37,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:22:37,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:22:37,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:22:37,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:22:37,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (1/1) ... [2024-11-09 10:22:37,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:37,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:37,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:22:37,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:22:37,603 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2024-11-09 10:22:37,605 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2024-11-09 10:22:37,605 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2024-11-09 10:22:37,605 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2024-11-09 10:22:37,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:22:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:22:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:22:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:22:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:22:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:22:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:22:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:22:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:22:37,606 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:22:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:22:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:22:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:22:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:22:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:22:37,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:22:37,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:22:37,611 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:22:37,809 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:22:37,812 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:22:38,180 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:22:38,181 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:22:38,337 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:22:38,337 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 10:22:38,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:38 BoogieIcfgContainer [2024-11-09 10:22:38,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:22:38,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:22:38,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:22:38,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:22:38,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:22:36" (1/3) ... [2024-11-09 10:22:38,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470f91ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:38, skipping insertion in model container [2024-11-09 10:22:38,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:37" (2/3) ... [2024-11-09 10:22:38,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470f91ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:38, skipping insertion in model container [2024-11-09 10:22:38,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:38" (3/3) ... [2024-11-09 10:22:38,346 INFO L112 eAbstractionObserver]: Analyzing ICFG twostage_3-2.i [2024-11-09 10:22:38,364 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:22:38,364 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-09 10:22:38,364 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:22:38,426 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:22:38,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 178 flow [2024-11-09 10:22:38,526 INFO L124 PetriNetUnfolderBase]: 16/168 cut-off events. [2024-11-09 10:22:38,527 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 10:22:38,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 168 events. 16/168 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 816 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 86. Up to 7 conditions per place. [2024-11-09 10:22:38,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 79 transitions, 178 flow [2024-11-09 10:22:38,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 79 transitions, 178 flow [2024-11-09 10:22:38,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:22:38,562 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=None, 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;@7236955b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:22:38,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 10:22:38,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:22:38,570 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2024-11-09 10:22:38,570 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:22:38,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:38,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:22:38,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:22:38,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash 16155863, now seen corresponding path program 1 times [2024-11-09 10:22:38,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:38,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585524343] [2024-11-09 10:22:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:38,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585524343] [2024-11-09 10:22:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585524343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:38,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:22:38,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140419006] [2024-11-09 10:22:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:38,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:22:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:22:38,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:22:38,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 79 [2024-11-09 10:22:38,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 178 flow. Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:38,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:38,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 79 [2024-11-09 10:22:38,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:39,407 INFO L124 PetriNetUnfolderBase]: 1878/3698 cut-off events. [2024-11-09 10:22:39,407 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-09 10:22:39,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6755 conditions, 3698 events. 1878/3698 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 23727 event pairs, 1757 based on Foata normal form. 180/3638 useless extension candidates. Maximal degree in co-relation 6188. Up to 2976 conditions per place. [2024-11-09 10:22:39,450 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 42 selfloop transitions, 0 changer transitions 0/73 dead transitions. [2024-11-09 10:22:39,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 250 flow [2024-11-09 10:22:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:22:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:22:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 109 transitions. [2024-11-09 10:22:39,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.689873417721519 [2024-11-09 10:22:39,466 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 178 flow. Second operand 2 states and 109 transitions. [2024-11-09 10:22:39,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 73 transitions, 250 flow [2024-11-09 10:22:39,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 73 transitions, 250 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:22:39,480 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 166 flow [2024-11-09 10:22:39,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2024-11-09 10:22:39,489 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2024-11-09 10:22:39,490 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 166 flow [2024-11-09 10:22:39,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:39,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:39,490 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:22:39,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:22:39,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:22:39,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash 500883407, now seen corresponding path program 1 times [2024-11-09 10:22:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:39,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605244546] [2024-11-09 10:22:39,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:39,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:39,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605244546] [2024-11-09 10:22:39,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605244546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:39,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:39,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:22:39,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621659314] [2024-11-09 10:22:39,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:39,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:39,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:39,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:39,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:39,849 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2024-11-09 10:22:39,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:39,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:39,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2024-11-09 10:22:39,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:40,316 INFO L124 PetriNetUnfolderBase]: 2141/4185 cut-off events. [2024-11-09 10:22:40,318 INFO L125 PetriNetUnfolderBase]: For 115/123 co-relation queries the response was YES. [2024-11-09 10:22:40,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7685 conditions, 4185 events. 2141/4185 cut-off events. For 115/123 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 28529 event pairs, 1506 based on Foata normal form. 8/3967 useless extension candidates. Maximal degree in co-relation 7680. Up to 2578 conditions per place. [2024-11-09 10:22:40,352 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 63 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-11-09 10:22:40,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 334 flow [2024-11-09 10:22:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-11-09 10:22:40,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6244725738396625 [2024-11-09 10:22:40,356 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 166 flow. Second operand 3 states and 148 transitions. [2024-11-09 10:22:40,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 334 flow [2024-11-09 10:22:40,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:22:40,363 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 166 flow [2024-11-09 10:22:40,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2024-11-09 10:22:40,364 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2024-11-09 10:22:40,365 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 166 flow [2024-11-09 10:22:40,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:40,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:40,365 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:22:40,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:22:40,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:22:40,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:40,366 INFO L85 PathProgramCache]: Analyzing trace with hash 500883408, now seen corresponding path program 1 times [2024-11-09 10:22:40,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:40,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374223504] [2024-11-09 10:22:40,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:40,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:40,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:22:40,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374223504] [2024-11-09 10:22:40,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374223504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:40,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:40,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:22:40,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318129685] [2024-11-09 10:22:40,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:40,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:22:40,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:22:40,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:22:40,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:22:40,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2024-11-09 10:22:40,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:40,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:40,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2024-11-09 10:22:40,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:41,624 INFO L124 PetriNetUnfolderBase]: 4304/8534 cut-off events. [2024-11-09 10:22:41,624 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2024-11-09 10:22:41,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15771 conditions, 8534 events. 4304/8534 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 65757 event pairs, 3633 based on Foata normal form. 1/8079 useless extension candidates. Maximal degree in co-relation 15765. Up to 3417 conditions per place. [2024-11-09 10:22:41,689 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 93 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2024-11-09 10:22:41,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 124 transitions, 488 flow [2024-11-09 10:22:41,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:22:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:22:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2024-11-09 10:22:41,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.680379746835443 [2024-11-09 10:22:41,692 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 166 flow. Second operand 4 states and 215 transitions. [2024-11-09 10:22:41,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 124 transitions, 488 flow [2024-11-09 10:22:41,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:41,699 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 188 flow [2024-11-09 10:22:41,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2024-11-09 10:22:41,701 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2024-11-09 10:22:41,701 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 188 flow [2024-11-09 10:22:41,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:41,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:41,702 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:41,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:22:41,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:22:41,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash -420853023, now seen corresponding path program 1 times [2024-11-09 10:22:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:22:41,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543713231] [2024-11-09 10:22:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:22:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:22:41,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:22:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:22:41,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:22:41,784 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:22:41,786 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2024-11-09 10:22:41,788 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (13 of 15 remaining) [2024-11-09 10:22:41,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (12 of 15 remaining) [2024-11-09 10:22:41,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2024-11-09 10:22:41,791 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-09 10:22:41,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-09 10:22:41,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2024-11-09 10:22:41,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-09 10:22:41,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-09 10:22:41,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2024-11-09 10:22:41,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (4 of 15 remaining) [2024-11-09 10:22:41,792 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2024-11-09 10:22:41,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2024-11-09 10:22:41,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 15 remaining) [2024-11-09 10:22:41,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2024-11-09 10:22:41,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:22:41,793 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:22:41,822 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:22:41,823 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:22:41,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:22:41 BasicIcfg [2024-11-09 10:22:41,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:22:41,832 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:22:41,832 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:22:41,832 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:22:41,833 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:38" (3/4) ... [2024-11-09 10:22:41,835 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:22:41,836 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:22:41,837 INFO L158 Benchmark]: Toolchain (without parser) took 5310.36ms. Allocated memory was 167.8MB in the beginning and 266.3MB in the end (delta: 98.6MB). Free memory was 107.9MB in the beginning and 150.6MB in the end (delta: -42.7MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2024-11-09 10:22:41,837 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:22:41,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 849.52ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 132.7MB in the end (delta: -24.9MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2024-11-09 10:22:41,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.36ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 132.7MB in the beginning and 178.7MB in the end (delta: -46.0MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2024-11-09 10:22:41,839 INFO L158 Benchmark]: Boogie Preprocessor took 57.56ms. Allocated memory is still 211.8MB. Free memory was 178.7MB in the beginning and 175.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:22:41,839 INFO L158 Benchmark]: RCFGBuilder took 830.14ms. Allocated memory is still 211.8MB. Free memory was 175.6MB in the beginning and 132.1MB in the end (delta: 43.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-09 10:22:41,839 INFO L158 Benchmark]: TraceAbstraction took 3491.75ms. Allocated memory was 211.8MB in the beginning and 266.3MB in the end (delta: 54.5MB). Free memory was 131.0MB in the beginning and 151.6MB in the end (delta: -20.6MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-11-09 10:22:41,840 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 266.3MB. Free memory was 151.6MB in the beginning and 150.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:41,842 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.21ms. Allocated memory is still 167.8MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 849.52ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 132.7MB in the end (delta: -24.9MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.36ms. Allocated memory was 167.8MB in the beginning and 211.8MB in the end (delta: 44.0MB). Free memory was 132.7MB in the beginning and 178.7MB in the end (delta: -46.0MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.56ms. Allocated memory is still 211.8MB. Free memory was 178.7MB in the beginning and 175.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 830.14ms. Allocated memory is still 211.8MB. Free memory was 175.6MB in the beginning and 132.1MB in the end (delta: 43.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3491.75ms. Allocated memory was 211.8MB in the beginning and 266.3MB in the end (delta: 54.5MB). Free memory was 131.0MB in the beginning and 151.6MB in the end (delta: -20.6MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 266.3MB. Free memory was 151.6MB in the beginning and 150.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: overapproximation of sscanf at line 1285. Possible FailurePath: [L1236] static int iTThreads = 2; [L1237] static int iRThreads = 1; [L1238] static int data1Value = 0; [L1239] static int data2Value = 0; [L1240] pthread_mutex_t *data1Lock; [L1241] pthread_mutex_t *data2Lock; [L1278] int i,err; VAL [\old(argc)=3, \old(argv)={1073741826:1073741827}, argc=3, data1Lock={0:0}, data1Value=0, data2Lock={0:0}, data2Value=0, iRThreads=1, iTThreads=2] [L1279] COND TRUE argc != 1 VAL [\old(argc)=3, \old(argv)={1073741826:1073741827}, argc=3, data1Lock={0:0}, data1Value=0, data2Lock={0:0}, data2Value=0, iRThreads=1, iTThreads=2] [L1280] COND FALSE !(argc != 3) VAL [\old(argc)=3, \old(argv)={1073741826:1073741827}, argc=3, data1Lock={0:0}, data1Value=0, data2Lock={0:0}, data2Value=0, iRThreads=1, iTThreads=2] [L1284] argv[1] [L1285] argv[2] [L1288] data1Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1289] data2Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1290] EXPR err = pthread_mutex_init(data1Lock, ((void *)0)) [L1290] COND FALSE !(0 != (err = pthread_mutex_init(data1Lock, ((void *)0)))) [L1294] EXPR err = pthread_mutex_init(data2Lock, ((void *)0)) [L1294] COND FALSE !(0 != (err = pthread_mutex_init(data2Lock, ((void *)0)))) [L1298] pthread_t tPool[iTThreads]; [L1299] pthread_t rPool[iRThreads]; [L1300] i = 0 VAL [\old(argc)=3, \old(argv)={1073741826:1073741827}, argc=3, data1Lock={-2:0}, data1Value=0, data2Lock={-3:0}, data2Value=0, err=0, i=0, iRThreads=0, iTThreads=1073741824, rPool={5:0}, tPool={4:0}] [L1300] COND TRUE i < iTThreads - UnprovableResult [Line: 1284]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: 1285]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1277]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1301]: 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: 1307]: 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: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 15 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.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 394 IncrementalHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 0 mSDtfsCounter, 394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 48 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:22:41,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/twostage_3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0db6974abead9f0b145be669e8625acba9e17feac06fbf7c6b45d50c107fdab8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:22:44,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:22:44,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:22:44,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:22:44,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:22:44,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:22:44,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:22:44,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:22:44,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:22:44,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:22:44,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:22:44,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:22:44,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:22:44,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:22:44,293 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:22:44,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:22:44,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:22:44,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:22:44,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:22:44,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:22:44,294 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:22:44,296 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:22:44,297 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:22:44,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:22:44,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:22:44,297 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:22:44,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:22:44,298 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:22:44,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:22:44,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:22:44,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:22:44,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:22:44,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:22:44,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:22:44,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:22:44,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:44,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:22:44,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:22:44,302 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:22:44,302 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:22:44,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:22:44,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:22:44,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:22:44,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:22:44,303 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 0db6974abead9f0b145be669e8625acba9e17feac06fbf7c6b45d50c107fdab8 [2024-11-09 10:22:44,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:22:44,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:22:44,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:22:44,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:22:44,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:22:44,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/twostage_3-2.i [2024-11-09 10:22:46,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:22:46,610 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:22:46,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3-2.i [2024-11-09 10:22:46,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3b739eb/9cc6cd3613dd4764a3230fc5a194d768/FLAG5342c2c32 [2024-11-09 10:22:46,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3b739eb/9cc6cd3613dd4764a3230fc5a194d768 [2024-11-09 10:22:46,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:22:46,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:22:46,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:46,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:22:46,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:22:46,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:46" (1/1) ... [2024-11-09 10:22:46,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8fdfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:46, skipping insertion in model container [2024-11-09 10:22:46,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:46" (1/1) ... [2024-11-09 10:22:46,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:22:47,330 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:22:47,331 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:22:47,346 WARN L1674 CHandler]: Possible shadowing of function lock [2024-11-09 10:22:47,348 WARN L1674 CHandler]: Possible shadowing of function lock [2024-11-09 10:22:47,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:47,364 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:22:47,415 WARN L1674 CHandler]: Possible shadowing of function lock [2024-11-09 10:22:47,416 WARN L1674 CHandler]: Possible shadowing of function lock [2024-11-09 10:22:47,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:22:47,532 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:22:47,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47 WrapperNode [2024-11-09 10:22:47,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:22:47,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:47,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:22:47,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:22:47,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,610 INFO L138 Inliner]: procedures = 376, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 172 [2024-11-09 10:22:47,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:22:47,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:22:47,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:22:47,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:22:47,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,647 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-09 10:22:47,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:22:47,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:22:47,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:22:47,670 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:22:47,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (1/1) ... [2024-11-09 10:22:47,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:22:47,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:22:47,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:22:47,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:22:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:22:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:22:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:22:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2024-11-09 10:22:47,751 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2024-11-09 10:22:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2024-11-09 10:22:47,751 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2024-11-09 10:22:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:22:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:22:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:22:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:22:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:22:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:22:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:22:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:22:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:22:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:22:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:22:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:22:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:22:47,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:22:47,754 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:22:47,949 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:22:47,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:22:48,393 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:22:48,393 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:22:48,631 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:22:48,632 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 10:22:48,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:48 BoogieIcfgContainer [2024-11-09 10:22:48,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:22:48,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:22:48,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:22:48,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:22:48,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:22:46" (1/3) ... [2024-11-09 10:22:48,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a70adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:48, skipping insertion in model container [2024-11-09 10:22:48,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:47" (2/3) ... [2024-11-09 10:22:48,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a70adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:22:48, skipping insertion in model container [2024-11-09 10:22:48,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:48" (3/3) ... [2024-11-09 10:22:48,642 INFO L112 eAbstractionObserver]: Analyzing ICFG twostage_3-2.i [2024-11-09 10:22:48,660 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:22:48,661 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-11-09 10:22:48,661 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:22:48,725 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 10:22:48,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 79 transitions, 178 flow [2024-11-09 10:22:48,825 INFO L124 PetriNetUnfolderBase]: 16/168 cut-off events. [2024-11-09 10:22:48,825 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-09 10:22:48,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 168 events. 16/168 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 816 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 86. Up to 7 conditions per place. [2024-11-09 10:22:48,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 79 transitions, 178 flow [2024-11-09 10:22:48,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 79 transitions, 178 flow [2024-11-09 10:22:48,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:22:48,849 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=None, 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;@2b5ff009, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:22:48,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-09 10:22:48,853 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:22:48,853 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2024-11-09 10:22:48,853 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:22:48,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:48,854 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:22:48,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:22:48,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash 16094295, now seen corresponding path program 1 times [2024-11-09 10:22:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:48,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889822876] [2024-11-09 10:22:48,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:48,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:48,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:48,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:48,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:22:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:48,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 10:22:48,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:48,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:48,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:48,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889822876] [2024-11-09 10:22:48,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889822876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:48,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:48,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:22:48,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505556665] [2024-11-09 10:22:48,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:48,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 10:22:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:49,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 10:22:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 10:22:49,026 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 79 [2024-11-09 10:22:49,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 178 flow. Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:49,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:49,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 79 [2024-11-09 10:22:49,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:49,654 INFO L124 PetriNetUnfolderBase]: 1878/3698 cut-off events. [2024-11-09 10:22:49,654 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-09 10:22:49,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6755 conditions, 3698 events. 1878/3698 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 23727 event pairs, 1757 based on Foata normal form. 180/3638 useless extension candidates. Maximal degree in co-relation 6188. Up to 2976 conditions per place. [2024-11-09 10:22:49,687 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 42 selfloop transitions, 0 changer transitions 0/73 dead transitions. [2024-11-09 10:22:49,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 250 flow [2024-11-09 10:22:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 10:22:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-09 10:22:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 109 transitions. [2024-11-09 10:22:49,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.689873417721519 [2024-11-09 10:22:49,704 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 178 flow. Second operand 2 states and 109 transitions. [2024-11-09 10:22:49,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 73 transitions, 250 flow [2024-11-09 10:22:49,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 73 transitions, 250 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:22:49,714 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 166 flow [2024-11-09 10:22:49,719 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2024-11-09 10:22:49,724 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2024-11-09 10:22:49,725 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 166 flow [2024-11-09 10:22:49,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:49,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:49,725 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:22:49,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:22:49,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:49,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:22:49,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 498974797, now seen corresponding path program 1 times [2024-11-09 10:22:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:49,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032925923] [2024-11-09 10:22:49,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:49,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:49,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:49,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:49,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:22:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:50,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:22:50,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:50,267 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2024-11-09 10:22:50,299 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 10:22:50,322 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2024-11-09 10:22:50,347 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2024-11-09 10:22:50,377 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 10:22:50,407 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2024-11-09 10:22:50,436 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2024-11-09 10:22:50,457 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2024-11-09 10:22:50,485 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 10:22:50,530 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 10:22:50,572 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2024-11-09 10:22:50,611 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:22:50,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2024-11-09 10:22:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:50,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:50,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032925923] [2024-11-09 10:22:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032925923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:50,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:50,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:22:50,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928718607] [2024-11-09 10:22:50,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:50,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:22:50,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:50,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:22:50,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:22:50,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 79 [2024-11-09 10:22:50,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:50,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:50,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 79 [2024-11-09 10:22:50,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:51,321 INFO L124 PetriNetUnfolderBase]: 2141/4185 cut-off events. [2024-11-09 10:22:51,322 INFO L125 PetriNetUnfolderBase]: For 115/123 co-relation queries the response was YES. [2024-11-09 10:22:51,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7685 conditions, 4185 events. 2141/4185 cut-off events. For 115/123 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 28551 event pairs, 1506 based on Foata normal form. 8/3967 useless extension candidates. Maximal degree in co-relation 7680. Up to 2578 conditions per place. [2024-11-09 10:22:51,350 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 63 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-11-09 10:22:51,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 334 flow [2024-11-09 10:22:51,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:22:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:22:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-11-09 10:22:51,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6244725738396625 [2024-11-09 10:22:51,353 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 166 flow. Second operand 3 states and 148 transitions. [2024-11-09 10:22:51,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 334 flow [2024-11-09 10:22:51,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 92 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:22:51,357 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 166 flow [2024-11-09 10:22:51,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2024-11-09 10:22:51,359 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2024-11-09 10:22:51,359 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 166 flow [2024-11-09 10:22:51,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:51,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:51,360 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:22:51,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 10:22:51,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:51,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:22:51,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash 498974798, now seen corresponding path program 1 times [2024-11-09 10:22:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:51,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962447589] [2024-11-09 10:22:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:51,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:51,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:51,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:51,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:22:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:22:51,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:22:51,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:22:51,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 10:22:51,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-11-09 10:22:51,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,777 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:22:51,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,786 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:22:51,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-09 10:22:51,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-09 10:22:51,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,825 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:22:51,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-09 10:22:51,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-09 10:22:51,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,861 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:22:51,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,872 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:22:51,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-09 10:22:51,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:22:51,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-09 10:22:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:22:51,933 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:22:51,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:22:51,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962447589] [2024-11-09 10:22:51,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962447589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:22:51,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:22:51,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:22:51,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053733990] [2024-11-09 10:22:51,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:22:51,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:22:51,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:22:51,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:22:51,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:22:52,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 79 [2024-11-09 10:22:52,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:52,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:22:52,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 79 [2024-11-09 10:22:52,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:22:53,024 INFO L124 PetriNetUnfolderBase]: 4304/8534 cut-off events. [2024-11-09 10:22:53,025 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2024-11-09 10:22:53,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15771 conditions, 8534 events. 4304/8534 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 65730 event pairs, 3633 based on Foata normal form. 1/8079 useless extension candidates. Maximal degree in co-relation 15765. Up to 3417 conditions per place. [2024-11-09 10:22:53,085 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 93 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2024-11-09 10:22:53,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 124 transitions, 488 flow [2024-11-09 10:22:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:22:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:22:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2024-11-09 10:22:53,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.680379746835443 [2024-11-09 10:22:53,091 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 166 flow. Second operand 4 states and 215 transitions. [2024-11-09 10:22:53,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 124 transitions, 488 flow [2024-11-09 10:22:53,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:22:53,098 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 188 flow [2024-11-09 10:22:53,098 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2024-11-09 10:22:53,099 INFO L277 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2024-11-09 10:22:53,100 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 188 flow [2024-11-09 10:22:53,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:22:53,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:22:53,100 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:22:53,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:22:53,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:53,304 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-09 10:22:53,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:22:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1445680671, now seen corresponding path program 1 times [2024-11-09 10:22:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:22:53,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370974351] [2024-11-09 10:22:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:22:53,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:53,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:22:53,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:22:53,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:22:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:22:53,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:22:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:22:53,497 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:22:53,498 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:22:53,499 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2024-11-09 10:22:53,500 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (13 of 15 remaining) [2024-11-09 10:22:53,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (12 of 15 remaining) [2024-11-09 10:22:53,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2024-11-09 10:22:53,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-11-09 10:22:53,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-11-09 10:22:53,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2024-11-09 10:22:53,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-11-09 10:22:53,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-11-09 10:22:53,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2024-11-09 10:22:53,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (4 of 15 remaining) [2024-11-09 10:22:53,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2024-11-09 10:22:53,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2024-11-09 10:22:53,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 15 remaining) [2024-11-09 10:22:53,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2024-11-09 10:22:53,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:22:53,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:22:53,704 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 10:22:53,732 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:22:53,732 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:22:53,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:22:53 BasicIcfg [2024-11-09 10:22:53,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:22:53,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:22:53,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:22:53,738 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:22:53,738 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:48" (3/4) ... [2024-11-09 10:22:53,740 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:22:53,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:22:53,743 INFO L158 Benchmark]: Toolchain (without parser) took 7088.59ms. Allocated memory was 75.5MB in the beginning and 276.8MB in the end (delta: 201.3MB). Free memory was 45.3MB in the beginning and 119.0MB in the end (delta: -73.6MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2024-11-09 10:22:53,743 INFO L158 Benchmark]: CDTParser took 1.62ms. Allocated memory is still 58.7MB. Free memory was 30.6MB in the beginning and 30.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:22:53,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 878.05ms. Allocated memory is still 75.5MB. Free memory was 45.1MB in the beginning and 39.4MB in the end (delta: 5.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-09 10:22:53,745 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.73ms. Allocated memory is still 75.5MB. Free memory was 39.4MB in the beginning and 36.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:22:53,746 INFO L158 Benchmark]: Boogie Preprocessor took 57.06ms. Allocated memory is still 75.5MB. Free memory was 36.1MB in the beginning and 33.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:22:53,747 INFO L158 Benchmark]: RCFGBuilder took 963.00ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 33.1MB in the beginning and 48.1MB in the end (delta: -15.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-09 10:22:53,747 INFO L158 Benchmark]: TraceAbstraction took 5102.71ms. Allocated memory was 100.7MB in the beginning and 276.8MB in the end (delta: 176.2MB). Free memory was 47.3MB in the beginning and 119.0MB in the end (delta: -71.6MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. [2024-11-09 10:22:53,747 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 276.8MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:22:53,749 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.62ms. Allocated memory is still 58.7MB. Free memory was 30.6MB in the beginning and 30.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 878.05ms. Allocated memory is still 75.5MB. Free memory was 45.1MB in the beginning and 39.4MB in the end (delta: 5.8MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.73ms. Allocated memory is still 75.5MB. Free memory was 39.4MB in the beginning and 36.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.06ms. Allocated memory is still 75.5MB. Free memory was 36.1MB in the beginning and 33.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 963.00ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 33.1MB in the beginning and 48.1MB in the end (delta: -15.0MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5102.71ms. Allocated memory was 100.7MB in the beginning and 276.8MB in the end (delta: 176.2MB). Free memory was 47.3MB in the beginning and 119.0MB in the end (delta: -71.6MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 276.8MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: overapproximation of sscanf at line 1285. Possible FailurePath: [L1236] static int iTThreads = 2; [L1237] static int iRThreads = 1; [L1238] static int data1Value = 0; [L1239] static int data2Value = 0; [L1240] pthread_mutex_t *data1Lock; [L1241] pthread_mutex_t *data2Lock; [L1278] int i,err; VAL [\old(argc)=3, \old(argv)={6:5}, argc=3, data1Lock={0:0}, data1Value=0, data2Lock={0:0}, data2Value=0, iRThreads=1, iTThreads=2] [L1279] COND TRUE argc != 1 VAL [\old(argc)=3, \old(argv)={6:5}, argc=3, data1Lock={0:0}, data1Value=0, data2Lock={0:0}, data2Value=0, iRThreads=1, iTThreads=2] [L1280] COND FALSE !(argc != 3) VAL [\old(argc)=3, \old(argv)={6:5}, argc=3, data1Lock={0:0}, data1Value=0, data2Lock={0:0}, data2Value=0, iRThreads=1, iTThreads=2] [L1284] argv[1] [L1285] argv[2] [L1288] data1Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1289] data2Lock = (pthread_mutex_t *) malloc(sizeof(pthread_mutex_t)) [L1290] EXPR err = pthread_mutex_init(data1Lock, ((void *)0)) [L1290] COND FALSE !(0 != (err = pthread_mutex_init(data1Lock, ((void *)0)))) [L1294] EXPR err = pthread_mutex_init(data2Lock, ((void *)0)) [L1294] COND FALSE !(0 != (err = pthread_mutex_init(data2Lock, ((void *)0)))) [L1298] pthread_t tPool[iTThreads]; [L1299] pthread_t rPool[iRThreads]; [L1300] i = 0 VAL [\old(argc)=3, \old(argv)={6:5}, argc=3, data1Lock={-2147483645:0}, data1Value=0, data2Lock={3:0}, data2Value=0, err=0, i=0, iRThreads=0, iTThreads=1073741824, rPool={-2147483121:0}, tPool={-2147483641:0}] [L1300] COND TRUE i < iTThreads - UnprovableResult [Line: 1284]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: 1285]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1277]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1301]: 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: 1307]: 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: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 15 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: 5.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 4 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 11 ConstructedInterpolants, 2 QuantifiedInterpolants, 133 SizeOfPredicates, 7 NumberOfNonLiveVariables, 155 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 could not prove your program: unable to determine feasibility of some traces [2024-11-09 10:22:53,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Result: UNKNOWN: Overapproximated counterexample