./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-memsafety/list1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-memsafety/list1.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 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:54:12,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:54:13,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:54:13,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:54:13,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:54:13,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:54:13,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:54:13,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:54:13,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:54:13,095 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:54:13,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:54:13,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:54:13,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:54:13,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:54:13,098 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:54:13,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:54:13,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:54:13,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:54:13,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:54:13,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:54:13,100 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:54:13,102 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:54:13,102 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:54:13,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:54:13,103 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:54:13,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:54:13,103 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:54:13,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:54:13,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:54:13,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:54:13,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:54:13,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:54:13,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:54:13,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:54:13,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:54:13,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:54:13,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:54:13,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:54:13,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:54:13,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:54:13,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:54:13,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:54:13,108 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 -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2024-11-22 21:54:13,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:54:13,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:54:13,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:54:13,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:54:13,426 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:54:13,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-22 21:54:14,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:54:15,198 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:54:15,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-22 21:54:15,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f49a3027/e55c3beaa38948f5ada62a71a5b9cc54/FLAGec9437964 [2024-11-22 21:54:15,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f49a3027/e55c3beaa38948f5ada62a71a5b9cc54 [2024-11-22 21:54:15,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:54:15,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:54:15,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:54:15,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:54:15,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:54:15,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:15,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d68f95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15, skipping insertion in model container [2024-11-22 21:54:15,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:15,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:54:15,757 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:54:15,765 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:54:15,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:54:15,790 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:54:15,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:54:15,902 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:54:15,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15 WrapperNode [2024-11-22 21:54:15,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:54:15,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:54:15,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:54:15,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:54:15,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:15,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:15,961 INFO L138 Inliner]: procedures = 264, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-22 21:54:15,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:54:15,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:54:15,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:54:15,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:54:15,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:15,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:15,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:15,994 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [8, 3]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 3 writes are split as follows [2, 1]. [2024-11-22 21:54:15,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:15,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:16,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:16,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:16,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:16,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:16,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:54:16,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:54:16,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:54:16,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:54:16,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (1/1) ... [2024-11-22 21:54:16,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:54:16,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:54:16,055 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-22 21:54:16,058 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-22 21:54:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 21:54:16,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 21:54:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 21:54:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 21:54:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 21:54:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 21:54:16,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:54:16,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 21:54:16,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 21:54:16,114 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2024-11-22 21:54:16,114 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2024-11-22 21:54:16,114 INFO L130 BoogieDeclarations]: Found specification of procedure build [2024-11-22 21:54:16,114 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2024-11-22 21:54:16,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:54:16,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:54:16,116 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:54:16,291 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:54:16,293 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:54:16,612 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:54:16,612 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:54:16,791 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:54:16,793 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 21:54:16,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:16 BoogieIcfgContainer [2024-11-22 21:54:16,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:54:16,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:54:16,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:54:16,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:54:16,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:54:15" (1/3) ... [2024-11-22 21:54:16,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22389eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:54:16, skipping insertion in model container [2024-11-22 21:54:16,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:15" (2/3) ... [2024-11-22 21:54:16,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22389eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:54:16, skipping insertion in model container [2024-11-22 21:54:16,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:16" (3/3) ... [2024-11-22 21:54:16,804 INFO L112 eAbstractionObserver]: Analyzing ICFG list1.i [2024-11-22 21:54:16,822 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:54:16,823 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-22 21:54:16,823 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:54:16,936 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-22 21:54:16,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 162 flow [2024-11-22 21:54:17,004 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2024-11-22 21:54:17,004 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-22 21:54:17,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 5/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 206 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2024-11-22 21:54:17,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 162 flow [2024-11-22 21:54:17,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 154 flow [2024-11-22 21:54:17,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:54:17,028 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;@6b2ad076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:54:17,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-22 21:54:17,034 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:54:17,034 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-22 21:54:17,034 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-22 21:54:17,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:17,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:54:17,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:17,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:17,040 INFO L85 PathProgramCache]: Analyzing trace with hash 273116001, now seen corresponding path program 1 times [2024-11-22 21:54:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:54:17,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760995490] [2024-11-22 21:54:17,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:17,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:54:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:17,446 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-22 21:54:17,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:54:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760995490] [2024-11-22 21:54:17,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760995490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:17,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:17,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:54:17,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331355814] [2024-11-22 21:54:17,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:17,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:54:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:54:17,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:54:17,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:54:17,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-22 21:54:17,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-22 21:54:17,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:17,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-22 21:54:17,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:17,731 INFO L124 PetriNetUnfolderBase]: 25/148 cut-off events. [2024-11-22 21:54:17,731 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 21:54:17,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 148 events. 25/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 513 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 120. Up to 31 conditions per place. [2024-11-22 21:54:17,734 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-11-22 21:54:17,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 231 flow [2024-11-22 21:54:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:54:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:54:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2024-11-22 21:54:17,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-22 21:54:17,748 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 154 flow. Second operand 4 states and 212 transitions. [2024-11-22 21:54:17,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 231 flow [2024-11-22 21:54:17,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:54:17,755 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 159 flow [2024-11-22 21:54:17,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2024-11-22 21:54:17,761 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-11-22 21:54:17,761 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 159 flow [2024-11-22 21:54:17,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-22 21:54:17,761 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:17,762 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:54:17,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:54:17,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:17,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash 273116002, now seen corresponding path program 1 times [2024-11-22 21:54:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:54:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952183462] [2024-11-22 21:54:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:17,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:54:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:17,936 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-22 21:54:17,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:54:17,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952183462] [2024-11-22 21:54:17,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952183462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:17,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:17,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:54:17,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868076679] [2024-11-22 21:54:17,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:17,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:54:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:54:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:54:17,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:54:18,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2024-11-22 21:54:18,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-22 21:54:18,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:18,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2024-11-22 21:54:18,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:18,142 INFO L124 PetriNetUnfolderBase]: 24/130 cut-off events. [2024-11-22 21:54:18,143 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 21:54:18,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 130 events. 24/130 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 412 event pairs, 8 based on Foata normal form. 4/96 useless extension candidates. Maximal degree in co-relation 63. Up to 48 conditions per place. [2024-11-22 21:54:18,145 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2024-11-22 21:54:18,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 215 flow [2024-11-22 21:54:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:54:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:54:18,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2024-11-22 21:54:18,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.706081081081081 [2024-11-22 21:54:18,148 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 159 flow. Second operand 4 states and 209 transitions. [2024-11-22 21:54:18,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 215 flow [2024-11-22 21:54:18,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:54:18,152 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 156 flow [2024-11-22 21:54:18,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-11-22 21:54:18,154 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2024-11-22 21:54:18,154 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 156 flow [2024-11-22 21:54:18,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-22 21:54:18,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:18,155 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:54:18,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:54:18,155 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:18,157 INFO L85 PathProgramCache]: Analyzing trace with hash -123338293, now seen corresponding path program 1 times [2024-11-22 21:54:18,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:54:18,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762619942] [2024-11-22 21:54:18,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:54:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:18,221 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-22 21:54:18,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:54:18,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762619942] [2024-11-22 21:54:18,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762619942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:18,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:18,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:54:18,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123128003] [2024-11-22 21:54:18,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:18,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:54:18,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:54:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:54:18,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:54:18,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2024-11-22 21:54:18,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-22 21:54:18,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:18,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2024-11-22 21:54:18,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:18,361 INFO L124 PetriNetUnfolderBase]: 26/124 cut-off events. [2024-11-22 21:54:18,361 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-22 21:54:18,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 124 events. 26/124 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 361 event pairs, 12 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 118. Up to 52 conditions per place. [2024-11-22 21:54:18,364 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 27 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-22 21:54:18,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 208 flow [2024-11-22 21:54:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:54:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:54:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-22 21:54:18,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2024-11-22 21:54:18,369 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 156 flow. Second operand 3 states and 155 transitions. [2024-11-22 21:54:18,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 208 flow [2024-11-22 21:54:18,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:54:18,373 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 146 flow [2024-11-22 21:54:18,374 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2024-11-22 21:54:18,374 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2024-11-22 21:54:18,375 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 146 flow [2024-11-22 21:54:18,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-22 21:54:18,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:18,375 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:54:18,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:54:18,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:18,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash -123338292, now seen corresponding path program 1 times [2024-11-22 21:54:18,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:54:18,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581060360] [2024-11-22 21:54:18,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:18,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:54:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:18,431 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-22 21:54:18,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:54:18,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581060360] [2024-11-22 21:54:18,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581060360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:18,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:18,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:54:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215496746] [2024-11-22 21:54:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:18,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:54:18,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:54:18,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:54:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:54:18,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2024-11-22 21:54:18,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-22 21:54:18,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:18,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2024-11-22 21:54:18,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:18,531 INFO L124 PetriNetUnfolderBase]: 24/114 cut-off events. [2024-11-22 21:54:18,531 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-22 21:54:18,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 114 events. 24/114 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 314 event pairs, 12 based on Foata normal form. 4/92 useless extension candidates. Maximal degree in co-relation 118. Up to 52 conditions per place. [2024-11-22 21:54:18,532 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 25 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-11-22 21:54:18,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 194 flow [2024-11-22 21:54:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:54:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:54:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-22 21:54:18,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-22 21:54:18,534 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 146 flow. Second operand 3 states and 159 transitions. [2024-11-22 21:54:18,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 194 flow [2024-11-22 21:54:18,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:54:18,536 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2024-11-22 21:54:18,537 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2024-11-22 21:54:18,537 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2024-11-22 21:54:18,538 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2024-11-22 21:54:18,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-22 21:54:18,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:18,538 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:54:18,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:54:18,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:18,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1335114422, now seen corresponding path program 1 times [2024-11-22 21:54:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:54:18,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477097551] [2024-11-22 21:54:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:54:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:18,813 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-22 21:54:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:54:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477097551] [2024-11-22 21:54:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477097551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:18,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:18,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:54:18,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418910414] [2024-11-22 21:54:18,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:18,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:54:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:54:18,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:54:18,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:54:18,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-22 21:54:18,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 138 flow. Second operand has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-22 21:54:18,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:18,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-22 21:54:18,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:19,294 INFO L124 PetriNetUnfolderBase]: 35/141 cut-off events. [2024-11-22 21:54:19,295 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-22 21:54:19,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 141 events. 35/141 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 415 event pairs, 19 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 118. Up to 73 conditions per place. [2024-11-22 21:54:19,296 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 32 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-11-22 21:54:19,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 260 flow [2024-11-22 21:54:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:54:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:54:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2024-11-22 21:54:19,298 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6527027027027027 [2024-11-22 21:54:19,298 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 138 flow. Second operand 10 states and 483 transitions. [2024-11-22 21:54:19,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 260 flow [2024-11-22 21:54:19,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:54:19,301 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 209 flow [2024-11-22 21:54:19,301 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=209, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-11-22 21:54:19,301 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2024-11-22 21:54:19,302 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 209 flow [2024-11-22 21:54:19,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-22 21:54:19,302 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:19,302 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:54:19,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:54:19,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:19,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185515, now seen corresponding path program 1 times [2024-11-22 21:54:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:54:19,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572521955] [2024-11-22 21:54:19,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:19,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:54:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:54:19,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:54:19,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572521955] [2024-11-22 21:54:19,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572521955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:54:19,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104852649] [2024-11-22 21:54:19,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:19,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:54:19,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:54:19,668 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-22 21:54:19,669 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-22 21:54:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:19,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 21:54:19,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:54:19,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 21:54:19,905 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-22 21:54:19,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-22 21:54:19,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 21:54:19,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 21:54:20,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 21:54:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:54:20,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:54:20,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-22 21:54:20,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:54:20,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-11-22 21:54:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:54:21,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104852649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:54:21,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:54:21,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-22 21:54:21,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009838805] [2024-11-22 21:54:21,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:54:21,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 21:54:21,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:54:21,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 21:54:21,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-22 21:54:22,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 74 [2024-11-22 21:54:22,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 209 flow. Second operand has 16 states, 16 states have (on average 40.75) internal successors, (652), 16 states have internal predecessors, (652), 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-22 21:54:22,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:22,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 74 [2024-11-22 21:54:22,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:22,353 INFO L124 PetriNetUnfolderBase]: 35/152 cut-off events. [2024-11-22 21:54:22,353 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-22 21:54:22,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 152 events. 35/152 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 472 event pairs, 5 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 160. Up to 31 conditions per place. [2024-11-22 21:54:22,355 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 37 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2024-11-22 21:54:22,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 322 flow [2024-11-22 21:54:22,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:54:22,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:54:22,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 360 transitions. [2024-11-22 21:54:22,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2024-11-22 21:54:22,358 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 209 flow. Second operand 8 states and 360 transitions. [2024-11-22 21:54:22,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 322 flow [2024-11-22 21:54:22,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:54:22,363 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 224 flow [2024-11-22 21:54:22,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-11-22 21:54:22,364 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2024-11-22 21:54:22,364 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 224 flow [2024-11-22 21:54:22,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 40.75) internal successors, (652), 16 states have internal predecessors, (652), 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-22 21:54:22,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:22,365 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:54:22,376 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-22 21:54:22,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-22 21:54:22,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:22,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185516, now seen corresponding path program 1 times [2024-11-22 21:54:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:54:22,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350804577] [2024-11-22 21:54:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:54:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:54:22,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:54:22,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350804577] [2024-11-22 21:54:22,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350804577] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:54:22,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262748655] [2024-11-22 21:54:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:22,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:54:22,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:54:22,972 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-22 21:54:22,974 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-22 21:54:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:23,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-22 21:54:23,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:54:23,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 21:54:23,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 21:54:23,196 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 21:54:23,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-22 21:54:23,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-22 21:54:23,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 21:54:23,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 21:54:23,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 21:54:23,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 21:54:23,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 21:54:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:54:23,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:54:23,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-22 21:54:23,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-22 21:54:23,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-11-22 21:54:23,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:54:23,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-11-22 21:54:23,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-11-22 21:54:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:54:23,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262748655] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:54:23,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:54:23,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-22 21:54:23,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913864114] [2024-11-22 21:54:23,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:54:23,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 21:54:23,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:54:23,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 21:54:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-22 21:54:25,466 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 74 [2024-11-22 21:54:25,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 224 flow. Second operand has 19 states, 19 states have (on average 37.63157894736842) internal successors, (715), 19 states have internal predecessors, (715), 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-22 21:54:25,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:25,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 74 [2024-11-22 21:54:25,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:25,871 INFO L124 PetriNetUnfolderBase]: 33/148 cut-off events. [2024-11-22 21:54:25,872 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-22 21:54:25,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 148 events. 33/148 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 455 event pairs, 5 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 168. Up to 31 conditions per place. [2024-11-22 21:54:25,873 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 35 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2024-11-22 21:54:25,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 333 flow [2024-11-22 21:54:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:54:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:54:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2024-11-22 21:54:25,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5641891891891891 [2024-11-22 21:54:25,876 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 224 flow. Second operand 8 states and 334 transitions. [2024-11-22 21:54:25,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 333 flow [2024-11-22 21:54:25,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 299 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-22 21:54:25,878 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 208 flow [2024-11-22 21:54:25,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-11-22 21:54:25,879 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-11-22 21:54:25,879 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 208 flow [2024-11-22 21:54:25,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 37.63157894736842) internal successors, (715), 19 states have internal predecessors, (715), 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-22 21:54:25,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:25,880 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:54:25,889 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-22 21:54:26,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-22 21:54:26,085 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:26,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash -500708698, now seen corresponding path program 1 times [2024-11-22 21:54:26,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:54:26,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948325648] [2024-11-22 21:54:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:26,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:54:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:26,244 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-22 21:54:26,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:54:26,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948325648] [2024-11-22 21:54:26,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948325648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:26,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:26,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:54:26,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101773244] [2024-11-22 21:54:26,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:26,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:54:26,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:54:26,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:54:26,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:54:26,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 74 [2024-11-22 21:54:26,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-22 21:54:26,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:26,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 74 [2024-11-22 21:54:26,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:26,375 INFO L124 PetriNetUnfolderBase]: 21/77 cut-off events. [2024-11-22 21:54:26,376 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-22 21:54:26,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 77 events. 21/77 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 14 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 69. Up to 51 conditions per place. [2024-11-22 21:54:26,377 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2024-11-22 21:54:26,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 196 flow [2024-11-22 21:54:26,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:54:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:54:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-11-22 21:54:26,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2024-11-22 21:54:26,378 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 208 flow. Second operand 5 states and 224 transitions. [2024-11-22 21:54:26,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 196 flow [2024-11-22 21:54:26,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 175 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-22 21:54:26,382 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 123 flow [2024-11-22 21:54:26,382 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-22 21:54:26,384 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -28 predicate places. [2024-11-22 21:54:26,384 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 123 flow [2024-11-22 21:54:26,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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-22 21:54:26,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:26,385 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:54:26,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:54:26,385 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:26,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1419302643, now seen corresponding path program 1 times [2024-11-22 21:54:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:54:26,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880372910] [2024-11-22 21:54:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:54:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:54:26,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:54:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:54:26,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:54:26,472 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:54:26,474 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2024-11-22 21:54:26,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2024-11-22 21:54:26,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2024-11-22 21:54:26,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2024-11-22 21:54:26,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2024-11-22 21:54:26,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2024-11-22 21:54:26,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2024-11-22 21:54:26,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2024-11-22 21:54:26,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2024-11-22 21:54:26,477 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2024-11-22 21:54:26,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2024-11-22 21:54:26,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2024-11-22 21:54:26,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2024-11-22 21:54:26,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2024-11-22 21:54:26,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2024-11-22 21:54:26,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 61 remaining) [2024-11-22 21:54:26,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 61 remaining) [2024-11-22 21:54:26,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2024-11-22 21:54:26,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2024-11-22 21:54:26,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2024-11-22 21:54:26,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2024-11-22 21:54:26,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2024-11-22 21:54:26,479 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2024-11-22 21:54:26,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4ASSERT_VIOLATIONMEMORY_FREE (37 of 61 remaining) [2024-11-22 21:54:26,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12ASSERT_VIOLATIONMEMORY_FREE (36 of 61 remaining) [2024-11-22 21:54:26,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (35 of 61 remaining) [2024-11-22 21:54:26,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13ASSERT_VIOLATIONMEMORY_FREE (34 of 61 remaining) [2024-11-22 21:54:26,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (33 of 61 remaining) [2024-11-22 21:54:26,480 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14ASSERT_VIOLATIONMEMORY_FREE (32 of 61 remaining) [2024-11-22 21:54:26,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (31 of 61 remaining) [2024-11-22 21:54:26,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (30 of 61 remaining) [2024-11-22 21:54:26,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (29 of 61 remaining) [2024-11-22 21:54:26,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2024-11-22 21:54:26,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2024-11-22 21:54:26,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2024-11-22 21:54:26,481 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2024-11-22 21:54:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2024-11-22 21:54:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2024-11-22 21:54:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2024-11-22 21:54:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2024-11-22 21:54:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2024-11-22 21:54:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2024-11-22 21:54:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2024-11-22 21:54:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2024-11-22 21:54:26,482 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2024-11-22 21:54:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2024-11-22 21:54:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2024-11-22 21:54:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2024-11-22 21:54:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2024-11-22 21:54:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2024-11-22 21:54:26,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2024-11-22 21:54:26,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2024-11-22 21:54:26,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4ASSERT_VIOLATIONMEMORY_FREE (8 of 61 remaining) [2024-11-22 21:54:26,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 61 remaining) [2024-11-22 21:54:26,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (6 of 61 remaining) [2024-11-22 21:54:26,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 61 remaining) [2024-11-22 21:54:26,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (4 of 61 remaining) [2024-11-22 21:54:26,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2024-11-22 21:54:26,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2024-11-22 21:54:26,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2024-11-22 21:54:26,486 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (0 of 61 remaining) [2024-11-22 21:54:26,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:54:26,487 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:54:26,537 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:54:26,538 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:54:26,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:54:26 BasicIcfg [2024-11-22 21:54:26,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:54:26,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:54:26,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:54:26,546 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:54:26,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:16" (3/4) ... [2024-11-22 21:54:26,548 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:54:26,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:54:26,549 INFO L158 Benchmark]: Toolchain (without parser) took 11304.69ms. Allocated memory was 182.5MB in the beginning and 287.3MB in the end (delta: 104.9MB). Free memory was 122.9MB in the beginning and 198.8MB in the end (delta: -75.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-11-22 21:54:26,549 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 182.5MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:54:26,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.49ms. Allocated memory is still 182.5MB. Free memory was 122.9MB in the beginning and 92.4MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-22 21:54:26,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.14ms. Allocated memory is still 182.5MB. Free memory was 92.4MB in the beginning and 90.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:54:26,550 INFO L158 Benchmark]: Boogie Preprocessor took 49.27ms. Allocated memory is still 182.5MB. Free memory was 90.0MB in the beginning and 87.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:54:26,551 INFO L158 Benchmark]: RCFGBuilder took 781.05ms. Allocated memory was 182.5MB in the beginning and 239.1MB in the end (delta: 56.6MB). Free memory was 87.2MB in the beginning and 198.5MB in the end (delta: -111.2MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-11-22 21:54:26,551 INFO L158 Benchmark]: TraceAbstraction took 9749.17ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 197.4MB in the beginning and 199.8MB in the end (delta: -2.4MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-11-22 21:54:26,551 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 287.3MB. Free memory was 199.8MB in the beginning and 198.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:54:26,552 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 182.5MB. Free memory is still 149.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.49ms. Allocated memory is still 182.5MB. Free memory was 122.9MB in the beginning and 92.4MB in the end (delta: 30.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.14ms. Allocated memory is still 182.5MB. Free memory was 92.4MB in the beginning and 90.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.27ms. Allocated memory is still 182.5MB. Free memory was 90.0MB in the beginning and 87.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 781.05ms. Allocated memory was 182.5MB in the beginning and 239.1MB in the end (delta: 56.6MB). Free memory was 87.2MB in the beginning and 198.5MB in the end (delta: -111.2MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9749.17ms. Allocated memory was 239.1MB in the beginning and 287.3MB in the end (delta: 48.2MB). Free memory was 197.4MB in the beginning and 199.8MB in the end (delta: -2.4MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 287.3MB. Free memory was 199.8MB in the beginning and 198.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1069. Possible FailurePath: [L1070] 0 pthread_t id1, id2; [L1071] 0 struct item *list = ((void *)0); [L1072] FCALL, FORK 0 pthread_create(&id1, ((void *)0), build, list) VAL [\old(argc)=9, \old(argv)={10:11}, argc=9, id1=-1, list={0:0}] [L1048] 1 struct item *list = (struct item *)plist; [L1048] 1 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1050] CALL 1 append(&list) [L1042] 1 struct item *elem = malloc(sizeof *elem); [L1043] EXPR 1 \read(**plist) VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1043] 1 elem->next = *plist [L1044] EXPR 1 elem->next VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) VAL [\old(plist)={2:0}, elem={-1:0}, plist={2:0}] [L1044] 1 elem->data = (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1045] 1 *plist = elem [L1050] RET 1 append(&list) [L1051] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1073] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) VAL [\old(argc)=9, \old(argv)={10:11}, argc=9, id1=-1, list={0:0}] [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, argc=9, id1=-1, id2=0, list={0:0}] [L1055] 2 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1056] COND FALSE 2 !(\read(*list)) VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1062] COND FALSE 2 !(\read(*list)) [L1075] FCALL, JOIN 2 pthread_join(id2, ((void *)0)) VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, \result={0:0}, argc=9, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] [L1076] 0 return 0; VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, \result=0, \result={0:0}, argc=9, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1072]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1074]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 130 locations, 61 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: 9.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1493 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1195 mSDsluCounter, 1340 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1293 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5132 IncrementalHoareTripleChecker+Invalid, 5198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 47 mSDtfsCounter, 5132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 6 QuantifiedInterpolants, 1562 SizeOfPredicates, 37 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 6/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 21:54:26,581 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-memsafety/list1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:54:28,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:54:28,798 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:54:28,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:54:28,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:54:28,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:54:28,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:54:28,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:54:28,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:54:28,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:54:28,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:54:28,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:54:28,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:54:28,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:54:28,848 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:54:28,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:54:28,849 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:54:28,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:54:28,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:54:28,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:54:28,854 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:54:28,854 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:54:28,855 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:54:28,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:54:28,855 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:54:28,855 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:54:28,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:54:28,856 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:54:28,856 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:54:28,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:54:28,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:54:28,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:54:28,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:54:28,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:54:28,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:54:28,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:54:28,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:54:28,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:54:28,859 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:54:28,859 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:54:28,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:54:28,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:54:28,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:54:28,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:54:28,861 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 -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2024-11-22 21:54:29,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:54:29,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:54:29,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:54:29,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:54:29,173 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:54:29,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-22 21:54:30,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:54:30,870 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:54:30,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-22 21:54:30,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1132cf5e/82fcc6f216b94c6f850696a5d5136fa9/FLAGa17cd4da9 [2024-11-22 21:54:30,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1132cf5e/82fcc6f216b94c6f850696a5d5136fa9 [2024-11-22 21:54:30,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:54:30,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:54:30,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:54:30,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:54:30,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:54:30,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:54:30" (1/1) ... [2024-11-22 21:54:30,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c8e7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:30, skipping insertion in model container [2024-11-22 21:54:30,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:54:30" (1/1) ... [2024-11-22 21:54:30,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:54:31,434 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:54:31,442 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 21:54:31,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:54:31,468 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:54:31,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:54:31,585 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:54:31,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31 WrapperNode [2024-11-22 21:54:31,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:54:31,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:54:31,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:54:31,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:54:31,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,670 INFO L138 Inliner]: procedures = 265, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-22 21:54:31,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:54:31,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:54:31,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:54:31,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:54:31,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,719 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [3, 8]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 3 writes are split as follows [1, 2]. [2024-11-22 21:54:31,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:54:31,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:54:31,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:54:31,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:54:31,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (1/1) ... [2024-11-22 21:54:31,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:54:31,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:54:31,788 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-22 21:54:31,791 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-22 21:54:31,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 21:54:31,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 21:54:31,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 21:54:31,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 21:54:31,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 21:54:31,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 21:54:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:54:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 21:54:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 21:54:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2024-11-22 21:54:31,840 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2024-11-22 21:54:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure build [2024-11-22 21:54:31,840 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2024-11-22 21:54:31,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:54:31,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:54:31,842 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:54:32,018 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:54:32,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:54:32,417 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:54:32,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:54:32,545 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:54:32,546 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 21:54:32,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:32 BoogieIcfgContainer [2024-11-22 21:54:32,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:54:32,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:54:32,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:54:32,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:54:32,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:54:30" (1/3) ... [2024-11-22 21:54:32,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281b2129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:54:32, skipping insertion in model container [2024-11-22 21:54:32,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:54:31" (2/3) ... [2024-11-22 21:54:32,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281b2129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:54:32, skipping insertion in model container [2024-11-22 21:54:32,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:54:32" (3/3) ... [2024-11-22 21:54:32,553 INFO L112 eAbstractionObserver]: Analyzing ICFG list1.i [2024-11-22 21:54:32,569 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:54:32,570 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-22 21:54:32,570 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:54:32,671 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-22 21:54:32,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 162 flow [2024-11-22 21:54:32,752 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2024-11-22 21:54:32,752 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-22 21:54:32,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 5/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 206 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2024-11-22 21:54:32,756 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 162 flow [2024-11-22 21:54:32,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 154 flow [2024-11-22 21:54:32,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:54:32,774 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;@119ccea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:54:32,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-22 21:54:32,778 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:54:32,778 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-22 21:54:32,778 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-22 21:54:32,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:32,779 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:54:32,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:32,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:32,786 INFO L85 PathProgramCache]: Analyzing trace with hash 273116001, now seen corresponding path program 1 times [2024-11-22 21:54:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:54:32,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616062231] [2024-11-22 21:54:32,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:32,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:32,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:54:32,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:54:32,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 21:54:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:32,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 21:54:32,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:54:32,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 21:54:33,027 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 21:54:33,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-22 21:54:33,055 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-22 21:54:33,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:54:33,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:54:33,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616062231] [2024-11-22 21:54:33,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616062231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:33,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:33,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:54:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302971352] [2024-11-22 21:54:33,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:33,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:54:33,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:54:33,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:54:33,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:54:33,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-22 21:54:33,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-22 21:54:33,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:33,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-22 21:54:33,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:33,412 INFO L124 PetriNetUnfolderBase]: 25/148 cut-off events. [2024-11-22 21:54:33,412 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 21:54:33,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 148 events. 25/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 513 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 120. Up to 31 conditions per place. [2024-11-22 21:54:33,416 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-11-22 21:54:33,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 231 flow [2024-11-22 21:54:33,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:54:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:54:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2024-11-22 21:54:33,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-22 21:54:33,447 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 154 flow. Second operand 4 states and 212 transitions. [2024-11-22 21:54:33,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 231 flow [2024-11-22 21:54:33,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:54:33,457 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 159 flow [2024-11-22 21:54:33,461 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2024-11-22 21:54:33,467 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-11-22 21:54:33,467 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 159 flow [2024-11-22 21:54:33,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-22 21:54:33,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:33,468 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 21:54:33,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 21:54:33,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:33,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:33,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash 273116002, now seen corresponding path program 1 times [2024-11-22 21:54:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:54:33,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990026064] [2024-11-22 21:54:33,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:33,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:33,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:54:33,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:54:33,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 21:54:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:33,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 21:54:33,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:54:33,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:54:33,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 21:54:33,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:54:33,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 21:54:33,878 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 21:54:33,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-22 21:54:33,891 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-22 21:54:33,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:54:33,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:54:33,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990026064] [2024-11-22 21:54:33,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990026064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:33,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:33,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:54:33,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824009581] [2024-11-22 21:54:33,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:33,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:54:33,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:54:33,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:54:33,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:54:34,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2024-11-22 21:54:34,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-22 21:54:34,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:34,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2024-11-22 21:54:34,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:34,207 INFO L124 PetriNetUnfolderBase]: 27/156 cut-off events. [2024-11-22 21:54:34,208 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-22 21:54:34,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 156 events. 27/156 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs, 4 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 63. Up to 42 conditions per place. [2024-11-22 21:54:34,212 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 29 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2024-11-22 21:54:34,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 247 flow [2024-11-22 21:54:34,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:54:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:54:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2024-11-22 21:54:34,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7331081081081081 [2024-11-22 21:54:34,216 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 159 flow. Second operand 4 states and 217 transitions. [2024-11-22 21:54:34,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 247 flow [2024-11-22 21:54:34,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:54:34,220 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 175 flow [2024-11-22 21:54:34,220 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-11-22 21:54:34,221 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2024-11-22 21:54:34,221 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 175 flow [2024-11-22 21:54:34,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-22 21:54:34,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:34,221 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:54:34,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 21:54:34,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:34,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:34,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:34,425 INFO L85 PathProgramCache]: Analyzing trace with hash -123338293, now seen corresponding path program 1 times [2024-11-22 21:54:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:54:34,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829497020] [2024-11-22 21:54:34,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:34,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:34,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:54:34,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:54:34,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 21:54:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:34,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:54:34,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:54:34,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 21:54:34,513 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-22 21:54:34,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:54:34,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:54:34,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829497020] [2024-11-22 21:54:34,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829497020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:34,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:34,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:54:34,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063361387] [2024-11-22 21:54:34,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:34,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:54:34,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:54:34,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:54:34,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:54:34,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2024-11-22 21:54:34,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-22 21:54:34,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:34,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2024-11-22 21:54:34,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:34,662 INFO L124 PetriNetUnfolderBase]: 28/134 cut-off events. [2024-11-22 21:54:34,666 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-22 21:54:34,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 134 events. 28/134 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 415 event pairs, 12 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 122. Up to 54 conditions per place. [2024-11-22 21:54:34,667 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 27 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-11-22 21:54:34,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 229 flow [2024-11-22 21:54:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:54:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:54:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-22 21:54:34,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2024-11-22 21:54:34,669 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 175 flow. Second operand 3 states and 155 transitions. [2024-11-22 21:54:34,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 229 flow [2024-11-22 21:54:34,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:54:34,675 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 164 flow [2024-11-22 21:54:34,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-11-22 21:54:34,676 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2024-11-22 21:54:34,676 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 164 flow [2024-11-22 21:54:34,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-22 21:54:34,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:34,676 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 21:54:34,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 21:54:34,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:34,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:34,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:34,881 INFO L85 PathProgramCache]: Analyzing trace with hash -123338292, now seen corresponding path program 1 times [2024-11-22 21:54:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:54:34,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311620630] [2024-11-22 21:54:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:34,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:54:34,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:54:34,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 21:54:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:34,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 21:54:34,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:54:34,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 21:54:34,995 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-22 21:54:34,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:54:34,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:54:34,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311620630] [2024-11-22 21:54:34,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311620630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:34,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:34,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:54:34,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626720350] [2024-11-22 21:54:34,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:34,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:54:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:54:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:54:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:54:35,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2024-11-22 21:54:35,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-22 21:54:35,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:35,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2024-11-22 21:54:35,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:35,154 INFO L124 PetriNetUnfolderBase]: 26/122 cut-off events. [2024-11-22 21:54:35,155 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-22 21:54:35,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 122 events. 26/122 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 362 event pairs, 12 based on Foata normal form. 4/100 useless extension candidates. Maximal degree in co-relation 118. Up to 54 conditions per place. [2024-11-22 21:54:35,156 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-11-22 21:54:35,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 214 flow [2024-11-22 21:54:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:54:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:54:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-22 21:54:35,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-22 21:54:35,158 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 164 flow. Second operand 3 states and 159 transitions. [2024-11-22 21:54:35,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 214 flow [2024-11-22 21:54:35,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:54:35,161 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 156 flow [2024-11-22 21:54:35,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-11-22 21:54:35,162 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2024-11-22 21:54:35,162 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 156 flow [2024-11-22 21:54:35,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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-22 21:54:35,162 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:35,163 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:54:35,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 21:54:35,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:35,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:35,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:35,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1335115542, now seen corresponding path program 1 times [2024-11-22 21:54:35,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:54:35,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582675907] [2024-11-22 21:54:35,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:35,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:35,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:54:35,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:54:35,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 21:54:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:35,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:54:35,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:54:35,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:54:35,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-22 21:54:35,549 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 21:54:35,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-22 21:54:35,576 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-22 21:54:35,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:54:35,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:54:35,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582675907] [2024-11-22 21:54:35,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582675907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:35,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:54:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197010054] [2024-11-22 21:54:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:35,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:54:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:54:35,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:54:35,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:54:35,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2024-11-22 21:54:35,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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-22 21:54:35,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:35,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2024-11-22 21:54:35,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:35,823 INFO L124 PetriNetUnfolderBase]: 27/121 cut-off events. [2024-11-22 21:54:35,823 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-22 21:54:35,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 121 events. 27/121 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 350 event pairs, 8 based on Foata normal form. 2/97 useless extension candidates. Maximal degree in co-relation 118. Up to 50 conditions per place. [2024-11-22 21:54:35,825 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 26 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2024-11-22 21:54:35,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 220 flow [2024-11-22 21:54:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:54:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:54:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-11-22 21:54:35,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2024-11-22 21:54:35,827 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 156 flow. Second operand 5 states and 240 transitions. [2024-11-22 21:54:35,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 220 flow [2024-11-22 21:54:35,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:54:35,829 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 156 flow [2024-11-22 21:54:35,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-11-22 21:54:35,830 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2024-11-22 21:54:35,830 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 156 flow [2024-11-22 21:54:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 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-22 21:54:35,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:35,830 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:54:35,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 21:54:36,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:36,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:36,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1335114422, now seen corresponding path program 1 times [2024-11-22 21:54:36,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:54:36,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173987604] [2024-11-22 21:54:36,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:36,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:54:36,037 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:54:36,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 21:54:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:36,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 21:54:36,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:54:36,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 21:54:36,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 21:54:36,275 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-22 21:54:36,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:54:36,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:54:36,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173987604] [2024-11-22 21:54:36,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173987604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:54:36,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:54:36,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 21:54:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335192401] [2024-11-22 21:54:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:54:36,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 21:54:36,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:54:36,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 21:54:36,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 21:54:36,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-22 21:54:36,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 156 flow. Second operand has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-22 21:54:36,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:54:36,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-22 21:54:36,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:54:36,929 INFO L124 PetriNetUnfolderBase]: 36/144 cut-off events. [2024-11-22 21:54:36,930 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-22 21:54:36,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 144 events. 36/144 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 437 event pairs, 20 based on Foata normal form. 2/120 useless extension candidates. Maximal degree in co-relation 118. Up to 76 conditions per place. [2024-11-22 21:54:36,931 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 33 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2024-11-22 21:54:36,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 288 flow [2024-11-22 21:54:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:54:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:54:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2024-11-22 21:54:36,933 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6527027027027027 [2024-11-22 21:54:36,933 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 156 flow. Second operand 10 states and 483 transitions. [2024-11-22 21:54:36,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 288 flow [2024-11-22 21:54:36,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 74 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:54:36,935 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 227 flow [2024-11-22 21:54:36,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=227, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2024-11-22 21:54:36,936 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-11-22 21:54:36,936 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 227 flow [2024-11-22 21:54:36,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 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-22 21:54:36,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:54:36,937 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:54:36,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-22 21:54:37,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:37,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:54:37,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:54:37,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185515, now seen corresponding path program 1 times [2024-11-22 21:54:37,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:54:37,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555237717] [2024-11-22 21:54:37,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:54:37,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:54:37,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:54:37,141 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:54:37,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 21:54:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:54:37,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 21:54:37,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:54:37,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-22 21:54:37,330 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-22 21:54:37,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-22 21:54:37,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 21:54:37,387 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-22 21:54:37,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2024-11-22 21:54:37,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-22 21:54:37,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 21:54:37,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-22 21:54:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:54:37,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:54:37,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-22 21:54:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:54:46,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:54:46,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555237717] [2024-11-22 21:54:46,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555237717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:54:46,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:54:46,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-11-22 21:54:46,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646885586] [2024-11-22 21:54:46,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:54:46,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:54:46,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:54:46,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:54:46,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=147, Unknown=2, NotChecked=0, Total=182 [2024-11-22 21:54:50,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 21:54:54,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 21:54:58,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 21:55:02,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 21:55:06,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 21:55:06,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 74 [2024-11-22 21:55:06,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 227 flow. Second operand has 14 states, 14 states have (on average 24.142857142857142) internal successors, (338), 14 states have internal predecessors, (338), 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-22 21:55:06,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:55:06,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 74 [2024-11-22 21:55:06,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:55:07,562 INFO L124 PetriNetUnfolderBase]: 46/175 cut-off events. [2024-11-22 21:55:07,562 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-22 21:55:07,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 175 events. 46/175 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 585 event pairs, 11 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 212. Up to 52 conditions per place. [2024-11-22 21:55:07,563 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 49 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2024-11-22 21:55:07,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 372 flow [2024-11-22 21:55:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:55:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:55:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions. [2024-11-22 21:55:07,565 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39864864864864863 [2024-11-22 21:55:07,565 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 227 flow. Second operand 8 states and 236 transitions. [2024-11-22 21:55:07,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 372 flow [2024-11-22 21:55:07,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 80 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:55:07,569 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 244 flow [2024-11-22 21:55:07,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-11-22 21:55:07,569 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 7 predicate places. [2024-11-22 21:55:07,570 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 244 flow [2024-11-22 21:55:07,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.142857142857142) internal successors, (338), 14 states have internal predecessors, (338), 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-22 21:55:07,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:55:07,570 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:55:07,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-22 21:55:07,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:55:07,771 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-22 21:55:07,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:55:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185516, now seen corresponding path program 1 times [2024-11-22 21:55:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:55:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264103683] [2024-11-22 21:55:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:55:07,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:55:07,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:55:07,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:55:07,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 21:55:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:55:07,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 21:55:07,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:55:07,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 21:55:08,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 21:55:08,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 21:55:08,076 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 21:55:08,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-22 21:55:08,106 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-22 21:55:08,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-22 21:55:08,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 21:55:08,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 21:55:08,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 21:55:08,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-22 21:55:08,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 21:55:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:55:08,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:55:08,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2024-11-22 21:55:08,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-22 21:55:08,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-11-22 21:55:12,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 21:55:12,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 251 treesize of output 681