./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/goblint-regression/06-symbeq_06-tricky_address1.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 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:05:42,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:05:42,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:05:42,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:05:42,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:05:42,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:05:42,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:05:42,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:05:42,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:05:42,336 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:05:42,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:05:42,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:05:42,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:05:42,338 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:05:42,338 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:05:42,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:05:42,339 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:05:42,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:05:42,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:05:42,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:05:42,339 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:05:42,342 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:05:42,343 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:05:42,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:05:42,343 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:05:42,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:05:42,343 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:05:42,344 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:05:42,344 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:05:42,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:05:42,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:05:42,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:05:42,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:05:42,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:05:42,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:05:42,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:05:42,346 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:05:42,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:05:42,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:05:42,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:05:42,350 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:05:42,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:05:42,351 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 -> 99f794c04b6feffb38c1e5c415a278bf34dda5287d389b184a9a7d818ab0b70e [2024-11-10 18:05:42,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:05:42,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:05:42,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:05:42,607 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:05:42,608 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:05:42,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2024-11-10 18:05:43,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:05:44,245 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:05:44,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_06-tricky_address1.i [2024-11-10 18:05:44,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8cb393c/9c55b7fbd69643ad9bf73d0cb9c608cf/FLAG13f580b31 [2024-11-10 18:05:44,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8cb393c/9c55b7fbd69643ad9bf73d0cb9c608cf [2024-11-10 18:05:44,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:05:44,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:05:44,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:05:44,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:05:44,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:05:44,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:05:44" (1/1) ... [2024-11-10 18:05:44,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55eae43a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:44, skipping insertion in model container [2024-11-10 18:05:44,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:05:44" (1/1) ... [2024-11-10 18:05:44,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:05:44,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:05:45,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:05:45,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:05:45,152 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:05:45,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45 WrapperNode [2024-11-10 18:05:45,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:05:45,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:05:45,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:05:45,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:05:45,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,215 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 126 [2024-11-10 18:05:45,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:05:45,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:05:45,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:05:45,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:05:45,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,248 INFO L175 MemorySlicer]: Split 64 memory accesses to 1 slices as follows [64]. 100 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60]. The 2 writes are split as follows [2]. [2024-11-10 18:05:45,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:05:45,261 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:05:45,261 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:05:45,261 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:05:45,262 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (1/1) ... [2024-11-10 18:05:45,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:05:45,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:05:45,300 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-10 18:05:45,305 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-10 18:05:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 18:05:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:05:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:05:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 18:05:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:05:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 18:05:45,351 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 18:05:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:05:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:05:45,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:05:45,353 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:05:45,464 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:05:45,466 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:05:45,702 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:05:45,702 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:05:46,169 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:05:46,169 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:05:46,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:05:46 BoogieIcfgContainer [2024-11-10 18:05:46,169 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:05:46,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:05:46,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:05:46,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:05:46,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:05:44" (1/3) ... [2024-11-10 18:05:46,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66173210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:05:46, skipping insertion in model container [2024-11-10 18:05:46,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:05:45" (2/3) ... [2024-11-10 18:05:46,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66173210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:05:46, skipping insertion in model container [2024-11-10 18:05:46,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:05:46" (3/3) ... [2024-11-10 18:05:46,183 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.i [2024-11-10 18:05:46,199 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:05:46,199 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-10 18:05:46,200 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:05:46,252 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:05:46,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 68 flow [2024-11-10 18:05:46,318 INFO L124 PetriNetUnfolderBase]: 2/31 cut-off events. [2024-11-10 18:05:46,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:05:46,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 31 events. 2/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 6. Up to 2 conditions per place. [2024-11-10 18:05:46,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 68 flow [2024-11-10 18:05:46,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 65 flow [2024-11-10 18:05:46,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:05:46,351 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;@36dbbb96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:05:46,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-10 18:05:46,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:05:46,363 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2024-11-10 18:05:46,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:05:46,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:46,365 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:05:46,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 18:05:46,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:46,373 INFO L85 PathProgramCache]: Analyzing trace with hash -256796602, now seen corresponding path program 1 times [2024-11-10 18:05:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:46,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120090714] [2024-11-10 18:05:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:46,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:46,627 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-10 18:05:46,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:46,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120090714] [2024-11-10 18:05:46,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120090714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:05:46,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:05:46,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:05:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793379840] [2024-11-10 18:05:46,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:05:46,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 18:05:46,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:46,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 18:05:46,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 18:05:46,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-10 18:05:46,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 65 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-10 18:05:46,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:46,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-10 18:05:46,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:46,778 INFO L124 PetriNetUnfolderBase]: 43/140 cut-off events. [2024-11-10 18:05:46,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:05:46,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 140 events. 43/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 529 event pairs, 42 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 231. Up to 102 conditions per place. [2024-11-10 18:05:46,783 INFO L140 encePairwiseOnDemand]: 31/32 looper letters, 17 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2024-11-10 18:05:46,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 97 flow [2024-11-10 18:05:46,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 18:05:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 18:05:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2024-11-10 18:05:46,796 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-11-10 18:05:46,799 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 65 flow. Second operand 2 states and 46 transitions. [2024-11-10 18:05:46,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 97 flow [2024-11-10 18:05:46,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:05:46,806 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 62 flow [2024-11-10 18:05:46,809 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2024-11-10 18:05:46,815 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2024-11-10 18:05:46,815 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 62 flow [2024-11-10 18:05:46,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-10 18:05:46,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:46,816 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:05:46,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:05:46,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 18:05:46,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1246259025, now seen corresponding path program 1 times [2024-11-10 18:05:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:46,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129064507] [2024-11-10 18:05:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:46,940 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-10 18:05:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:46,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129064507] [2024-11-10 18:05:46,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129064507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:05:46,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:05:46,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:05:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519741750] [2024-11-10 18:05:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:05:46,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:05:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:05:46,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:05:46,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-10 18:05:46,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-10 18:05:46,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:46,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-10 18:05:46,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:47,047 INFO L124 PetriNetUnfolderBase]: 43/142 cut-off events. [2024-11-10 18:05:47,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:05:47,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 142 events. 43/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 529 event pairs, 42 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 247. Up to 103 conditions per place. [2024-11-10 18:05:47,050 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 17 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-11-10 18:05:47,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 102 flow [2024-11-10 18:05:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:05:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:05:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-10 18:05:47,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2024-11-10 18:05:47,052 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 62 flow. Second operand 3 states and 59 transitions. [2024-11-10 18:05:47,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 102 flow [2024-11-10 18:05:47,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 102 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:05:47,054 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 74 flow [2024-11-10 18:05:47,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2024-11-10 18:05:47,055 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2024-11-10 18:05:47,056 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 74 flow [2024-11-10 18:05:47,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-10 18:05:47,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:47,057 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:05:47,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:05:47,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 18:05:47,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:47,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1926917074, now seen corresponding path program 1 times [2024-11-10 18:05:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:47,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400792823] [2024-11-10 18:05:47,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:47,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:47,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:47,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400792823] [2024-11-10 18:05:47,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400792823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:05:47,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877371374] [2024-11-10 18:05:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:47,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:05:47,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:05:47,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:05:47,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 18:05:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:47,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:05:47,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:05:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:47,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:05:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:47,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877371374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:05:47,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:05:47,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-10 18:05:47,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976093754] [2024-11-10 18:05:47,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:05:47,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:05:47,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:47,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:05:47,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:05:47,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-10 18:05:47,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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-10 18:05:47,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:47,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-10 18:05:47,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:47,460 INFO L124 PetriNetUnfolderBase]: 43/148 cut-off events. [2024-11-10 18:05:47,462 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 18:05:47,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 148 events. 43/148 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 529 event pairs, 42 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 264. Up to 103 conditions per place. [2024-11-10 18:05:47,463 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 17 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-11-10 18:05:47,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 34 transitions, 130 flow [2024-11-10 18:05:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:05:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:05:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-11-10 18:05:47,465 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-11-10 18:05:47,465 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 6 states and 103 transitions. [2024-11-10 18:05:47,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 34 transitions, 130 flow [2024-11-10 18:05:47,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:05:47,467 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 108 flow [2024-11-10 18:05:47,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2024-11-10 18:05:47,467 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2024-11-10 18:05:47,468 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 108 flow [2024-11-10 18:05:47,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 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-10 18:05:47,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:47,468 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:05:47,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 18:05:47,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:05:47,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 18:05:47,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:47,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1039527979, now seen corresponding path program 2 times [2024-11-10 18:05:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:47,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994295415] [2024-11-10 18:05:47,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:47,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 18:05:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:47,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994295415] [2024-11-10 18:05:47,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994295415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:05:47,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:05:47,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:05:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294867333] [2024-11-10 18:05:47,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:05:47,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:05:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:47,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:05:47,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:05:47,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-11-10 18:05:47,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10 18:05:47,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:47,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-11-10 18:05:47,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:47,918 INFO L124 PetriNetUnfolderBase]: 43/139 cut-off events. [2024-11-10 18:05:47,919 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-10 18:05:47,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 139 events. 43/139 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 475 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 265. Up to 90 conditions per place. [2024-11-10 18:05:47,921 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 26 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2024-11-10 18:05:47,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 170 flow [2024-11-10 18:05:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:05:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:05:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2024-11-10 18:05:47,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.546875 [2024-11-10 18:05:47,923 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 108 flow. Second operand 4 states and 70 transitions. [2024-11-10 18:05:47,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 170 flow [2024-11-10 18:05:47,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 162 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-10 18:05:47,925 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 96 flow [2024-11-10 18:05:47,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2024-11-10 18:05:47,928 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2024-11-10 18:05:47,929 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 96 flow [2024-11-10 18:05:47,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-10 18:05:47,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:47,929 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:05:47,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:05:47,930 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 18:05:47,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:47,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1039527980, now seen corresponding path program 1 times [2024-11-10 18:05:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675217366] [2024-11-10 18:05:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:48,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675217366] [2024-11-10 18:05:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675217366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:05:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134444946] [2024-11-10 18:05:48,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:48,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:05:48,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:05:48,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:05:48,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 18:05:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:48,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:05:48,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:05:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:48,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:05:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:05:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134444946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:05:48,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:05:48,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 18:05:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380979696] [2024-11-10 18:05:48,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:05:48,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:05:48,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:05:48,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:05:48,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-10 18:05:48,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 96 flow. Second operand has 13 states, 13 states have (on average 14.384615384615385) internal successors, (187), 13 states have internal predecessors, (187), 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-10 18:05:48,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:48,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-10 18:05:48,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:48,317 INFO L124 PetriNetUnfolderBase]: 43/148 cut-off events. [2024-11-10 18:05:48,317 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2024-11-10 18:05:48,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 148 events. 43/148 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 431 event pairs, 42 based on Foata normal form. 6/153 useless extension candidates. Maximal degree in co-relation 298. Up to 103 conditions per place. [2024-11-10 18:05:48,320 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 17 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2024-11-10 18:05:48,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 36 transitions, 188 flow [2024-11-10 18:05:48,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 18:05:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 18:05:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2024-11-10 18:05:48,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-11-10 18:05:48,324 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 96 flow. Second operand 12 states and 190 transitions. [2024-11-10 18:05:48,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 36 transitions, 188 flow [2024-11-10 18:05:48,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 36 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:05:48,326 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 177 flow [2024-11-10 18:05:48,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=177, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2024-11-10 18:05:48,327 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2024-11-10 18:05:48,329 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 177 flow [2024-11-10 18:05:48,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.384615384615385) internal successors, (187), 13 states have internal predecessors, (187), 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-10 18:05:48,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:48,329 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:05:48,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 18:05:48,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:05:48,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 18:05:48,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:48,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1962664678, now seen corresponding path program 2 times [2024-11-10 18:05:48,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:48,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492449625] [2024-11-10 18:05:48,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:48,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:05:48,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:48,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492449625] [2024-11-10 18:05:48,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492449625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:05:48,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:05:48,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:05:48,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454257707] [2024-11-10 18:05:48,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:05:48,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:05:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:48,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:05:48,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:05:48,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-11-10 18:05:48,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10 18:05:48,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:48,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-11-10 18:05:48,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:48,932 INFO L124 PetriNetUnfolderBase]: 43/135 cut-off events. [2024-11-10 18:05:48,933 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-11-10 18:05:48,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 135 events. 43/135 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 369 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 307. Up to 90 conditions per place. [2024-11-10 18:05:48,936 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 30 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-11-10 18:05:48,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 41 transitions, 255 flow [2024-11-10 18:05:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:05:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:05:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-11-10 18:05:48,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578125 [2024-11-10 18:05:48,939 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 177 flow. Second operand 4 states and 74 transitions. [2024-11-10 18:05:48,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 41 transitions, 255 flow [2024-11-10 18:05:48,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 219 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-11-10 18:05:48,943 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 139 flow [2024-11-10 18:05:48,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2024-11-10 18:05:48,944 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2024-11-10 18:05:48,944 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 139 flow [2024-11-10 18:05:48,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10 18:05:48,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:48,944 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:05:48,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:05:48,944 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 18:05:48,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1962419555, now seen corresponding path program 1 times [2024-11-10 18:05:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:48,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707963782] [2024-11-10 18:05:48,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:05:49,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707963782] [2024-11-10 18:05:49,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707963782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:05:49,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:05:49,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:05:49,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716901837] [2024-11-10 18:05:49,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:05:49,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:05:49,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:49,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:05:49,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:05:49,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-11-10 18:05:49,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10 18:05:49,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:49,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-11-10 18:05:49,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:49,223 INFO L124 PetriNetUnfolderBase]: 37/122 cut-off events. [2024-11-10 18:05:49,224 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-11-10 18:05:49,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 122 events. 37/122 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 290 event pairs, 36 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 270. Up to 86 conditions per place. [2024-11-10 18:05:49,225 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-11-10 18:05:49,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 31 transitions, 187 flow [2024-11-10 18:05:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:05:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:05:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-11-10 18:05:49,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-11-10 18:05:49,227 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 139 flow. Second operand 4 states and 66 transitions. [2024-11-10 18:05:49,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 31 transitions, 187 flow [2024-11-10 18:05:49,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 31 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:05:49,229 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 136 flow [2024-11-10 18:05:49,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2024-11-10 18:05:49,230 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2024-11-10 18:05:49,231 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 136 flow [2024-11-10 18:05:49,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10 18:05:49,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:05:49,231 INFO L204 CegarLoopForPetriNet]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:05:49,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:05:49,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 18:05:49,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:05:49,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1215022931, now seen corresponding path program 1 times [2024-11-10 18:05:49,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:05:49,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635900808] [2024-11-10 18:05:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:05:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:05:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:05:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-10 18:05:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:05:49,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635900808] [2024-11-10 18:05:49,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635900808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:05:49,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:05:49,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:05:49,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698214885] [2024-11-10 18:05:49,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:05:49,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:05:49,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:05:49,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:05:49,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:05:49,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-10 18:05:49,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-10 18:05:49,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:05:49,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-10 18:05:49,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:05:49,337 INFO L124 PetriNetUnfolderBase]: 37/116 cut-off events. [2024-11-10 18:05:49,337 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-10 18:05:49,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 116 events. 37/116 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 259 event pairs, 36 based on Foata normal form. 7/122 useless extension candidates. Maximal degree in co-relation 265. Up to 98 conditions per place. [2024-11-10 18:05:49,338 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 0 selfloop transitions, 0 changer transitions 30/30 dead transitions. [2024-11-10 18:05:49,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 30 transitions, 186 flow [2024-11-10 18:05:49,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:05:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:05:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-11-10 18:05:49,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-10 18:05:49,339 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 136 flow. Second operand 3 states and 56 transitions. [2024-11-10 18:05:49,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 30 transitions, 186 flow [2024-11-10 18:05:49,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 30 transitions, 183 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:05:49,340 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2024-11-10 18:05:49,341 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2024-11-10 18:05:49,341 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2024-11-10 18:05:49,341 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2024-11-10 18:05:49,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-10 18:05:49,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2024-11-10 18:05:49,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-10 18:05:49,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-10 18:05:49,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-10 18:05:49,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2024-11-10 18:05:49,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2024-11-10 18:05:49,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-10 18:05:49,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-11-10 18:05:49,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-11-10 18:05:49,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-11-10 18:05:49,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-10 18:05:49,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2024-11-10 18:05:49,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-10 18:05:49,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-10 18:05:49,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:05:49,350 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-11-10 18:05:49,357 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:05:49,357 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:05:49,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:05:49 BasicIcfg [2024-11-10 18:05:49,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:05:49,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:05:49,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:05:49,363 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:05:49,364 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:05:46" (3/4) ... [2024-11-10 18:05:49,365 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 18:05:49,370 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2024-11-10 18:05:49,377 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2024-11-10 18:05:49,378 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-11-10 18:05:49,378 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-10 18:05:49,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 18:05:49,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-10 18:05:49,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:05:49,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 18:05:49,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 18:05:49,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 18:05:49,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:05:49,465 INFO L158 Benchmark]: Toolchain (without parser) took 4933.59ms. Allocated memory was 192.9MB in the beginning and 285.2MB in the end (delta: 92.3MB). Free memory was 154.3MB in the beginning and 116.1MB in the end (delta: 38.2MB). Peak memory consumption was 133.3MB. Max. memory is 16.1GB. [2024-11-10 18:05:49,465 INFO L158 Benchmark]: CDTParser took 1.69ms. Allocated memory is still 192.9MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:05:49,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.88ms. Allocated memory is still 192.9MB. Free memory was 154.3MB in the beginning and 121.3MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 18:05:49,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.27ms. Allocated memory is still 192.9MB. Free memory was 121.3MB in the beginning and 118.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:05:49,466 INFO L158 Benchmark]: Boogie Preprocessor took 43.97ms. Allocated memory is still 192.9MB. Free memory was 118.4MB in the beginning and 115.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:05:49,466 INFO L158 Benchmark]: IcfgBuilder took 908.44ms. Allocated memory was 192.9MB in the beginning and 285.2MB in the end (delta: 92.3MB). Free memory was 115.7MB in the beginning and 194.4MB in the end (delta: -78.8MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2024-11-10 18:05:49,466 INFO L158 Benchmark]: TraceAbstraction took 3191.24ms. Allocated memory is still 285.2MB. Free memory was 194.4MB in the beginning and 121.4MB in the end (delta: 73.0MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2024-11-10 18:05:49,470 INFO L158 Benchmark]: Witness Printer took 101.48ms. Allocated memory is still 285.2MB. Free memory was 121.4MB in the beginning and 116.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 18:05:49,471 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.69ms. Allocated memory is still 192.9MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.88ms. Allocated memory is still 192.9MB. Free memory was 154.3MB in the beginning and 121.3MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.27ms. Allocated memory is still 192.9MB. Free memory was 121.3MB in the beginning and 118.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.97ms. Allocated memory is still 192.9MB. Free memory was 118.4MB in the beginning and 115.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 908.44ms. Allocated memory was 192.9MB in the beginning and 285.2MB in the end (delta: 92.3MB). Free memory was 115.7MB in the beginning and 194.4MB in the end (delta: -78.8MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3191.24ms. Allocated memory is still 285.2MB. Free memory was 194.4MB in the beginning and 121.4MB in the end (delta: 73.0MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * Witness Printer took 101.48ms. Allocated memory is still 285.2MB. Free memory was 121.4MB in the beginning and 116.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 935]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 44 locations, 14 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.1s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 13 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 1064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 350/416 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 - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 18:05:49,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE