./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:44:15,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:44:15,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:44:15,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:44:15,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:44:15,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:44:15,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:44:15,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:44:15,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:44:15,609 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:44:15,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:44:15,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:44:15,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:44:15,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:44:15,610 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:44:15,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:44:15,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:44:15,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:44:15,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:44:15,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:44:15,611 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:44:15,613 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:44:15,613 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:44:15,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:44:15,614 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:44:15,614 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:44:15,614 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:44:15,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:44:15,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:44:15,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:44:15,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:44:15,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:44:15,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:44:15,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:44:15,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:44:15,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:44:15,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:44:15,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:44:15,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:44:15,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:44:15,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:44:15,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:44:15,617 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2024-10-11 19:44:15,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:44:15,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:44:15,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:44:15,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:44:15,847 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:44:15,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2024-10-11 19:44:17,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:44:17,336 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:44:17,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2024-10-11 19:44:17,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c51f4c9b2/17809ae8141d4c3d88dc88c3d1ed0e40/FLAGc9576fd7d [2024-10-11 19:44:17,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c51f4c9b2/17809ae8141d4c3d88dc88c3d1ed0e40 [2024-10-11 19:44:17,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:44:17,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:44:17,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:44:17,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:44:17,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:44:17,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ddda42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17, skipping insertion in model container [2024-10-11 19:44:17,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:44:17,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:44:17,787 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:44:17,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:44:17,897 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:44:17,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17 WrapperNode [2024-10-11 19:44:17,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:44:17,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:44:17,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:44:17,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:44:17,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,945 INFO L138 Inliner]: procedures = 368, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 89 [2024-10-11 19:44:17,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:44:17,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:44:17,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:44:17,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:44:17,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,978 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [5, 5, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [5, 5, 0]. The 12 writes are split as follows [0, 0, 12]. [2024-10-11 19:44:17,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:17,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:18,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:44:18,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:44:18,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:44:18,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:44:18,010 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (1/1) ... [2024-10-11 19:44:18,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:44:18,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:44:18,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:44:18,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:44:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:44:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:44:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:44:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 19:44:18,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 19:44:18,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 19:44:18,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 19:44:18,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 19:44:18,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 19:44:18,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 19:44:18,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 19:44:18,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:44:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:44:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:44:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:44:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:44:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 19:44:18,098 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 19:44:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:44:18,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 19:44:18,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 19:44:18,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:44:18,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:44:18,101 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:44:18,220 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:44:18,222 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:44:18,488 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:44:18,488 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:44:18,684 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:44:18,685 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:44:18,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:18 BoogieIcfgContainer [2024-10-11 19:44:18,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:44:18,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:44:18,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:44:18,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:44:18,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:44:17" (1/3) ... [2024-10-11 19:44:18,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2c69ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:44:18, skipping insertion in model container [2024-10-11 19:44:18,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:17" (2/3) ... [2024-10-11 19:44:18,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2c69ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:44:18, skipping insertion in model container [2024-10-11 19:44:18,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:18" (3/3) ... [2024-10-11 19:44:18,695 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2024-10-11 19:44:18,710 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:44:18,710 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-11 19:44:18,710 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:44:18,758 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:44:18,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 170 flow [2024-10-11 19:44:18,830 INFO L124 PetriNetUnfolderBase]: 0/82 cut-off events. [2024-10-11 19:44:18,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:18,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 181 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-10-11 19:44:18,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 170 flow [2024-10-11 19:44:18,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 167 flow [2024-10-11 19:44:18,843 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:44:18,849 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a88c1df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:44:18,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-10-11 19:44:18,851 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:44:18,852 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-10-11 19:44:18,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:18,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:18,853 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-10-11 19:44:18,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:18,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash 11284, now seen corresponding path program 1 times [2024-10-11 19:44:18,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:18,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172294315] [2024-10-11 19:44:18,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:18,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:19,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:19,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172294315] [2024-10-11 19:44:19,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172294315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:19,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:19,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:44:19,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581804446] [2024-10-11 19:44:19,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:19,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:19,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:19,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:19,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:19,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2024-10-11 19:44:19,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:19,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:19,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2024-10-11 19:44:19,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:19,356 INFO L124 PetriNetUnfolderBase]: 99/370 cut-off events. [2024-10-11 19:44:19,356 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:19,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 370 events. 99/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1819 event pairs, 99 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 564. Up to 223 conditions per place. [2024-10-11 19:44:19,364 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 28 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2024-10-11 19:44:19,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 215 flow [2024-10-11 19:44:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2024-10-11 19:44:19,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2024-10-11 19:44:19,379 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 167 flow. Second operand 3 states and 169 transitions. [2024-10-11 19:44:19,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 215 flow [2024-10-11 19:44:19,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:19,385 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 158 flow [2024-10-11 19:44:19,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2024-10-11 19:44:19,390 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2024-10-11 19:44:19,391 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 158 flow [2024-10-11 19:44:19,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:19,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:19,392 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-10-11 19:44:19,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:44:19,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:19,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:19,393 INFO L85 PathProgramCache]: Analyzing trace with hash 11285, now seen corresponding path program 1 times [2024-10-11 19:44:19,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:19,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965412493] [2024-10-11 19:44:19,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:19,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965412493] [2024-10-11 19:44:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965412493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:19,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:44:19,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071703061] [2024-10-11 19:44:19,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:19,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:19,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:19,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:19,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2024-10-11 19:44:19,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:19,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:19,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2024-10-11 19:44:19,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:19,740 INFO L124 PetriNetUnfolderBase]: 99/362 cut-off events. [2024-10-11 19:44:19,740 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:44:19,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 362 events. 99/362 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1810 event pairs, 99 based on Foata normal form. 6/311 useless extension candidates. Maximal degree in co-relation 572. Up to 223 conditions per place. [2024-10-11 19:44:19,745 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2024-10-11 19:44:19,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 198 flow [2024-10-11 19:44:19,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2024-10-11 19:44:19,747 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2024-10-11 19:44:19,747 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 158 flow. Second operand 3 states and 177 transitions. [2024-10-11 19:44:19,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 198 flow [2024-10-11 19:44:19,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:19,748 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 142 flow [2024-10-11 19:44:19,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2024-10-11 19:44:19,750 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2024-10-11 19:44:19,750 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 142 flow [2024-10-11 19:44:19,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:19,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:19,751 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:44:19,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:44:19,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:19,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:19,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1840858293, now seen corresponding path program 1 times [2024-10-11 19:44:19,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:19,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655559488] [2024-10-11 19:44:19,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:19,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:19,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:19,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655559488] [2024-10-11 19:44:19,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655559488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:19,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:19,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:44:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099010427] [2024-10-11 19:44:19,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:19,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:44:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:19,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:44:19,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:44:19,970 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 83 [2024-10-11 19:44:19,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:19,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:19,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 83 [2024-10-11 19:44:19,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:20,079 INFO L124 PetriNetUnfolderBase]: 110/392 cut-off events. [2024-10-11 19:44:20,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:20,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 392 events. 110/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1982 event pairs, 110 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 626. Up to 249 conditions per place. [2024-10-11 19:44:20,082 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-10-11 19:44:20,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 202 flow [2024-10-11 19:44:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:44:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:44:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-10-11 19:44:20,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5783132530120482 [2024-10-11 19:44:20,083 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 142 flow. Second operand 4 states and 192 transitions. [2024-10-11 19:44:20,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 202 flow [2024-10-11 19:44:20,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:20,085 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 132 flow [2024-10-11 19:44:20,085 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, 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=4, PETRI_FLOW=132, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2024-10-11 19:44:20,085 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -17 predicate places. [2024-10-11 19:44:20,085 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 132 flow [2024-10-11 19:44:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:20,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:20,086 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:44:20,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:44:20,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:20,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1840858294, now seen corresponding path program 1 times [2024-10-11 19:44:20,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:20,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255225282] [2024-10-11 19:44:20,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:20,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:20,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:20,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255225282] [2024-10-11 19:44:20,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255225282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:20,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:20,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:44:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333088525] [2024-10-11 19:44:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:20,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:44:20,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:20,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:44:20,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:44:20,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2024-10-11 19:44:20,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:20,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:20,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2024-10-11 19:44:20,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:20,405 INFO L124 PetriNetUnfolderBase]: 110/387 cut-off events. [2024-10-11 19:44:20,405 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:44:20,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 387 events. 110/387 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1977 event pairs, 110 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 630. Up to 247 conditions per place. [2024-10-11 19:44:20,409 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 27 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-10-11 19:44:20,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 184 flow [2024-10-11 19:44:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:44:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:44:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2024-10-11 19:44:20,412 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2024-10-11 19:44:20,412 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 132 flow. Second operand 4 states and 236 transitions. [2024-10-11 19:44:20,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 184 flow [2024-10-11 19:44:20,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:20,414 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 127 flow [2024-10-11 19:44:20,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2024-10-11 19:44:20,416 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -19 predicate places. [2024-10-11 19:44:20,416 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 127 flow [2024-10-11 19:44:20,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:20,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:20,417 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:20,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:44:20,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:20,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:20,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1865543333, now seen corresponding path program 1 times [2024-10-11 19:44:20,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:20,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579611130] [2024-10-11 19:44:20,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:20,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:20,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:20,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579611130] [2024-10-11 19:44:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579611130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:20,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:44:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105743209] [2024-10-11 19:44:20,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:20,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:44:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:20,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:44:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:44:20,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2024-10-11 19:44:20,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:20,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:20,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2024-10-11 19:44:20,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:20,734 INFO L124 PetriNetUnfolderBase]: 110/357 cut-off events. [2024-10-11 19:44:20,735 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:20,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 357 events. 110/357 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1692 event pairs, 110 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 602. Up to 248 conditions per place. [2024-10-11 19:44:20,737 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 32 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2024-10-11 19:44:20,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 187 flow [2024-10-11 19:44:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2024-10-11 19:44:20,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2024-10-11 19:44:20,739 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 127 flow. Second operand 3 states and 177 transitions. [2024-10-11 19:44:20,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 187 flow [2024-10-11 19:44:20,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:20,742 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 120 flow [2024-10-11 19:44:20,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-10-11 19:44:20,744 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2024-10-11 19:44:20,744 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 120 flow [2024-10-11 19:44:20,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:20,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:20,745 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:20,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:44:20,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:20,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1865543332, now seen corresponding path program 1 times [2024-10-11 19:44:20,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:20,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267749678] [2024-10-11 19:44:20,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:20,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267749678] [2024-10-11 19:44:20,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267749678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:20,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:20,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:44:20,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204781508] [2024-10-11 19:44:20,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:20,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:44:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:20,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:44:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:44:21,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2024-10-11 19:44:21,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:21,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:21,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2024-10-11 19:44:21,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:21,138 INFO L124 PetriNetUnfolderBase]: 110/344 cut-off events. [2024-10-11 19:44:21,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:21,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 344 events. 110/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1577 event pairs, 110 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 590. Up to 246 conditions per place. [2024-10-11 19:44:21,141 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-10-11 19:44:21,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 54 transitions, 180 flow [2024-10-11 19:44:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:44:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:44:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2024-10-11 19:44:21,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5421686746987951 [2024-10-11 19:44:21,142 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 120 flow. Second operand 4 states and 180 transitions. [2024-10-11 19:44:21,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 54 transitions, 180 flow [2024-10-11 19:44:21,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:21,143 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 117 flow [2024-10-11 19:44:21,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-10-11 19:44:21,143 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -23 predicate places. [2024-10-11 19:44:21,144 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 117 flow [2024-10-11 19:44:21,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:21,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:21,144 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:21,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:44:21,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:21,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2094825083, now seen corresponding path program 1 times [2024-10-11 19:44:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:21,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892717295] [2024-10-11 19:44:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:21,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:21,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:21,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892717295] [2024-10-11 19:44:21,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892717295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:21,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:21,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 19:44:21,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032206946] [2024-10-11 19:44:21,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:21,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:44:21,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:21,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:44:21,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:44:22,494 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-10-11 19:44:22,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 117 flow. Second operand has 13 states, 13 states have (on average 35.15384615384615) internal successors, (457), 13 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:22,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:22,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-10-11 19:44:22,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:22,822 INFO L124 PetriNetUnfolderBase]: 167/488 cut-off events. [2024-10-11 19:44:22,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:22,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 488 events. 167/488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2508 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 857. Up to 180 conditions per place. [2024-10-11 19:44:22,825 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 61 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2024-10-11 19:44:22,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 91 transitions, 341 flow [2024-10-11 19:44:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 19:44:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 19:44:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 456 transitions. [2024-10-11 19:44:22,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4994523548740416 [2024-10-11 19:44:22,827 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 117 flow. Second operand 11 states and 456 transitions. [2024-10-11 19:44:22,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 91 transitions, 341 flow [2024-10-11 19:44:22,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:22,830 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 171 flow [2024-10-11 19:44:22,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=171, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2024-10-11 19:44:22,831 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -14 predicate places. [2024-10-11 19:44:22,831 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 171 flow [2024-10-11 19:44:22,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.15384615384615) internal successors, (457), 13 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:22,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:22,832 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:22,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 19:44:22,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2094825082, now seen corresponding path program 1 times [2024-10-11 19:44:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366922725] [2024-10-11 19:44:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:23,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:23,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366922725] [2024-10-11 19:44:23,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366922725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:23,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:23,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:44:23,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24242650] [2024-10-11 19:44:23,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:23,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:44:23,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:44:23,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:44:24,015 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 83 [2024-10-11 19:44:24,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 171 flow. Second operand has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 9 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:24,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:24,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 83 [2024-10-11 19:44:24,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:24,311 INFO L124 PetriNetUnfolderBase]: 176/487 cut-off events. [2024-10-11 19:44:24,312 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-10-11 19:44:24,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 487 events. 176/487 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2507 event pairs, 2 based on Foata normal form. 15/445 useless extension candidates. Maximal degree in co-relation 993. Up to 247 conditions per place. [2024-10-11 19:44:24,314 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 65 selfloop transitions, 13 changer transitions 0/91 dead transitions. [2024-10-11 19:44:24,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 91 transitions, 403 flow [2024-10-11 19:44:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:44:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:44:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 448 transitions. [2024-10-11 19:44:24,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5997322623828648 [2024-10-11 19:44:24,316 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 171 flow. Second operand 9 states and 448 transitions. [2024-10-11 19:44:24,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 91 transitions, 403 flow [2024-10-11 19:44:24,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 395 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:44:24,319 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 201 flow [2024-10-11 19:44:24,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2024-10-11 19:44:24,320 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -12 predicate places. [2024-10-11 19:44:24,321 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 201 flow [2024-10-11 19:44:24,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 9 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:24,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:24,322 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:24,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:44:24,322 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:24,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:24,322 INFO L85 PathProgramCache]: Analyzing trace with hash -2128602727, now seen corresponding path program 1 times [2024-10-11 19:44:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:24,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730190017] [2024-10-11 19:44:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:24,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:24,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730190017] [2024-10-11 19:44:24,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730190017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:24,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:24,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:44:24,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839559911] [2024-10-11 19:44:24,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:24,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:44:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:24,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:44:24,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:44:25,181 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2024-10-11 19:44:25,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 44.77777777777778) internal successors, (403), 9 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:25,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:25,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2024-10-11 19:44:25,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:25,397 INFO L124 PetriNetUnfolderBase]: 166/466 cut-off events. [2024-10-11 19:44:25,397 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2024-10-11 19:44:25,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 466 events. 166/466 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2378 event pairs, 42 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 986. Up to 184 conditions per place. [2024-10-11 19:44:25,400 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 70 selfloop transitions, 16 changer transitions 0/99 dead transitions. [2024-10-11 19:44:25,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 99 transitions, 465 flow [2024-10-11 19:44:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:44:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:44:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 516 transitions. [2024-10-11 19:44:25,402 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6216867469879518 [2024-10-11 19:44:25,402 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 201 flow. Second operand 10 states and 516 transitions. [2024-10-11 19:44:25,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 99 transitions, 465 flow [2024-10-11 19:44:25,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 99 transitions, 452 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-10-11 19:44:25,405 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 244 flow [2024-10-11 19:44:25,405 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=244, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2024-10-11 19:44:25,406 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2024-10-11 19:44:25,407 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 244 flow [2024-10-11 19:44:25,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.77777777777778) internal successors, (403), 9 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:25,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:25,407 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-10-11 19:44:25,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:44:25,407 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:25,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1460892621, now seen corresponding path program 1 times [2024-10-11 19:44:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:25,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105713129] [2024-10-11 19:44:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:25,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:25,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105713129] [2024-10-11 19:44:25,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105713129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:25,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:25,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:44:25,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836666558] [2024-10-11 19:44:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:25,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:25,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:25,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:25,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:25,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 83 [2024-10-11 19:44:25,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:25,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:25,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 83 [2024-10-11 19:44:25,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:25,567 INFO L124 PetriNetUnfolderBase]: 105/347 cut-off events. [2024-10-11 19:44:25,567 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-10-11 19:44:25,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 347 events. 105/347 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1757 event pairs, 43 based on Foata normal form. 6/335 useless extension candidates. Maximal degree in co-relation 750. Up to 174 conditions per place. [2024-10-11 19:44:25,569 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 48 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2024-10-11 19:44:25,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 78 transitions, 390 flow [2024-10-11 19:44:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-10-11 19:44:25,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2024-10-11 19:44:25,571 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 244 flow. Second operand 3 states and 213 transitions. [2024-10-11 19:44:25,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 78 transitions, 390 flow [2024-10-11 19:44:25,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 78 transitions, 356 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-10-11 19:44:25,574 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 226 flow [2024-10-11 19:44:25,575 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2024-10-11 19:44:25,576 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2024-10-11 19:44:25,576 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 226 flow [2024-10-11 19:44:25,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:25,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:25,577 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-10-11 19:44:25,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 19:44:25,578 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:25,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:25,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1711614886, now seen corresponding path program 1 times [2024-10-11 19:44:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:25,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321421797] [2024-10-11 19:44:25,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:25,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:25,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:25,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321421797] [2024-10-11 19:44:25,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321421797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:25,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:25,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:44:25,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570857726] [2024-10-11 19:44:25,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:25,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:44:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:25,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:44:25,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:44:25,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2024-10-11 19:44:25,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 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-10-11 19:44:25,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:25,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2024-10-11 19:44:25,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:25,911 INFO L124 PetriNetUnfolderBase]: 140/446 cut-off events. [2024-10-11 19:44:25,911 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2024-10-11 19:44:25,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 446 events. 140/446 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2392 event pairs, 14 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 987. Up to 183 conditions per place. [2024-10-11 19:44:25,913 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 58 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2024-10-11 19:44:25,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 449 flow [2024-10-11 19:44:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:44:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:44:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2024-10-11 19:44:25,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2024-10-11 19:44:25,916 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 226 flow. Second operand 5 states and 305 transitions. [2024-10-11 19:44:25,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 449 flow [2024-10-11 19:44:25,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:25,919 INFO L231 Difference]: Finished difference. Result has 82 places, 66 transitions, 273 flow [2024-10-11 19:44:25,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=82, PETRI_TRANSITIONS=66} [2024-10-11 19:44:25,919 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2024-10-11 19:44:25,919 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 66 transitions, 273 flow [2024-10-11 19:44:25,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 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-10-11 19:44:25,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:25,920 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-10-11 19:44:25,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 19:44:25,920 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:25,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:25,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1711614887, now seen corresponding path program 1 times [2024-10-11 19:44:25,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:25,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980447840] [2024-10-11 19:44:25,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:25,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:26,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:26,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980447840] [2024-10-11 19:44:26,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980447840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:26,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:26,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:44:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394480069] [2024-10-11 19:44:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:26,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:44:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:26,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:44:26,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:44:26,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 83 [2024-10-11 19:44:26,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 66 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:26,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:26,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 83 [2024-10-11 19:44:26,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:26,265 INFO L124 PetriNetUnfolderBase]: 140/436 cut-off events. [2024-10-11 19:44:26,265 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2024-10-11 19:44:26,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 436 events. 140/436 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2274 event pairs, 58 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 1048. Up to 191 conditions per place. [2024-10-11 19:44:26,267 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 48 selfloop transitions, 19 changer transitions 0/85 dead transitions. [2024-10-11 19:44:26,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 85 transitions, 463 flow [2024-10-11 19:44:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:44:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:44:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2024-10-11 19:44:26,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.608433734939759 [2024-10-11 19:44:26,268 INFO L175 Difference]: Start difference. First operand has 82 places, 66 transitions, 273 flow. Second operand 6 states and 303 transitions. [2024-10-11 19:44:26,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 85 transitions, 463 flow [2024-10-11 19:44:26,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 463 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:44:26,270 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 349 flow [2024-10-11 19:44:26,271 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2024-10-11 19:44:26,271 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 4 predicate places. [2024-10-11 19:44:26,271 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 349 flow [2024-10-11 19:44:26,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:26,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:26,273 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:26,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 19:44:26,273 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:26,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:26,273 INFO L85 PathProgramCache]: Analyzing trace with hash -38564856, now seen corresponding path program 1 times [2024-10-11 19:44:26,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:26,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297653229] [2024-10-11 19:44:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297653229] [2024-10-11 19:44:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297653229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:26,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 19:44:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183025483] [2024-10-11 19:44:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:26,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:44:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:26,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:44:26,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:44:27,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2024-10-11 19:44:27,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 67 transitions, 349 flow. Second operand has 14 states, 14 states have (on average 34.5) internal successors, (483), 14 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:27,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:27,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2024-10-11 19:44:27,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:28,020 INFO L124 PetriNetUnfolderBase]: 167/474 cut-off events. [2024-10-11 19:44:28,021 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2024-10-11 19:44:28,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 474 events. 167/474 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2446 event pairs, 12 based on Foata normal form. 6/468 useless extension candidates. Maximal degree in co-relation 1365. Up to 76 conditions per place. [2024-10-11 19:44:28,024 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 73 selfloop transitions, 49 changer transitions 2/137 dead transitions. [2024-10-11 19:44:28,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 137 transitions, 893 flow [2024-10-11 19:44:28,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 19:44:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 19:44:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 834 transitions. [2024-10-11 19:44:28,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45673603504928806 [2024-10-11 19:44:28,028 INFO L175 Difference]: Start difference. First operand has 90 places, 67 transitions, 349 flow. Second operand 22 states and 834 transitions. [2024-10-11 19:44:28,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 137 transitions, 893 flow [2024-10-11 19:44:28,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 137 transitions, 856 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-10-11 19:44:28,032 INFO L231 Difference]: Finished difference. Result has 109 places, 88 transitions, 550 flow [2024-10-11 19:44:28,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=550, PETRI_PLACES=109, PETRI_TRANSITIONS=88} [2024-10-11 19:44:28,033 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 23 predicate places. [2024-10-11 19:44:28,033 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 88 transitions, 550 flow [2024-10-11 19:44:28,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 34.5) internal successors, (483), 14 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:28,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:28,034 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:28,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 19:44:28,034 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:28,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2004021681, now seen corresponding path program 1 times [2024-10-11 19:44:28,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:28,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319015549] [2024-10-11 19:44:28,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:28,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:28,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319015549] [2024-10-11 19:44:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319015549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 19:44:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473661328] [2024-10-11 19:44:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:44:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:44:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:44:28,864 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2024-10-11 19:44:28,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 88 transitions, 550 flow. Second operand has 13 states, 13 states have (on average 36.61538461538461) internal successors, (476), 13 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:28,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:28,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2024-10-11 19:44:28,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:29,168 INFO L124 PetriNetUnfolderBase]: 147/453 cut-off events. [2024-10-11 19:44:29,168 INFO L125 PetriNetUnfolderBase]: For 754/754 co-relation queries the response was YES. [2024-10-11 19:44:29,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 453 events. 147/453 cut-off events. For 754/754 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2412 event pairs, 27 based on Foata normal form. 6/443 useless extension candidates. Maximal degree in co-relation 1380. Up to 72 conditions per place. [2024-10-11 19:44:29,171 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 62 selfloop transitions, 40 changer transitions 0/117 dead transitions. [2024-10-11 19:44:29,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 117 transitions, 846 flow [2024-10-11 19:44:29,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:44:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 19:44:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 499 transitions. [2024-10-11 19:44:29,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.501004016064257 [2024-10-11 19:44:29,173 INFO L175 Difference]: Start difference. First operand has 109 places, 88 transitions, 550 flow. Second operand 12 states and 499 transitions. [2024-10-11 19:44:29,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 117 transitions, 846 flow [2024-10-11 19:44:29,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 117 transitions, 797 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-10-11 19:44:29,177 INFO L231 Difference]: Finished difference. Result has 112 places, 88 transitions, 602 flow [2024-10-11 19:44:29,178 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=602, PETRI_PLACES=112, PETRI_TRANSITIONS=88} [2024-10-11 19:44:29,178 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 26 predicate places. [2024-10-11 19:44:29,178 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 88 transitions, 602 flow [2024-10-11 19:44:29,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 36.61538461538461) internal successors, (476), 13 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:29,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:29,179 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:29,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 19:44:29,179 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:29,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1245081057, now seen corresponding path program 1 times [2024-10-11 19:44:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:29,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354345447] [2024-10-11 19:44:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:29,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:29,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:29,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354345447] [2024-10-11 19:44:29,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354345447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:29,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:29,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 19:44:29,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894238038] [2024-10-11 19:44:29,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:29,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:44:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:29,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:44:29,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:44:30,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-10-11 19:44:30,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 88 transitions, 602 flow. Second operand has 13 states, 13 states have (on average 35.53846153846154) internal successors, (462), 13 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:30,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:30,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-10-11 19:44:30,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:30,740 INFO L124 PetriNetUnfolderBase]: 185/545 cut-off events. [2024-10-11 19:44:30,740 INFO L125 PetriNetUnfolderBase]: For 1222/1222 co-relation queries the response was YES. [2024-10-11 19:44:30,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1808 conditions, 545 events. 185/545 cut-off events. For 1222/1222 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3026 event pairs, 17 based on Foata normal form. 31/574 useless extension candidates. Maximal degree in co-relation 1767. Up to 97 conditions per place. [2024-10-11 19:44:30,743 INFO L140 encePairwiseOnDemand]: 66/83 looper letters, 98 selfloop transitions, 38 changer transitions 0/148 dead transitions. [2024-10-11 19:44:30,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 148 transitions, 1183 flow [2024-10-11 19:44:30,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 19:44:30,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 19:44:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 658 transitions. [2024-10-11 19:44:30,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4954819277108434 [2024-10-11 19:44:30,746 INFO L175 Difference]: Start difference. First operand has 112 places, 88 transitions, 602 flow. Second operand 16 states and 658 transitions. [2024-10-11 19:44:30,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 148 transitions, 1183 flow [2024-10-11 19:44:30,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 148 transitions, 1067 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-10-11 19:44:30,752 INFO L231 Difference]: Finished difference. Result has 116 places, 95 transitions, 687 flow [2024-10-11 19:44:30,752 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=687, PETRI_PLACES=116, PETRI_TRANSITIONS=95} [2024-10-11 19:44:30,753 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 30 predicate places. [2024-10-11 19:44:30,753 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 95 transitions, 687 flow [2024-10-11 19:44:30,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.53846153846154) internal successors, (462), 13 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:30,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:30,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:30,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 19:44:30,754 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:30,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:30,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1245081056, now seen corresponding path program 1 times [2024-10-11 19:44:30,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:30,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316965606] [2024-10-11 19:44:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:31,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:44:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316965606] [2024-10-11 19:44:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316965606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:31,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:31,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 19:44:31,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350852660] [2024-10-11 19:44:31,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:31,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 19:44:31,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:44:31,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 19:44:31,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-11 19:44:31,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-11 19:44:31,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 95 transitions, 687 flow. Second operand has 13 states, 13 states have (on average 33.53846153846154) internal successors, (436), 13 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:31,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:31,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-11 19:44:31,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:32,413 INFO L124 PetriNetUnfolderBase]: 201/525 cut-off events. [2024-10-11 19:44:32,414 INFO L125 PetriNetUnfolderBase]: For 1370/1370 co-relation queries the response was YES. [2024-10-11 19:44:32,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 525 events. 201/525 cut-off events. For 1370/1370 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2677 event pairs, 20 based on Foata normal form. 25/548 useless extension candidates. Maximal degree in co-relation 1859. Up to 168 conditions per place. [2024-10-11 19:44:32,417 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 87 selfloop transitions, 30 changer transitions 11/136 dead transitions. [2024-10-11 19:44:32,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 136 transitions, 1143 flow [2024-10-11 19:44:32,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 19:44:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 19:44:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 608 transitions. [2024-10-11 19:44:32,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4578313253012048 [2024-10-11 19:44:32,418 INFO L175 Difference]: Start difference. First operand has 116 places, 95 transitions, 687 flow. Second operand 16 states and 608 transitions. [2024-10-11 19:44:32,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 136 transitions, 1143 flow [2024-10-11 19:44:32,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 136 transitions, 1114 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 19:44:32,423 INFO L231 Difference]: Finished difference. Result has 121 places, 85 transitions, 619 flow [2024-10-11 19:44:32,424 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=619, PETRI_PLACES=121, PETRI_TRANSITIONS=85} [2024-10-11 19:44:32,424 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 35 predicate places. [2024-10-11 19:44:32,424 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 85 transitions, 619 flow [2024-10-11 19:44:32,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.53846153846154) internal successors, (436), 13 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:32,424 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:32,424 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:32,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 19:44:32,424 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:32,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash -866987548, now seen corresponding path program 1 times [2024-10-11 19:44:32,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:44:32,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723626705] [2024-10-11 19:44:32,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:32,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:44:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:44:32,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:44:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:44:32,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:44:32,492 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:44:32,492 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2024-10-11 19:44:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2024-10-11 19:44:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2024-10-11 19:44:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2024-10-11 19:44:32,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2024-10-11 19:44:32,495 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2024-10-11 19:44:32,496 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2024-10-11 19:44:32,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2024-10-11 19:44:32,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2024-10-11 19:44:32,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 19:44:32,498 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:32,537 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:44:32,537 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:44:32,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:44:32 BasicIcfg [2024-10-11 19:44:32,541 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:44:32,541 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:44:32,541 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:44:32,542 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:44:32,542 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:18" (3/4) ... [2024-10-11 19:44:32,544 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:44:32,545 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:44:32,546 INFO L158 Benchmark]: Toolchain (without parser) took 15174.83ms. Allocated memory was 184.5MB in the beginning and 488.6MB in the end (delta: 304.1MB). Free memory was 132.4MB in the beginning and 243.1MB in the end (delta: -110.7MB). Peak memory consumption was 195.2MB. Max. memory is 16.1GB. [2024-10-11 19:44:32,546 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:44:32,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.43ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 91.2MB in the end (delta: 41.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-11 19:44:32,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.03ms. Allocated memory is still 184.5MB. Free memory was 91.2MB in the beginning and 88.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:44:32,547 INFO L158 Benchmark]: Boogie Preprocessor took 59.47ms. Allocated memory is still 184.5MB. Free memory was 88.4MB in the beginning and 85.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:44:32,547 INFO L158 Benchmark]: RCFGBuilder took 680.57ms. Allocated memory was 184.5MB in the beginning and 232.8MB in the end (delta: 48.2MB). Free memory was 85.5MB in the beginning and 180.0MB in the end (delta: -94.5MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2024-10-11 19:44:32,547 INFO L158 Benchmark]: TraceAbstraction took 13852.60ms. Allocated memory was 232.8MB in the beginning and 488.6MB in the end (delta: 255.9MB). Free memory was 180.0MB in the beginning and 243.1MB in the end (delta: -63.1MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB. [2024-10-11 19:44:32,547 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 488.6MB. Free memory is still 243.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:44:32,548 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.19ms. Allocated memory is still 184.5MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.43ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 91.2MB in the end (delta: 41.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.03ms. Allocated memory is still 184.5MB. Free memory was 91.2MB in the beginning and 88.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.47ms. Allocated memory is still 184.5MB. Free memory was 88.4MB in the beginning and 85.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 680.57ms. Allocated memory was 184.5MB in the beginning and 232.8MB in the end (delta: 48.2MB). Free memory was 85.5MB in the beginning and 180.0MB in the end (delta: -94.5MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13852.60ms. Allocated memory was 232.8MB in the beginning and 488.6MB in the end (delta: 255.9MB). Free memory was 180.0MB in the beginning and 243.1MB in the end (delta: -63.1MB). Peak memory consumption was 193.8MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 488.6MB. Free memory is still 243.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1242]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1242. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] 0 p = malloc(sizeof(struct s)) [L1252] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1252] RET 0 init(p,9) [L1253] 0 B->next = p [L1254] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, p={-5:0}, t1=-1] [L1256] EXPR 0 A->next [L1256] 0 p = A->next [L1257] 0 p->datum [L1260] EXPR 0 B->next [L1260] 0 p = B->next [L1261] 0 p->datum [L1263] 0 return 0; VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, \result=0, p={-5:0}, t1=-1] - 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: -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: 1254]: 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: -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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 113 locations, 54 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: 13.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4882 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3934 mSDsluCounter, 2168 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1972 mSDsCounter, 330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14077 IncrementalHoareTripleChecker+Invalid, 14407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 330 mSolverCounterUnsat, 196 mSDtfsCounter, 14077 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=687occurred in iteration=15, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 3257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 19:44:32,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:44:34,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:44:34,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:44:34,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:44:34,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:44:34,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:44:34,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:44:34,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:44:34,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:44:34,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:44:34,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:44:34,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:44:34,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:44:34,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:44:34,677 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:44:34,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:44:34,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:44:34,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:44:34,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:44:34,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:44:34,680 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:44:34,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:44:34,681 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:44:34,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:44:34,682 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:44:34,682 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:44:34,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:44:34,682 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:44:34,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:44:34,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:44:34,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:44:34,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:44:34,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:44:34,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:44:34,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:44:34,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:44:34,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:44:34,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:44:34,686 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:44:34,686 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:44:34,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:44:34,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:44:34,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:44:34,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:44:34,687 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:44:34,687 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2024-10-11 19:44:34,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:44:34,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:44:34,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:44:34,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:44:34,968 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:44:34,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2024-10-11 19:44:36,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:44:36,493 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:44:36,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2024-10-11 19:44:36,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a26c80e90/d2231fd1e8044b338fe35847be477784/FLAGc05c1202d [2024-10-11 19:44:36,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a26c80e90/d2231fd1e8044b338fe35847be477784 [2024-10-11 19:44:36,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:44:36,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:44:36,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:44:36,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:44:36,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:44:36,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:44:36" (1/1) ... [2024-10-11 19:44:36,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541021e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:36, skipping insertion in model container [2024-10-11 19:44:36,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:44:36" (1/1) ... [2024-10-11 19:44:36,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:44:37,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:44:37,386 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:44:37,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:44:37,495 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:44:37,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37 WrapperNode [2024-10-11 19:44:37,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:44:37,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:44:37,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:44:37,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:44:37,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,552 INFO L138 Inliner]: procedures = 369, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 90 [2024-10-11 19:44:37,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:44:37,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:44:37,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:44:37,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:44:37,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,592 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [5, 5, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [5, 5, 0]. The 12 writes are split as follows [0, 0, 12]. [2024-10-11 19:44:37,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:44:37,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:44:37,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:44:37,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:44:37,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (1/1) ... [2024-10-11 19:44:37,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:44:37,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:44:37,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:44:37,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:44:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:44:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:44:37,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:44:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:44:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:44:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:44:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:44:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:44:37,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:44:37,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-11 19:44:37,704 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-11 19:44:37,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:44:37,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:44:37,706 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:44:37,866 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:44:37,869 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:44:38,321 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:44:38,322 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:44:38,502 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:44:38,503 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:44:38,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:38 BoogieIcfgContainer [2024-10-11 19:44:38,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:44:38,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:44:38,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:44:38,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:44:38,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:44:36" (1/3) ... [2024-10-11 19:44:38,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d6f211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:44:38, skipping insertion in model container [2024-10-11 19:44:38,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:44:37" (2/3) ... [2024-10-11 19:44:38,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d6f211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:44:38, skipping insertion in model container [2024-10-11 19:44:38,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:38" (3/3) ... [2024-10-11 19:44:38,512 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2024-10-11 19:44:38,528 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:44:38,528 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-11 19:44:38,528 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:44:38,581 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:44:38,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 170 flow [2024-10-11 19:44:38,647 INFO L124 PetriNetUnfolderBase]: 0/82 cut-off events. [2024-10-11 19:44:38,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:38,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 181 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-10-11 19:44:38,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 170 flow [2024-10-11 19:44:38,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 167 flow [2024-10-11 19:44:38,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:44:38,669 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;@43391a4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:44:38,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-10-11 19:44:38,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:44:38,673 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-10-11 19:44:38,673 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:38,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:38,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-10-11 19:44:38,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:38,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:38,679 INFO L85 PathProgramCache]: Analyzing trace with hash 11348, now seen corresponding path program 1 times [2024-10-11 19:44:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:38,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24934748] [2024-10-11 19:44:38,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:38,690 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-10-11 19:44:38,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:38,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 19:44:38,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:38,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:44:38,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:38,856 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-10-11 19:44:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:38,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:38,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:38,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24934748] [2024-10-11 19:44:38,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24934748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:38,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:38,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:44:38,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384374733] [2024-10-11 19:44:38,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:38,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:38,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:38,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:38,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:39,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2024-10-11 19:44:39,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:39,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:39,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2024-10-11 19:44:39,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:39,227 INFO L124 PetriNetUnfolderBase]: 99/370 cut-off events. [2024-10-11 19:44:39,227 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:39,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 370 events. 99/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1819 event pairs, 99 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 564. Up to 223 conditions per place. [2024-10-11 19:44:39,233 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 28 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2024-10-11 19:44:39,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 215 flow [2024-10-11 19:44:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2024-10-11 19:44:39,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2024-10-11 19:44:39,255 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 167 flow. Second operand 3 states and 169 transitions. [2024-10-11 19:44:39,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 215 flow [2024-10-11 19:44:39,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:39,263 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 158 flow [2024-10-11 19:44:39,265 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2024-10-11 19:44:39,272 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2024-10-11 19:44:39,274 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 158 flow [2024-10-11 19:44:39,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:39,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:39,275 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-10-11 19:44:39,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:39,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 19:44:39,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash 11349, now seen corresponding path program 1 times [2024-10-11 19:44:39,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:39,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401452413] [2024-10-11 19:44:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:39,478 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-10-11 19:44:39,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:39,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 19:44:39,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:39,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:44:39,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:39,584 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-10-11 19:44:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:39,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:39,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401452413] [2024-10-11 19:44:39,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401452413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:39,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:39,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:44:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609608288] [2024-10-11 19:44:39,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:39,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:39,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:39,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:39,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2024-10-11 19:44:39,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:39,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:39,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2024-10-11 19:44:39,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:39,861 INFO L124 PetriNetUnfolderBase]: 99/362 cut-off events. [2024-10-11 19:44:39,863 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:44:39,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 362 events. 99/362 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1810 event pairs, 99 based on Foata normal form. 6/311 useless extension candidates. Maximal degree in co-relation 572. Up to 223 conditions per place. [2024-10-11 19:44:39,867 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2024-10-11 19:44:39,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 198 flow [2024-10-11 19:44:39,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2024-10-11 19:44:39,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2024-10-11 19:44:39,872 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 158 flow. Second operand 3 states and 177 transitions. [2024-10-11 19:44:39,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 198 flow [2024-10-11 19:44:39,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:39,874 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 142 flow [2024-10-11 19:44:39,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2024-10-11 19:44:39,875 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2024-10-11 19:44:39,875 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 142 flow [2024-10-11 19:44:39,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:39,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:39,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:44:39,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:40,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 19:44:40,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:40,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:40,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1900025205, now seen corresponding path program 1 times [2024-10-11 19:44:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:40,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007700610] [2024-10-11 19:44:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:40,081 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-10-11 19:44:40,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:40,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 19:44:40,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:40,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:44:40,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:40,173 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-10-11 19:44:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:40,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:40,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:40,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007700610] [2024-10-11 19:44:40,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007700610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:40,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:40,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:44:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951114134] [2024-10-11 19:44:40,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:40,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:40,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:40,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:40,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2024-10-11 19:44:40,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:40,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:40,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2024-10-11 19:44:40,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:40,376 INFO L124 PetriNetUnfolderBase]: 110/392 cut-off events. [2024-10-11 19:44:40,377 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:44:40,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 392 events. 110/392 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1994 event pairs, 110 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 626. Up to 248 conditions per place. [2024-10-11 19:44:40,379 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 28 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2024-10-11 19:44:40,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 194 flow [2024-10-11 19:44:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2024-10-11 19:44:40,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7429718875502008 [2024-10-11 19:44:40,381 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 142 flow. Second operand 3 states and 185 transitions. [2024-10-11 19:44:40,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 194 flow [2024-10-11 19:44:40,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:44:40,382 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 130 flow [2024-10-11 19:44:40,382 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-10-11 19:44:40,383 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -18 predicate places. [2024-10-11 19:44:40,383 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 130 flow [2024-10-11 19:44:40,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:40,386 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:40,386 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:44:40,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 19:44:40,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 19:44:40,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:40,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1900025206, now seen corresponding path program 1 times [2024-10-11 19:44:40,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:40,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693738200] [2024-10-11 19:44:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:40,589 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-10-11 19:44:40,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:40,590 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 19:44:40,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:40,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:44:40,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:40,688 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-10-11 19:44:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:40,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:40,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:40,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693738200] [2024-10-11 19:44:40,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693738200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:40,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:40,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:44:40,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72567934] [2024-10-11 19:44:40,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:40,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:40,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:40,817 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2024-10-11 19:44:40,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:40,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:40,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2024-10-11 19:44:40,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:40,938 INFO L124 PetriNetUnfolderBase]: 99/352 cut-off events. [2024-10-11 19:44:40,938 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:44:40,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 352 events. 99/352 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1744 event pairs, 99 based on Foata normal form. 11/312 useless extension candidates. Maximal degree in co-relation 575. Up to 225 conditions per place. [2024-10-11 19:44:40,940 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 27 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2024-10-11 19:44:40,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 180 flow [2024-10-11 19:44:40,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:40,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-10-11 19:44:40,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.751004016064257 [2024-10-11 19:44:40,942 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 130 flow. Second operand 3 states and 187 transitions. [2024-10-11 19:44:40,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 180 flow [2024-10-11 19:44:40,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:40,944 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 125 flow [2024-10-11 19:44:40,944 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-10-11 19:44:40,944 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2024-10-11 19:44:40,944 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 125 flow [2024-10-11 19:44:40,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:40,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:40,945 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:40,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 19:44:41,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 19:44:41,145 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:41,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:41,146 INFO L85 PathProgramCache]: Analyzing trace with hash 147380253, now seen corresponding path program 1 times [2024-10-11 19:44:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:41,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729026340] [2024-10-11 19:44:41,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:41,147 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-10-11 19:44:41,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:41,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 19:44:41,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:41,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:44:41,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:41,317 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-10-11 19:44:41,349 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 19:44:41,350 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-10-11 19:44:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:41,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:41,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:41,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729026340] [2024-10-11 19:44:41,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729026340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:41,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:41,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:44:41,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637995488] [2024-10-11 19:44:41,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:41,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:41,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:41,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:41,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:41,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2024-10-11 19:44:41,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:41,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:41,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2024-10-11 19:44:41,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:41,560 INFO L124 PetriNetUnfolderBase]: 110/357 cut-off events. [2024-10-11 19:44:41,560 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 19:44:41,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 357 events. 110/357 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1702 event pairs, 110 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 603. Up to 246 conditions per place. [2024-10-11 19:44:41,562 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 28 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2024-10-11 19:44:41,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 177 flow [2024-10-11 19:44:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2024-10-11 19:44:41,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7429718875502008 [2024-10-11 19:44:41,563 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 125 flow. Second operand 3 states and 185 transitions. [2024-10-11 19:44:41,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 177 flow [2024-10-11 19:44:41,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:41,564 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 120 flow [2024-10-11 19:44:41,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-10-11 19:44:41,565 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2024-10-11 19:44:41,565 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 120 flow [2024-10-11 19:44:41,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:41,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:41,565 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:41,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 19:44:41,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-11 19:44:41,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:41,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:41,767 INFO L85 PathProgramCache]: Analyzing trace with hash 147380254, now seen corresponding path program 1 times [2024-10-11 19:44:41,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:41,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795547306] [2024-10-11 19:44:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:41,768 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-10-11 19:44:41,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:41,770 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-11 19:44:41,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:41,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 19:44:41,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:41,949 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-10-11 19:44:41,979 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 19:44:41,980 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 12 treesize of output 14 [2024-10-11 19:44:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:42,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:42,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:42,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795547306] [2024-10-11 19:44:42,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795547306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:42,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:42,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:44:42,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140132550] [2024-10-11 19:44:42,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:42,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:44:42,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:42,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:44:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:44:42,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2024-10-11 19:44:42,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:42,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:42,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2024-10-11 19:44:42,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:42,196 INFO L124 PetriNetUnfolderBase]: 99/326 cut-off events. [2024-10-11 19:44:42,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:42,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 326 events. 99/326 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1516 event pairs, 99 based on Foata normal form. 12/308 useless extension candidates. Maximal degree in co-relation 550. Up to 223 conditions per place. [2024-10-11 19:44:42,198 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 27 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2024-10-11 19:44:42,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 54 transitions, 170 flow [2024-10-11 19:44:42,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:44:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:44:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-10-11 19:44:42,199 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.751004016064257 [2024-10-11 19:44:42,199 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 120 flow. Second operand 3 states and 187 transitions. [2024-10-11 19:44:42,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 54 transitions, 170 flow [2024-10-11 19:44:42,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 54 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:42,201 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 115 flow [2024-10-11 19:44:42,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2024-10-11 19:44:42,201 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -24 predicate places. [2024-10-11 19:44:42,201 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 115 flow [2024-10-11 19:44:42,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:42,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:42,202 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:42,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 19:44:42,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-11 19:44:42,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:42,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:42,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1015971961, now seen corresponding path program 1 times [2024-10-11 19:44:42,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:42,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209711084] [2024-10-11 19:44:42,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:42,404 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-10-11 19:44:42,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:42,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-11 19:44:42,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:42,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 19:44:42,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:42,614 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 19:44:42,615 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 12 treesize of output 22 [2024-10-11 19:44:42,681 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-11 19:44:42,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-11 19:44:42,855 INFO L349 Elim1Store]: treesize reduction 110, result has 29.5 percent of original size [2024-10-11 19:44:42,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 82 [2024-10-11 19:44:42,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:44:42,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 52 [2024-10-11 19:44:43,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 52 [2024-10-11 19:44:43,134 INFO L349 Elim1Store]: treesize reduction 142, result has 28.6 percent of original size [2024-10-11 19:44:43,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 101 [2024-10-11 19:44:43,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2024-10-11 19:44:43,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2024-10-11 19:44:43,717 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-10-11 19:44:43,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 177 [2024-10-11 19:44:45,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:44:45,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 274 treesize of output 210 [2024-10-11 19:44:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:45,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:45,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209711084] [2024-10-11 19:44:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209711084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:45,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:45,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:44:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377271913] [2024-10-11 19:44:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:45,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:44:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:45,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:44:45,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:44:47,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-11 19:44:47,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 115 flow. Second operand has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:47,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:47,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-11 19:44:47,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:48,707 INFO L124 PetriNetUnfolderBase]: 130/435 cut-off events. [2024-10-11 19:44:48,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:44:48,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 435 events. 130/435 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2234 event pairs, 13 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 728. Up to 190 conditions per place. [2024-10-11 19:44:48,711 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 54 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2024-10-11 19:44:48,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 78 transitions, 285 flow [2024-10-11 19:44:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:44:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:44:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 319 transitions. [2024-10-11 19:44:48,717 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48042168674698793 [2024-10-11 19:44:48,717 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 115 flow. Second operand 8 states and 319 transitions. [2024-10-11 19:44:48,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 78 transitions, 285 flow [2024-10-11 19:44:48,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:44:48,718 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 124 flow [2024-10-11 19:44:48,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=124, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-10-11 19:44:48,719 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2024-10-11 19:44:48,719 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 124 flow [2024-10-11 19:44:48,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.666666666666664) internal successors, (303), 9 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:48,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:48,721 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:48,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 19:44:48,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-11 19:44:48,922 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:48,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1015971960, now seen corresponding path program 1 times [2024-10-11 19:44:48,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:48,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975682757] [2024-10-11 19:44:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:48,923 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-10-11 19:44:48,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:48,926 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-11 19:44:48,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 19:44:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:49,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 19:44:49,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:49,148 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-10-11 19:44:49,152 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-10-11 19:44:49,184 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:44:49,184 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 19 treesize of output 27 [2024-10-11 19:44:49,192 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-10-11 19:44:49,246 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 13 treesize of output 9 [2024-10-11 19:44:49,262 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-10-11 19:44:49,263 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 1 case distinctions, treesize of input 18 treesize of output 20 [2024-10-11 19:44:49,273 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 19 treesize of output 1 [2024-10-11 19:44:49,303 INFO L349 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2024-10-11 19:44:49,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 55 [2024-10-11 19:44:49,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-10-11 19:44:49,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 53 treesize of output 42 [2024-10-11 19:44:49,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-10-11 19:44:49,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 53 treesize of output 42 [2024-10-11 19:44:49,456 INFO L349 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2024-10-11 19:44:49,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2024-10-11 19:44:49,497 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2024-10-11 19:44:49,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-10-11 19:44:49,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-10-11 19:44:49,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-10-11 19:44:49,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-10-11 19:44:49,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-10-11 19:44:49,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-10-11 19:44:49,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-10-11 19:44:49,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2024-10-11 19:44:49,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 19:44:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:50,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:50,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:50,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975682757] [2024-10-11 19:44:50,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975682757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:50,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:50,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:44:50,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296092083] [2024-10-11 19:44:50,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:50,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:44:50,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:50,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:44:50,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:44:51,459 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2024-10-11 19:44:51,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 124 flow. Second operand has 9 states, 9 states have (on average 31.666666666666668) internal successors, (285), 9 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:51,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:51,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2024-10-11 19:44:51,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:52,567 INFO L124 PetriNetUnfolderBase]: 150/395 cut-off events. [2024-10-11 19:44:52,567 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-10-11 19:44:52,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 395 events. 150/395 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1782 event pairs, 2 based on Foata normal form. 16/360 useless extension candidates. Maximal degree in co-relation 765. Up to 183 conditions per place. [2024-10-11 19:44:52,569 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 65 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2024-10-11 19:44:52,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 358 flow [2024-10-11 19:44:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:44:52,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:44:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 381 transitions. [2024-10-11 19:44:52,572 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45903614457831327 [2024-10-11 19:44:52,572 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 124 flow. Second operand 10 states and 381 transitions. [2024-10-11 19:44:52,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 358 flow [2024-10-11 19:44:52,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 340 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 19:44:52,574 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 138 flow [2024-10-11 19:44:52,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=138, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-10-11 19:44:52,575 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2024-10-11 19:44:52,575 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 138 flow [2024-10-11 19:44:52,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.666666666666668) internal successors, (285), 9 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:52,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:52,576 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:52,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 19:44:52,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-11 19:44:52,777 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:52,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:52,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1049749605, now seen corresponding path program 1 times [2024-10-11 19:44:52,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:52,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501014215] [2024-10-11 19:44:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:52,778 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-10-11 19:44:52,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:52,779 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-11 19:44:52,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (10)] Waiting until timeout for monitored process [2024-10-11 19:44:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:53,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 19:44:53,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:53,016 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-10-11 19:44:53,021 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-10-11 19:44:53,050 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 19:44:53,050 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 13 [2024-10-11 19:44:53,067 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:44:53,067 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 19 treesize of output 27 [2024-10-11 19:44:53,110 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 13 treesize of output 9 [2024-10-11 19:44:53,117 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 19 treesize of output 1 [2024-10-11 19:44:53,146 INFO L349 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2024-10-11 19:44:53,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 55 [2024-10-11 19:44:53,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2024-10-11 19:44:53,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 53 treesize of output 42 [2024-10-11 19:44:53,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-10-11 19:44:53,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 53 treesize of output 42 [2024-10-11 19:44:53,318 INFO L349 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2024-10-11 19:44:53,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2024-10-11 19:44:53,352 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2024-10-11 19:44:53,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-10-11 19:44:53,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-10-11 19:44:53,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-10-11 19:44:53,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-10-11 19:44:53,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-10-11 19:44:53,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-10-11 19:44:53,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-10-11 19:44:53,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-10-11 19:44:53,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2024-10-11 19:44:53,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 19:44:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:53,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:53,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:53,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501014215] [2024-10-11 19:44:53,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501014215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:53,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:53,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:44:53,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666479856] [2024-10-11 19:44:53,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:53,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:44:53,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:53,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:44:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:44:55,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2024-10-11 19:44:55,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 138 flow. Second operand has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:55,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:44:55,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2024-10-11 19:44:55,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:44:56,439 INFO L124 PetriNetUnfolderBase]: 163/515 cut-off events. [2024-10-11 19:44:56,439 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-11 19:44:56,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 515 events. 163/515 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2774 event pairs, 4 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 921. Up to 184 conditions per place. [2024-10-11 19:44:56,442 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 67 selfloop transitions, 16 changer transitions 0/98 dead transitions. [2024-10-11 19:44:56,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 98 transitions, 396 flow [2024-10-11 19:44:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 19:44:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-10-11 19:44:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 513 transitions. [2024-10-11 19:44:56,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47544022242817424 [2024-10-11 19:44:56,444 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 138 flow. Second operand 13 states and 513 transitions. [2024-10-11 19:44:56,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 98 transitions, 396 flow [2024-10-11 19:44:56,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 385 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:44:56,450 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 189 flow [2024-10-11 19:44:56,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=189, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2024-10-11 19:44:56,451 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2024-10-11 19:44:56,451 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 189 flow [2024-10-11 19:44:56,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:44:56,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:44:56,452 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:44:56,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (10)] Forceful destruction successful, exit code 0 [2024-10-11 19:44:56,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-11 19:44:56,652 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:44:56,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:44:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1049749606, now seen corresponding path program 1 times [2024-10-11 19:44:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:44:56,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755126638] [2024-10-11 19:44:56,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:44:56,653 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-10-11 19:44:56,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:44:56,654 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-11 19:44:56,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (11)] Waiting until timeout for monitored process [2024-10-11 19:44:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:44:56,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 19:44:56,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:44:56,873 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 19:44:56,873 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 12 treesize of output 22 [2024-10-11 19:44:56,907 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-11 19:44:56,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-11 19:44:56,966 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 19 treesize of output 1 [2024-10-11 19:44:57,007 INFO L349 Elim1Store]: treesize reduction 110, result has 29.5 percent of original size [2024-10-11 19:44:57,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 82 [2024-10-11 19:44:57,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 52 [2024-10-11 19:44:57,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 52 [2024-10-11 19:44:57,175 INFO L349 Elim1Store]: treesize reduction 142, result has 28.6 percent of original size [2024-10-11 19:44:57,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 101 [2024-10-11 19:44:57,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2024-10-11 19:44:57,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2024-10-11 19:44:57,578 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-10-11 19:44:57,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 177 [2024-10-11 19:44:58,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:44:58,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 274 treesize of output 210 [2024-10-11 19:44:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:44:59,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:44:59,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:44:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755126638] [2024-10-11 19:44:59,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755126638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:44:59,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:44:59,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 19:44:59,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580165102] [2024-10-11 19:44:59,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:44:59,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:44:59,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:44:59,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:44:59,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:45:04,501 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 [0] [2024-10-11 19:45:04,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-10-11 19:45:04,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 189 flow. Second operand has 9 states, 9 states have (on average 35.77777777777778) internal successors, (322), 9 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:04,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:04,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-10-11 19:45:04,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:06,230 INFO L124 PetriNetUnfolderBase]: 172/519 cut-off events. [2024-10-11 19:45:06,230 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-10-11 19:45:06,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 519 events. 172/519 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2777 event pairs, 20 based on Foata normal form. 11/477 useless extension candidates. Maximal degree in co-relation 1013. Up to 174 conditions per place. [2024-10-11 19:45:06,232 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 53 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2024-10-11 19:45:06,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 85 transitions, 380 flow [2024-10-11 19:45:06,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 19:45:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 19:45:06,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 373 transitions. [2024-10-11 19:45:06,234 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.499330655957162 [2024-10-11 19:45:06,234 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 189 flow. Second operand 9 states and 373 transitions. [2024-10-11 19:45:06,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 85 transitions, 380 flow [2024-10-11 19:45:06,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 85 transitions, 364 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 19:45:06,236 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 243 flow [2024-10-11 19:45:06,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2024-10-11 19:45:06,237 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -5 predicate places. [2024-10-11 19:45:06,237 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 243 flow [2024-10-11 19:45:06,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.77777777777778) internal successors, (322), 9 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:06,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:06,238 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-10-11 19:45:06,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (11)] Ended with exit code 0 [2024-10-11 19:45:06,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-10-11 19:45:06,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:45:06,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:06,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1978687744, now seen corresponding path program 1 times [2024-10-11 19:45:06,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:45:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693972164] [2024-10-11 19:45:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:06,439 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-10-11 19:45:06,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:45:06,440 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-10-11 19:45:06,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (12)] Waiting until timeout for monitored process [2024-10-11 19:45:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:45:06,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:45:06,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:45:06,577 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 9 [2024-10-11 19:45:06,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:45:06,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:45:06,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:45:06,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693972164] [2024-10-11 19:45:06,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693972164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:45:06,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:45:06,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:45:06,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818881663] [2024-10-11 19:45:06,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:45:06,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:45:06,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:45:06,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:45:06,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:45:06,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 83 [2024-10-11 19:45:06,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:06,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:06,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 83 [2024-10-11 19:45:06,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:06,734 INFO L124 PetriNetUnfolderBase]: 121/388 cut-off events. [2024-10-11 19:45:06,735 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-10-11 19:45:06,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 388 events. 121/388 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1980 event pairs, 53 based on Foata normal form. 6/376 useless extension candidates. Maximal degree in co-relation 857. Up to 210 conditions per place. [2024-10-11 19:45:06,737 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 54 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2024-10-11 19:45:06,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 429 flow [2024-10-11 19:45:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:45:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:45:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-10-11 19:45:06,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2024-10-11 19:45:06,742 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 243 flow. Second operand 3 states and 213 transitions. [2024-10-11 19:45:06,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 429 flow [2024-10-11 19:45:06,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 83 transitions, 407 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-10-11 19:45:06,747 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 237 flow [2024-10-11 19:45:06,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2024-10-11 19:45:06,748 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2024-10-11 19:45:06,748 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 237 flow [2024-10-11 19:45:06,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:06,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:06,748 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-10-11 19:45:06,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (12)] Ended with exit code 0 [2024-10-11 19:45:06,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-10-11 19:45:06,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:45:06,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:06,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2002413156, now seen corresponding path program 1 times [2024-10-11 19:45:06,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:45:06,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873722615] [2024-10-11 19:45:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:06,950 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-10-11 19:45:06,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:45:06,951 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-10-11 19:45:06,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (13)] Waiting until timeout for monitored process [2024-10-11 19:45:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:45:07,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 19:45:07,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:45:07,103 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-10-11 19:45:07,116 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 13 treesize of output 9 [2024-10-11 19:45:07,122 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 19 treesize of output 1 [2024-10-11 19:45:07,164 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 21 treesize of output 9 [2024-10-11 19:45:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:45:07,168 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:45:07,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:45:07,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873722615] [2024-10-11 19:45:07,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873722615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:45:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:45:07,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:45:07,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569550625] [2024-10-11 19:45:07,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:45:07,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:45:07,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:45:07,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:45:07,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:45:07,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2024-10-11 19:45:07,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 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-10-11 19:45:07,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:07,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2024-10-11 19:45:07,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:07,526 INFO L124 PetriNetUnfolderBase]: 157/491 cut-off events. [2024-10-11 19:45:07,526 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-10-11 19:45:07,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 491 events. 157/491 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2700 event pairs, 30 based on Foata normal form. 10/480 useless extension candidates. Maximal degree in co-relation 1148. Up to 190 conditions per place. [2024-10-11 19:45:07,528 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 58 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-10-11 19:45:07,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 464 flow [2024-10-11 19:45:07,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:45:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:45:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2024-10-11 19:45:07,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2024-10-11 19:45:07,530 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 237 flow. Second operand 5 states and 305 transitions. [2024-10-11 19:45:07,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 464 flow [2024-10-11 19:45:07,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:45:07,532 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 290 flow [2024-10-11 19:45:07,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2024-10-11 19:45:07,532 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2024-10-11 19:45:07,533 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 290 flow [2024-10-11 19:45:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 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-10-11 19:45:07,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:07,533 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-10-11 19:45:07,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (13)] Forceful destruction successful, exit code 0 [2024-10-11 19:45:07,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-10-11 19:45:07,735 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:45:07,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2002413157, now seen corresponding path program 1 times [2024-10-11 19:45:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:45:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463776523] [2024-10-11 19:45:07,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:07,736 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-10-11 19:45:07,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:45:07,738 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-10-11 19:45:07,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (14)] Waiting until timeout for monitored process [2024-10-11 19:45:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:45:07,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:45:07,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:45:07,880 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-10-11 19:45:07,888 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 19 treesize of output 1 [2024-10-11 19:45:07,911 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 23 treesize of output 11 [2024-10-11 19:45:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:45:07,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:45:07,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:45:07,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463776523] [2024-10-11 19:45:07,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463776523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:45:07,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:45:07,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:45:07,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199239901] [2024-10-11 19:45:07,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:45:07,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:45:07,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:45:07,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:45:07,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:45:08,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2024-10-11 19:45:08,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 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-10-11 19:45:08,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:08,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2024-10-11 19:45:08,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:08,191 INFO L124 PetriNetUnfolderBase]: 157/484 cut-off events. [2024-10-11 19:45:08,191 INFO L125 PetriNetUnfolderBase]: For 334/334 co-relation queries the response was YES. [2024-10-11 19:45:08,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 484 events. 157/484 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2640 event pairs, 64 based on Foata normal form. 10/473 useless extension candidates. Maximal degree in co-relation 1216. Up to 227 conditions per place. [2024-10-11 19:45:08,193 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 50 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2024-10-11 19:45:08,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 85 transitions, 482 flow [2024-10-11 19:45:08,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:45:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:45:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 302 transitions. [2024-10-11 19:45:08,194 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.727710843373494 [2024-10-11 19:45:08,195 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 290 flow. Second operand 5 states and 302 transitions. [2024-10-11 19:45:08,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 85 transitions, 482 flow [2024-10-11 19:45:08,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 85 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:45:08,197 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 362 flow [2024-10-11 19:45:08,197 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2024-10-11 19:45:08,198 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2024-10-11 19:45:08,198 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 362 flow [2024-10-11 19:45:08,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 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-10-11 19:45:08,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:08,198 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:45:08,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (14)] Forceful destruction successful, exit code 0 [2024-10-11 19:45:08,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-10-11 19:45:08,399 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:45:08,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash -463376633, now seen corresponding path program 1 times [2024-10-11 19:45:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:45:08,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589887597] [2024-10-11 19:45:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:08,399 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-10-11 19:45:08,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:45:08,401 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-10-11 19:45:08,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (15)] Waiting until timeout for monitored process [2024-10-11 19:45:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:45:08,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 19:45:08,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:45:08,641 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-10-11 19:45:08,658 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:45:08,659 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 19 treesize of output 27 [2024-10-11 19:45:08,709 INFO L349 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2024-10-11 19:45:08,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 55 [2024-10-11 19:45:08,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:45:08,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 33 [2024-10-11 19:45:08,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 33 [2024-10-11 19:45:08,813 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2024-10-11 19:45:08,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-10-11 19:45:08,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-11 19:45:08,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-11 19:45:08,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 22 [2024-10-11 19:45:08,982 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:45:08,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-11 19:45:09,008 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 33 treesize of output 15 [2024-10-11 19:45:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:45:09,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:45:09,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:45:09,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589887597] [2024-10-11 19:45:09,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589887597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:45:09,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:45:09,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:45:09,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268413904] [2024-10-11 19:45:09,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:45:09,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 19:45:09,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:45:09,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 19:45:09,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 19:45:09,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-10-11 19:45:09,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 362 flow. Second operand has 10 states, 10 states have (on average 36.1) internal successors, (361), 10 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:09,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:09,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-10-11 19:45:09,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:10,232 INFO L124 PetriNetUnfolderBase]: 171/505 cut-off events. [2024-10-11 19:45:10,232 INFO L125 PetriNetUnfolderBase]: For 835/835 co-relation queries the response was YES. [2024-10-11 19:45:10,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 505 events. 171/505 cut-off events. For 835/835 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2742 event pairs, 27 based on Foata normal form. 6/495 useless extension candidates. Maximal degree in co-relation 1467. Up to 85 conditions per place. [2024-10-11 19:45:10,235 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 62 selfloop transitions, 37 changer transitions 3/117 dead transitions. [2024-10-11 19:45:10,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 117 transitions, 801 flow [2024-10-11 19:45:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 19:45:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 19:45:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 488 transitions. [2024-10-11 19:45:10,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4899598393574297 [2024-10-11 19:45:10,236 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 362 flow. Second operand 12 states and 488 transitions. [2024-10-11 19:45:10,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 117 transitions, 801 flow [2024-10-11 19:45:10,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 117 transitions, 775 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-10-11 19:45:10,240 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 545 flow [2024-10-11 19:45:10,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=545, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2024-10-11 19:45:10,241 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 14 predicate places. [2024-10-11 19:45:10,241 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 545 flow [2024-10-11 19:45:10,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.1) internal successors, (361), 10 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:10,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:10,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:45:10,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (15)] Ended with exit code 0 [2024-10-11 19:45:10,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-10-11 19:45:10,442 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:45:10,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:10,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1249020614, now seen corresponding path program 1 times [2024-10-11 19:45:10,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:45:10,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2461816] [2024-10-11 19:45:10,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:10,443 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-10-11 19:45:10,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:45:10,446 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-10-11 19:45:10,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (16)] Waiting until timeout for monitored process [2024-10-11 19:45:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:45:10,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 19:45:10,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:45:10,714 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-10-11 19:45:10,740 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:45:10,740 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 19 treesize of output 27 [2024-10-11 19:45:10,821 INFO L349 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2024-10-11 19:45:10,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 55 [2024-10-11 19:45:10,844 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 13 treesize of output 9 [2024-10-11 19:45:10,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 19:45:10,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-10-11 19:45:10,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 33 [2024-10-11 19:45:10,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-10-11 19:45:10,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 33 [2024-10-11 19:45:10,964 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2024-10-11 19:45:10,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-10-11 19:45:11,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-11 19:45:11,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-10-11 19:45:11,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-11 19:45:11,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-10-11 19:45:11,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 22 [2024-10-11 19:45:11,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-10-11 19:45:11,170 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:45:11,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 19:45:11,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 13 [2024-10-11 19:45:11,215 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 31 treesize of output 13 [2024-10-11 19:45:11,219 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 9 treesize of output 3 [2024-10-11 19:45:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:45:11,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:45:11,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:45:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2461816] [2024-10-11 19:45:11,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2461816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:45:11,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:45:11,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:45:11,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047650756] [2024-10-11 19:45:11,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:45:11,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:45:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:45:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:45:11,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:45:11,960 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-10-11 19:45:11,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 545 flow. Second operand has 11 states, 11 states have (on average 33.90909090909091) internal successors, (373), 11 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:11,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:11,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-10-11 19:45:11,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:12,771 INFO L124 PetriNetUnfolderBase]: 171/501 cut-off events. [2024-10-11 19:45:12,772 INFO L125 PetriNetUnfolderBase]: For 1068/1068 co-relation queries the response was YES. [2024-10-11 19:45:12,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1623 conditions, 501 events. 171/501 cut-off events. For 1068/1068 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2716 event pairs, 27 based on Foata normal form. 6/490 useless extension candidates. Maximal degree in co-relation 1593. Up to 131 conditions per place. [2024-10-11 19:45:12,775 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 76 selfloop transitions, 31 changer transitions 0/120 dead transitions. [2024-10-11 19:45:12,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 120 transitions, 887 flow [2024-10-11 19:45:12,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 19:45:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-11 19:45:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 535 transitions. [2024-10-11 19:45:12,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4604130808950086 [2024-10-11 19:45:12,777 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 545 flow. Second operand 14 states and 535 transitions. [2024-10-11 19:45:12,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 120 transitions, 887 flow [2024-10-11 19:45:12,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 120 transitions, 876 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-10-11 19:45:12,782 INFO L231 Difference]: Finished difference. Result has 112 places, 85 transitions, 627 flow [2024-10-11 19:45:12,782 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=627, PETRI_PLACES=112, PETRI_TRANSITIONS=85} [2024-10-11 19:45:12,782 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 26 predicate places. [2024-10-11 19:45:12,783 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 85 transitions, 627 flow [2024-10-11 19:45:12,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 33.90909090909091) internal successors, (373), 11 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:12,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:12,783 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:45:12,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (16)] Ended with exit code 0 [2024-10-11 19:45:12,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/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-10-11 19:45:12,984 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:45:12,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:12,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1669892833, now seen corresponding path program 1 times [2024-10-11 19:45:12,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:45:12,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266580659] [2024-10-11 19:45:12,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:12,984 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-10-11 19:45:12,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:45:12,985 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/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-10-11 19:45:12,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (17)] Waiting until timeout for monitored process [2024-10-11 19:45:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:45:13,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 19:45:13,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:45:13,248 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-10-11 19:45:13,277 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 19:45:13,277 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-10-11 19:45:13,283 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 13 treesize of output 9 [2024-10-11 19:45:13,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-10-11 19:45:13,328 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:45:13,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-11 19:45:13,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-10-11 19:45:13,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-10-11 19:45:13,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-10-11 19:45:13,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 19:45:13,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-10-11 19:45:13,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 19:45:13,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-10-11 19:45:13,672 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 27 treesize of output 15 [2024-10-11 19:45:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:45:13,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:45:13,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:45:13,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266580659] [2024-10-11 19:45:13,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266580659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:45:13,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:45:13,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:45:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291146020] [2024-10-11 19:45:13,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:45:13,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:45:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:45:13,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:45:13,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:45:14,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-10-11 19:45:14,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 85 transitions, 627 flow. Second operand has 11 states, 11 states have (on average 35.81818181818182) internal successors, (394), 11 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:14,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:14,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-10-11 19:45:14,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:15,969 INFO L124 PetriNetUnfolderBase]: 183/539 cut-off events. [2024-10-11 19:45:15,969 INFO L125 PetriNetUnfolderBase]: For 1474/1474 co-relation queries the response was YES. [2024-10-11 19:45:15,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 539 events. 183/539 cut-off events. For 1474/1474 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2924 event pairs, 9 based on Foata normal form. 22/559 useless extension candidates. Maximal degree in co-relation 1785. Up to 133 conditions per place. [2024-10-11 19:45:15,973 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 88 selfloop transitions, 35 changer transitions 0/135 dead transitions. [2024-10-11 19:45:15,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 135 transitions, 1117 flow [2024-10-11 19:45:15,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:45:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 19:45:15,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 752 transitions. [2024-10-11 19:45:15,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.476854787571338 [2024-10-11 19:45:15,976 INFO L175 Difference]: Start difference. First operand has 112 places, 85 transitions, 627 flow. Second operand 19 states and 752 transitions. [2024-10-11 19:45:15,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 135 transitions, 1117 flow [2024-10-11 19:45:15,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 135 transitions, 1035 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-10-11 19:45:15,982 INFO L231 Difference]: Finished difference. Result has 117 places, 88 transitions, 665 flow [2024-10-11 19:45:15,982 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=665, PETRI_PLACES=117, PETRI_TRANSITIONS=88} [2024-10-11 19:45:15,982 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 31 predicate places. [2024-10-11 19:45:15,982 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 88 transitions, 665 flow [2024-10-11 19:45:15,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.81818181818182) internal successors, (394), 11 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:15,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:15,984 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:45:15,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (17)] Forceful destruction successful, exit code 0 [2024-10-11 19:45:16,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/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-10-11 19:45:16,185 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:45:16,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1669892832, now seen corresponding path program 1 times [2024-10-11 19:45:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:45:16,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458800316] [2024-10-11 19:45:16,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:16,186 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-10-11 19:45:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:45:16,189 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/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-10-11 19:45:16,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (18)] Waiting until timeout for monitored process [2024-10-11 19:45:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:45:16,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 19:45:16,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:45:16,475 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-10-11 19:45:16,503 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:45:16,503 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 19 treesize of output 27 [2024-10-11 19:45:16,513 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 13 treesize of output 9 [2024-10-11 19:45:16,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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-10-11 19:45:16,575 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-10-11 19:45:16,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-11 19:45:16,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:45:16,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-10-11 19:45:16,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-10-11 19:45:16,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-10-11 19:45:16,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 19:45:16,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 19:45:16,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2024-10-11 19:45:16,925 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-10-11 19:45:16,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2024-10-11 19:45:16,998 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-10-11 19:45:17,002 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-10-11 19:45:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:45:17,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:45:17,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:45:17,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458800316] [2024-10-11 19:45:17,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458800316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:45:17,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:45:17,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 19:45:17,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002757471] [2024-10-11 19:45:17,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:45:17,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 19:45:17,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:45:17,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 19:45:17,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 19:45:19,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 19:45:19,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2024-10-11 19:45:19,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 88 transitions, 665 flow. Second operand has 11 states, 11 states have (on average 32.81818181818182) internal successors, (361), 11 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:19,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:45:19,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2024-10-11 19:45:19,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:45:21,081 INFO L124 PetriNetUnfolderBase]: 210/581 cut-off events. [2024-10-11 19:45:21,081 INFO L125 PetriNetUnfolderBase]: For 1411/1411 co-relation queries the response was YES. [2024-10-11 19:45:21,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 581 events. 210/581 cut-off events. For 1411/1411 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3163 event pairs, 44 based on Foata normal form. 27/606 useless extension candidates. Maximal degree in co-relation 1992. Up to 175 conditions per place. [2024-10-11 19:45:21,085 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 81 selfloop transitions, 36 changer transitions 17/144 dead transitions. [2024-10-11 19:45:21,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 144 transitions, 1203 flow [2024-10-11 19:45:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:45:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 19:45:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 696 transitions. [2024-10-11 19:45:21,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4413443246670894 [2024-10-11 19:45:21,087 INFO L175 Difference]: Start difference. First operand has 117 places, 88 transitions, 665 flow. Second operand 19 states and 696 transitions. [2024-10-11 19:45:21,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 144 transitions, 1203 flow [2024-10-11 19:45:21,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 144 transitions, 1158 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-10-11 19:45:21,094 INFO L231 Difference]: Finished difference. Result has 122 places, 84 transitions, 642 flow [2024-10-11 19:45:21,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=642, PETRI_PLACES=122, PETRI_TRANSITIONS=84} [2024-10-11 19:45:21,095 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 36 predicate places. [2024-10-11 19:45:21,095 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 84 transitions, 642 flow [2024-10-11 19:45:21,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.81818181818182) internal successors, (361), 11 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:45:21,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:45:21,096 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:45:21,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (18)] Forceful destruction successful, exit code 0 [2024-10-11 19:45:21,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/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-10-11 19:45:21,297 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-10-11 19:45:21,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:45:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1089211100, now seen corresponding path program 1 times [2024-10-11 19:45:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:45:21,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931964185] [2024-10-11 19:45:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:45:21,297 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-10-11 19:45:21,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:45:21,299 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/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-10-11 19:45:21,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (19)] Waiting until timeout for monitored process [2024-10-11 19:45:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:45:21,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:45:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:45:21,813 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 19:45:21,814 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:45:21,814 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2024-10-11 19:45:21,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2024-10-11 19:45:21,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2024-10-11 19:45:21,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2024-10-11 19:45:21,816 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2024-10-11 19:45:21,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2024-10-11 19:45:21,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2024-10-11 19:45:21,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2024-10-11 19:45:21,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2024-10-11 19:45:21,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2024-10-11 19:45:21,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2024-10-11 19:45:21,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2024-10-11 19:45:21,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2024-10-11 19:45:21,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2024-10-11 19:45:21,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2024-10-11 19:45:21,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2024-10-11 19:45:21,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (19)] Forceful destruction successful, exit code 0 [2024-10-11 19:45:22,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/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-10-11 19:45:22,021 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:45:22,056 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:45:22,056 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:45:22,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:45:22 BasicIcfg [2024-10-11 19:45:22,060 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:45:22,061 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:45:22,061 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:45:22,061 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:45:22,061 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:44:38" (3/4) ... [2024-10-11 19:45:22,063 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:45:22,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:45:22,064 INFO L158 Benchmark]: Toolchain (without parser) took 45224.08ms. Allocated memory was 88.1MB in the beginning and 308.3MB in the end (delta: 220.2MB). Free memory was 58.7MB in the beginning and 274.2MB in the end (delta: -215.5MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2024-10-11 19:45:22,065 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 32.8MB in the beginning and 32.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:45:22,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 655.29ms. Allocated memory is still 88.1MB. Free memory was 58.4MB in the beginning and 38.2MB in the end (delta: 20.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-11 19:45:22,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.56ms. Allocated memory is still 88.1MB. Free memory was 38.2MB in the beginning and 35.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:45:22,065 INFO L158 Benchmark]: Boogie Preprocessor took 64.69ms. Allocated memory is still 88.1MB. Free memory was 35.1MB in the beginning and 31.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:45:22,066 INFO L158 Benchmark]: RCFGBuilder took 882.04ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 31.7MB in the beginning and 78.0MB in the end (delta: -46.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-10-11 19:45:22,066 INFO L158 Benchmark]: TraceAbstraction took 43555.48ms. Allocated memory was 107.0MB in the beginning and 308.3MB in the end (delta: 201.3MB). Free memory was 77.2MB in the beginning and 275.2MB in the end (delta: -198.1MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. [2024-10-11 19:45:22,066 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 308.3MB. Free memory was 275.2MB in the beginning and 274.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:45:22,070 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.15ms. Allocated memory is still 62.9MB. Free memory was 32.8MB in the beginning and 32.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 655.29ms. Allocated memory is still 88.1MB. Free memory was 58.4MB in the beginning and 38.2MB in the end (delta: 20.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.56ms. Allocated memory is still 88.1MB. Free memory was 38.2MB in the beginning and 35.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.69ms. Allocated memory is still 88.1MB. Free memory was 35.1MB in the beginning and 31.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 882.04ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 31.7MB in the beginning and 78.0MB in the end (delta: -46.3MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * TraceAbstraction took 43555.48ms. Allocated memory was 107.0MB in the beginning and 308.3MB in the end (delta: 201.3MB). Free memory was 77.2MB in the beginning and 275.2MB in the end (delta: -198.1MB). Peak memory consumption was 185.6MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 308.3MB. Free memory was 275.2MB in the beginning and 274.2MB 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: 1242]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1242. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-2147483647:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [A={-2147483647:0}, A_mutex={1:0}, B={-2147483648:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] 0 p = malloc(sizeof(struct s)) [L1252] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={-2147483647:0}, A_mutex={1:0}, B={-2147483648:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1252] RET 0 init(p,9) [L1253] 0 B->next = p [L1254] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2147483647:0}, A_mutex={1:0}, B={-2147483648:0}, B_mutex={2:0}, \old(arg)={0:0}, p={1073741824:0}, t1=-1] [L1256] EXPR 0 A->next [L1256] 0 p = A->next [L1257] 0 p->datum [L1260] EXPR 0 B->next [L1260] 0 p = B->next [L1261] 0 p->datum [L1263] 0 return 0; VAL [A={-2147483647:0}, A_mutex={1:0}, B={-2147483648:0}, B_mutex={2:0}, \old(arg)={0:0}, \result=0, p={1073741824:0}, t1=-1] - 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: -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: 1254]: 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: -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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 113 locations, 54 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: 43.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 4206 SdHoareTripleChecker+Valid, 22.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3199 mSDsluCounter, 1834 SdHoareTripleChecker+Invalid, 20.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1558 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9353 IncrementalHoareTripleChecker+Invalid, 9628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 276 mSDtfsCounter, 9353 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 178 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=665occurred in iteration=16, InterpolantAutomatonStates: 135, 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.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 254 ConstructedInterpolants, 38 QuantifiedInterpolants, 9781 SizeOfPredicates, 137 NumberOfNonLiveVariables, 3518 ConjunctsInSsa, 355 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 19:45:22,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample