/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 19:15:59,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 19:15:59,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 19:15:59,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 19:15:59,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 19:15:59,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 19:15:59,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 19:15:59,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 19:15:59,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 19:15:59,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 19:15:59,801 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 19:15:59,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 19:15:59,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 19:15:59,802 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 19:15:59,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 19:15:59,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 19:15:59,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 19:15:59,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 19:15:59,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 19:15:59,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 19:15:59,804 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 19:15:59,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 19:15:59,809 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 19:15:59,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 19:15:59,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 19:15:59,810 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 19:15:59,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 19:15:59,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:15:59,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 19:15:59,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 19:15:59,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 19:15:59,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 19:15:59,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 19:15:59,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 19:15:59,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 19:15:59,812 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 19:16:00,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 19:16:00,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 19:16:00,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 19:16:00,145 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 19:16:00,145 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 19:16:00,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2023-08-26 19:16:01,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 19:16:01,542 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 19:16:01,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_94-alloc_region_racing.i [2023-08-26 19:16:01,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd3d1bdc/c10fa04b55f143e8aff683d4b9155f93/FLAG67fd17316 [2023-08-26 19:16:01,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd3d1bdc/c10fa04b55f143e8aff683d4b9155f93 [2023-08-26 19:16:01,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 19:16:01,588 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 19:16:01,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 19:16:01,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 19:16:01,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 19:16:01,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:16:01" (1/1) ... [2023-08-26 19:16:01,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599049e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:01, skipping insertion in model container [2023-08-26 19:16:01,594 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:16:01" (1/1) ... [2023-08-26 19:16:01,653 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 19:16:02,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:16:02,142 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 19:16:02,157 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 19:16:02,158 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 19:16:02,172 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [1044] [2023-08-26 19:16:02,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 19:16:02,277 INFO L206 MainTranslator]: Completed translation [2023-08-26 19:16:02,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02 WrapperNode [2023-08-26 19:16:02,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 19:16:02,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 19:16:02,279 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 19:16:02,279 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 19:16:02,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,344 INFO L138 Inliner]: procedures = 377, calls = 73, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 246 [2023-08-26 19:16:02,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 19:16:02,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 19:16:02,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 19:16:02,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 19:16:02,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 19:16:02,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 19:16:02,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 19:16:02,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 19:16:02,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (1/1) ... [2023-08-26 19:16:02,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 19:16:02,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:16:02,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 19:16:02,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 19:16:02,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 19:16:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-08-26 19:16:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 19:16:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-08-26 19:16:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 19:16:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 19:16:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 19:16:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-26 19:16:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 19:16:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-08-26 19:16:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 19:16:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 19:16:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 19:16:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 19:16:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 19:16:02,446 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 19:16:02,598 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 19:16:02,600 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 19:16:03,105 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 19:16:03,111 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 19:16:03,112 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-26 19:16:03,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:16:03 BoogieIcfgContainer [2023-08-26 19:16:03,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 19:16:03,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 19:16:03,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 19:16:03,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 19:16:03,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:16:01" (1/3) ... [2023-08-26 19:16:03,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf87ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:16:03, skipping insertion in model container [2023-08-26 19:16:03,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:16:02" (2/3) ... [2023-08-26 19:16:03,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf87ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:16:03, skipping insertion in model container [2023-08-26 19:16:03,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:16:03" (3/3) ... [2023-08-26 19:16:03,126 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_94-alloc_region_racing.i [2023-08-26 19:16:03,144 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 19:16:03,145 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-08-26 19:16:03,145 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 19:16:03,245 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 19:16:03,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 308 transitions, 624 flow [2023-08-26 19:16:03,396 INFO L124 PetriNetUnfolderBase]: 48/447 cut-off events. [2023-08-26 19:16:03,396 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:16:03,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 447 events. 48/447 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1715 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 246. Up to 8 conditions per place. [2023-08-26 19:16:03,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 308 transitions, 624 flow [2023-08-26 19:16:03,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 280 places, 308 transitions, 624 flow [2023-08-26 19:16:03,418 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 19:16:03,426 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 308 transitions, 624 flow [2023-08-26 19:16:03,428 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 280 places, 308 transitions, 624 flow [2023-08-26 19:16:03,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 308 transitions, 624 flow [2023-08-26 19:16:03,499 INFO L124 PetriNetUnfolderBase]: 48/447 cut-off events. [2023-08-26 19:16:03,499 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:16:03,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 447 events. 48/447 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1715 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 246. Up to 8 conditions per place. [2023-08-26 19:16:03,517 INFO L119 LiptonReduction]: Number of co-enabled transitions 29580 [2023-08-26 19:16:17,726 INFO L134 LiptonReduction]: Checked pairs total: 103486 [2023-08-26 19:16:17,727 INFO L136 LiptonReduction]: Total number of compositions: 272 [2023-08-26 19:16:17,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 19:16:17,744 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@37c3cb58, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 19:16:17,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2023-08-26 19:16:17,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 19:16:17,746 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 19:16:17,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 19:16:17,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:17,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 19:16:17,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:17,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:17,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1144, now seen corresponding path program 1 times [2023-08-26 19:16:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:17,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742037838] [2023-08-26 19:16:17,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:17,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:17,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:17,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742037838] [2023-08-26 19:16:17,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742037838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:17,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:17,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 19:16:17,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681937071] [2023-08-26 19:16:17,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:17,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 19:16:17,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 19:16:17,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 19:16:17,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 580 [2023-08-26 19:16:17,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 145 transitions, 298 flow. Second operand has 2 states, 2 states have (on average 277.5) internal successors, (555), 2 states have internal predecessors, (555), 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) [2023-08-26 19:16:17,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:17,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 580 [2023-08-26 19:16:17,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:18,418 INFO L124 PetriNetUnfolderBase]: 1443/3536 cut-off events. [2023-08-26 19:16:18,418 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:16:18,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 3536 events. 1443/3536 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 26544 event pairs, 1333 based on Foata normal form. 308/2258 useless extension candidates. Maximal degree in co-relation 6239. Up to 2820 conditions per place. [2023-08-26 19:16:18,435 INFO L140 encePairwiseOnDemand]: 551/580 looper letters, 79 selfloop transitions, 0 changer transitions 0/116 dead transitions. [2023-08-26 19:16:18,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 398 flow [2023-08-26 19:16:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 19:16:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 19:16:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 662 transitions. [2023-08-26 19:16:18,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5706896551724138 [2023-08-26 19:16:18,453 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 662 transitions. [2023-08-26 19:16:18,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 662 transitions. [2023-08-26 19:16:18,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:18,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 662 transitions. [2023-08-26 19:16:18,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 331.0) internal successors, (662), 2 states have internal predecessors, (662), 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) [2023-08-26 19:16:18,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 580.0) internal successors, (1740), 3 states have internal predecessors, (1740), 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) [2023-08-26 19:16:18,471 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 580.0) internal successors, (1740), 3 states have internal predecessors, (1740), 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) [2023-08-26 19:16:18,473 INFO L175 Difference]: Start difference. First operand has 123 places, 145 transitions, 298 flow. Second operand 2 states and 662 transitions. [2023-08-26 19:16:18,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 398 flow [2023-08-26 19:16:18,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 116 transitions, 398 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:16:18,480 INFO L231 Difference]: Finished difference. Result has 116 places, 116 transitions, 240 flow [2023-08-26 19:16:18,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=240, PETRI_PLACES=116, PETRI_TRANSITIONS=116} [2023-08-26 19:16:18,484 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -7 predicate places. [2023-08-26 19:16:18,485 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 116 transitions, 240 flow [2023-08-26 19:16:18,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 277.5) internal successors, (555), 2 states have internal predecessors, (555), 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) [2023-08-26 19:16:18,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:18,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 19:16:18,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 19:16:18,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:18,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:18,494 INFO L85 PathProgramCache]: Analyzing trace with hash 36731, now seen corresponding path program 1 times [2023-08-26 19:16:18,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:18,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544690490] [2023-08-26 19:16:18,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544690490] [2023-08-26 19:16:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544690490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:18,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:16:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835748765] [2023-08-26 19:16:18,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:18,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:16:18,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:18,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:16:18,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:16:18,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 580 [2023-08-26 19:16:18,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 116 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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) [2023-08-26 19:16:18,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:18,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 580 [2023-08-26 19:16:18,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:19,290 INFO L124 PetriNetUnfolderBase]: 2049/4502 cut-off events. [2023-08-26 19:16:19,290 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 19:16:19,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8496 conditions, 4502 events. 2049/4502 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 31564 event pairs, 1887 based on Foata normal form. 0/2465 useless extension candidates. Maximal degree in co-relation 8492. Up to 3982 conditions per place. [2023-08-26 19:16:19,314 INFO L140 encePairwiseOnDemand]: 575/580 looper letters, 95 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2023-08-26 19:16:19,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 120 transitions, 444 flow [2023-08-26 19:16:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:16:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:16:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2023-08-26 19:16:19,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3988505747126437 [2023-08-26 19:16:19,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 694 transitions. [2023-08-26 19:16:19,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 694 transitions. [2023-08-26 19:16:19,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:19,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 694 transitions. [2023-08-26 19:16:19,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 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) [2023-08-26 19:16:19,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:19,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:19,324 INFO L175 Difference]: Start difference. First operand has 116 places, 116 transitions, 240 flow. Second operand 3 states and 694 transitions. [2023-08-26 19:16:19,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 120 transitions, 444 flow [2023-08-26 19:16:19,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 120 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 19:16:19,327 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 261 flow [2023-08-26 19:16:19,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2023-08-26 19:16:19,328 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2023-08-26 19:16:19,329 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 261 flow [2023-08-26 19:16:19,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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) [2023-08-26 19:16:19,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:19,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-26 19:16:19,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 19:16:19,330 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:19,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash 36730, now seen corresponding path program 1 times [2023-08-26 19:16:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:19,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328456145] [2023-08-26 19:16:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:19,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:19,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:19,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328456145] [2023-08-26 19:16:19,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328456145] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:19,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:19,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 19:16:19,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195484568] [2023-08-26 19:16:19,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:19,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:16:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:19,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:16:19,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:16:19,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 580 [2023-08-26 19:16:19,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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) [2023-08-26 19:16:19,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:19,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 580 [2023-08-26 19:16:19,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:19,874 INFO L124 PetriNetUnfolderBase]: 1972/4334 cut-off events. [2023-08-26 19:16:19,875 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2023-08-26 19:16:19,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8345 conditions, 4334 events. 1972/4334 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 30296 event pairs, 1776 based on Foata normal form. 0/2449 useless extension candidates. Maximal degree in co-relation 8339. Up to 3757 conditions per place. [2023-08-26 19:16:19,896 INFO L140 encePairwiseOnDemand]: 576/580 looper letters, 126 selfloop transitions, 2 changer transitions 3/153 dead transitions. [2023-08-26 19:16:19,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 153 transitions, 595 flow [2023-08-26 19:16:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:16:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:16:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 740 transitions. [2023-08-26 19:16:19,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42528735632183906 [2023-08-26 19:16:19,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 740 transitions. [2023-08-26 19:16:19,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 740 transitions. [2023-08-26 19:16:19,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:19,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 740 transitions. [2023-08-26 19:16:19,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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) [2023-08-26 19:16:19,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:19,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:19,905 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 261 flow. Second operand 3 states and 740 transitions. [2023-08-26 19:16:19,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 153 transitions, 595 flow [2023-08-26 19:16:19,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 153 transitions, 592 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:16:19,909 INFO L231 Difference]: Finished difference. Result has 118 places, 116 transitions, 258 flow [2023-08-26 19:16:19,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=118, PETRI_TRANSITIONS=116} [2023-08-26 19:16:19,910 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -5 predicate places. [2023-08-26 19:16:19,910 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 116 transitions, 258 flow [2023-08-26 19:16:19,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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) [2023-08-26 19:16:19,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:19,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:16:19,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 19:16:19,911 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:19,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1095041919, now seen corresponding path program 1 times [2023-08-26 19:16:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:19,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061822425] [2023-08-26 19:16:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:19,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:20,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061822425] [2023-08-26 19:16:20,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061822425] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:16:20,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425275247] [2023-08-26 19:16:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:20,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:16:20,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:16:20,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:16:20,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 19:16:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:20,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 19:16:20,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:16:20,229 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-26 19:16:20,230 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-26 19:16:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:20,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:16:20,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:20,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425275247] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:16:20,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:16:20,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2023-08-26 19:16:20,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068468368] [2023-08-26 19:16:20,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:16:20,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 19:16:20,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:20,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 19:16:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 19:16:20,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 580 [2023-08-26 19:16:20,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 116 transitions, 258 flow. Second operand has 8 states, 8 states have (on average 199.875) internal successors, (1599), 8 states have internal predecessors, (1599), 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) [2023-08-26 19:16:20,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:20,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 580 [2023-08-26 19:16:20,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:21,017 INFO L124 PetriNetUnfolderBase]: 1843/4135 cut-off events. [2023-08-26 19:16:21,017 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-08-26 19:16:21,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7926 conditions, 4135 events. 1843/4135 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 31157 event pairs, 0 based on Foata normal form. 1/2384 useless extension candidates. Maximal degree in co-relation 7920. Up to 3474 conditions per place. [2023-08-26 19:16:21,038 INFO L140 encePairwiseOnDemand]: 575/580 looper letters, 161 selfloop transitions, 6 changer transitions 0/189 dead transitions. [2023-08-26 19:16:21,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 189 transitions, 736 flow [2023-08-26 19:16:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 19:16:21,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 19:16:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1358 transitions. [2023-08-26 19:16:21,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39022988505747125 [2023-08-26 19:16:21,042 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1358 transitions. [2023-08-26 19:16:21,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1358 transitions. [2023-08-26 19:16:21,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:21,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1358 transitions. [2023-08-26 19:16:21,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 226.33333333333334) internal successors, (1358), 6 states have internal predecessors, (1358), 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) [2023-08-26 19:16:21,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 580.0) internal successors, (4060), 7 states have internal predecessors, (4060), 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) [2023-08-26 19:16:21,053 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 580.0) internal successors, (4060), 7 states have internal predecessors, (4060), 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) [2023-08-26 19:16:21,053 INFO L175 Difference]: Start difference. First operand has 118 places, 116 transitions, 258 flow. Second operand 6 states and 1358 transitions. [2023-08-26 19:16:21,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 189 transitions, 736 flow [2023-08-26 19:16:21,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 189 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:16:21,058 INFO L231 Difference]: Finished difference. Result has 120 places, 115 transitions, 262 flow [2023-08-26 19:16:21,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=120, PETRI_TRANSITIONS=115} [2023-08-26 19:16:21,059 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2023-08-26 19:16:21,059 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 115 transitions, 262 flow [2023-08-26 19:16:21,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 199.875) internal successors, (1599), 8 states have internal predecessors, (1599), 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) [2023-08-26 19:16:21,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:21,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:16:21,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-26 19:16:21,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:16:21,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:21,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1095041761, now seen corresponding path program 1 times [2023-08-26 19:16:21,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:21,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5502097] [2023-08-26 19:16:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:21,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:21,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5502097] [2023-08-26 19:16:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5502097] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:21,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:16:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764235056] [2023-08-26 19:16:21,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:21,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:16:21,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:21,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:16:21,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:16:21,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 580 [2023-08-26 19:16:21,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 115 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 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) [2023-08-26 19:16:21,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:21,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 580 [2023-08-26 19:16:21,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:21,760 INFO L124 PetriNetUnfolderBase]: 1834/4080 cut-off events. [2023-08-26 19:16:21,760 INFO L125 PetriNetUnfolderBase]: For 216/216 co-relation queries the response was YES. [2023-08-26 19:16:21,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7841 conditions, 4080 events. 1834/4080 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28698 event pairs, 1610 based on Foata normal form. 0/2337 useless extension candidates. Maximal degree in co-relation 7835. Up to 3520 conditions per place. [2023-08-26 19:16:21,835 INFO L140 encePairwiseOnDemand]: 576/580 looper letters, 122 selfloop transitions, 4 changer transitions 3/151 dead transitions. [2023-08-26 19:16:21,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 151 transitions, 592 flow [2023-08-26 19:16:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:16:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:16:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 744 transitions. [2023-08-26 19:16:21,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42758620689655175 [2023-08-26 19:16:21,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 744 transitions. [2023-08-26 19:16:21,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 744 transitions. [2023-08-26 19:16:21,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:21,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 744 transitions. [2023-08-26 19:16:21,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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) [2023-08-26 19:16:21,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:21,844 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:21,845 INFO L175 Difference]: Start difference. First operand has 120 places, 115 transitions, 262 flow. Second operand 3 states and 744 transitions. [2023-08-26 19:16:21,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 151 transitions, 592 flow [2023-08-26 19:16:21,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 151 transitions, 578 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 19:16:21,848 INFO L231 Difference]: Finished difference. Result has 121 places, 116 transitions, 270 flow [2023-08-26 19:16:21,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=121, PETRI_TRANSITIONS=116} [2023-08-26 19:16:21,849 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -2 predicate places. [2023-08-26 19:16:21,850 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 116 transitions, 270 flow [2023-08-26 19:16:21,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 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) [2023-08-26 19:16:21,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:21,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 19:16:21,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 19:16:21,851 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:21,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:21,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1095041760, now seen corresponding path program 1 times [2023-08-26 19:16:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:21,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434519058] [2023-08-26 19:16:21,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:21,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:21,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434519058] [2023-08-26 19:16:21,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434519058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:21,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:21,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:16:21,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328290458] [2023-08-26 19:16:21,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:21,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:16:21,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:21,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:16:21,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:16:21,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 580 [2023-08-26 19:16:21,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 116 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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) [2023-08-26 19:16:21,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:21,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 580 [2023-08-26 19:16:21,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:22,320 INFO L124 PetriNetUnfolderBase]: 1784/3971 cut-off events. [2023-08-26 19:16:22,320 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2023-08-26 19:16:22,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7648 conditions, 3971 events. 1784/3971 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 27781 event pairs, 1597 based on Foata normal form. 50/2389 useless extension candidates. Maximal degree in co-relation 7642. Up to 3492 conditions per place. [2023-08-26 19:16:22,340 INFO L140 encePairwiseOnDemand]: 578/580 looper letters, 92 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2023-08-26 19:16:22,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 116 transitions, 458 flow [2023-08-26 19:16:22,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:16:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:16:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2023-08-26 19:16:22,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103448275862069 [2023-08-26 19:16:22,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 714 transitions. [2023-08-26 19:16:22,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 714 transitions. [2023-08-26 19:16:22,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:22,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 714 transitions. [2023-08-26 19:16:22,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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) [2023-08-26 19:16:22,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:22,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:22,347 INFO L175 Difference]: Start difference. First operand has 121 places, 116 transitions, 270 flow. Second operand 3 states and 714 transitions. [2023-08-26 19:16:22,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 116 transitions, 458 flow [2023-08-26 19:16:22,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 116 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:16:22,350 INFO L231 Difference]: Finished difference. Result has 120 places, 115 transitions, 264 flow [2023-08-26 19:16:22,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=120, PETRI_TRANSITIONS=115} [2023-08-26 19:16:22,351 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2023-08-26 19:16:22,351 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 115 transitions, 264 flow [2023-08-26 19:16:22,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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) [2023-08-26 19:16:22,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:22,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 19:16:22,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 19:16:22,352 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:22,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:22,353 INFO L85 PathProgramCache]: Analyzing trace with hash -413443083, now seen corresponding path program 1 times [2023-08-26 19:16:22,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:22,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996436358] [2023-08-26 19:16:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:22,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:22,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:22,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996436358] [2023-08-26 19:16:22,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996436358] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:22,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:22,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:16:22,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544755799] [2023-08-26 19:16:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:22,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:16:22,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:22,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:16:22,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:16:22,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 580 [2023-08-26 19:16:22,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 115 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 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) [2023-08-26 19:16:22,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:22,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 580 [2023-08-26 19:16:22,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:22,908 INFO L124 PetriNetUnfolderBase]: 1779/4000 cut-off events. [2023-08-26 19:16:22,908 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2023-08-26 19:16:22,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7672 conditions, 4000 events. 1779/4000 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 28622 event pairs, 1024 based on Foata normal form. 0/2358 useless extension candidates. Maximal degree in co-relation 7666. Up to 3402 conditions per place. [2023-08-26 19:16:22,929 INFO L140 encePairwiseOnDemand]: 576/580 looper letters, 170 selfloop transitions, 4 changer transitions 3/198 dead transitions. [2023-08-26 19:16:22,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 198 transitions, 789 flow [2023-08-26 19:16:22,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:16:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:16:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2023-08-26 19:16:22,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45057471264367815 [2023-08-26 19:16:22,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 784 transitions. [2023-08-26 19:16:22,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 784 transitions. [2023-08-26 19:16:22,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:22,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 784 transitions. [2023-08-26 19:16:22,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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) [2023-08-26 19:16:22,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:22,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:22,938 INFO L175 Difference]: Start difference. First operand has 120 places, 115 transitions, 264 flow. Second operand 3 states and 784 transitions. [2023-08-26 19:16:22,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 198 transitions, 789 flow [2023-08-26 19:16:22,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 198 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:16:22,942 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 290 flow [2023-08-26 19:16:22,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2023-08-26 19:16:22,943 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, 0 predicate places. [2023-08-26 19:16:22,943 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 290 flow [2023-08-26 19:16:22,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 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) [2023-08-26 19:16:22,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:22,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 19:16:22,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 19:16:22,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:22,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -413443082, now seen corresponding path program 1 times [2023-08-26 19:16:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:22,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552276243] [2023-08-26 19:16:22,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:23,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:23,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552276243] [2023-08-26 19:16:23,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552276243] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:23,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:23,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 19:16:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441835626] [2023-08-26 19:16:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:23,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 19:16:23,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:23,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 19:16:23,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 19:16:23,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 580 [2023-08-26 19:16:23,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 205.5) internal successors, (822), 4 states have internal predecessors, (822), 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) [2023-08-26 19:16:23,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:23,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 580 [2023-08-26 19:16:23,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:23,526 INFO L124 PetriNetUnfolderBase]: 1704/3850 cut-off events. [2023-08-26 19:16:23,526 INFO L125 PetriNetUnfolderBase]: For 545/545 co-relation queries the response was YES. [2023-08-26 19:16:23,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7642 conditions, 3850 events. 1704/3850 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 28781 event pairs, 31 based on Foata normal form. 51/2337 useless extension candidates. Maximal degree in co-relation 7635. Up to 3370 conditions per place. [2023-08-26 19:16:23,542 INFO L140 encePairwiseOnDemand]: 576/580 looper letters, 140 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2023-08-26 19:16:23,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 166 transitions, 681 flow [2023-08-26 19:16:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:16:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:16:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 959 transitions. [2023-08-26 19:16:23,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41336206896551725 [2023-08-26 19:16:23,545 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 959 transitions. [2023-08-26 19:16:23,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 959 transitions. [2023-08-26 19:16:23,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:23,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 959 transitions. [2023-08-26 19:16:23,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 239.75) internal successors, (959), 4 states have internal predecessors, (959), 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) [2023-08-26 19:16:23,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 580.0) internal successors, (2900), 5 states have internal predecessors, (2900), 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) [2023-08-26 19:16:23,551 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 580.0) internal successors, (2900), 5 states have internal predecessors, (2900), 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) [2023-08-26 19:16:23,551 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 290 flow. Second operand 4 states and 959 transitions. [2023-08-26 19:16:23,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 166 transitions, 681 flow [2023-08-26 19:16:23,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 166 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:16:23,555 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 290 flow [2023-08-26 19:16:23,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2023-08-26 19:16:23,556 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, 0 predicate places. [2023-08-26 19:16:23,556 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 290 flow [2023-08-26 19:16:23,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 4 states have internal predecessors, (822), 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) [2023-08-26 19:16:23,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:23,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:23,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 19:16:23,557 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:23,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash 68348236, now seen corresponding path program 1 times [2023-08-26 19:16:23,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:23,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487756517] [2023-08-26 19:16:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:23,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:23,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487756517] [2023-08-26 19:16:23,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487756517] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:16:23,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821983963] [2023-08-26 19:16:23,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:23,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:16:23,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:16:23,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:16:23,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 19:16:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:23,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 19:16:23,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:16:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:23,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:16:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821983963] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:16:23,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:16:23,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 19:16:23,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836833318] [2023-08-26 19:16:23,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:16:23,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 19:16:23,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:23,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 19:16:23,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 19:16:23,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 580 [2023-08-26 19:16:23,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 270.42857142857144) internal successors, (1893), 7 states have internal predecessors, (1893), 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) [2023-08-26 19:16:23,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:23,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 580 [2023-08-26 19:16:23,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:23,865 INFO L124 PetriNetUnfolderBase]: 61/191 cut-off events. [2023-08-26 19:16:23,866 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-08-26 19:16:23,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 191 events. 61/191 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 638 event pairs, 29 based on Foata normal form. 29/169 useless extension candidates. Maximal degree in co-relation 400. Up to 118 conditions per place. [2023-08-26 19:16:23,867 INFO L140 encePairwiseOnDemand]: 577/580 looper letters, 51 selfloop transitions, 3 changer transitions 11/78 dead transitions. [2023-08-26 19:16:23,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 324 flow [2023-08-26 19:16:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:16:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:16:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1136 transitions. [2023-08-26 19:16:23,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896551724137931 [2023-08-26 19:16:23,871 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1136 transitions. [2023-08-26 19:16:23,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1136 transitions. [2023-08-26 19:16:23,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:23,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1136 transitions. [2023-08-26 19:16:23,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 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) [2023-08-26 19:16:23,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 580.0) internal successors, (2900), 5 states have internal predecessors, (2900), 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) [2023-08-26 19:16:23,879 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 580.0) internal successors, (2900), 5 states have internal predecessors, (2900), 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) [2023-08-26 19:16:23,879 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 290 flow. Second operand 4 states and 1136 transitions. [2023-08-26 19:16:23,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 324 flow [2023-08-26 19:16:23,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 302 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-26 19:16:23,883 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 109 flow [2023-08-26 19:16:23,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2023-08-26 19:16:23,884 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -64 predicate places. [2023-08-26 19:16:23,884 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 109 flow [2023-08-26 19:16:23,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 270.42857142857144) internal successors, (1893), 7 states have internal predecessors, (1893), 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) [2023-08-26 19:16:23,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:23,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:23,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 19:16:24,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-08-26 19:16:24,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:24,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:24,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2113331104, now seen corresponding path program 1 times [2023-08-26 19:16:24,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:24,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255149836] [2023-08-26 19:16:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255149836] [2023-08-26 19:16:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255149836] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:24,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:24,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:16:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059820125] [2023-08-26 19:16:24,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:24,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:16:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:16:24,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:16:24,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 580 [2023-08-26 19:16:24,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 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) [2023-08-26 19:16:24,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:24,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 580 [2023-08-26 19:16:24,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:24,573 INFO L124 PetriNetUnfolderBase]: 60/171 cut-off events. [2023-08-26 19:16:24,573 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-08-26 19:16:24,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 171 events. 60/171 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 512 event pairs, 2 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 402. Up to 135 conditions per place. [2023-08-26 19:16:24,574 INFO L140 encePairwiseOnDemand]: 576/580 looper letters, 35 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-26 19:16:24,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 195 flow [2023-08-26 19:16:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:16:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:16:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 984 transitions. [2023-08-26 19:16:24,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393103448275862 [2023-08-26 19:16:24,578 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 984 transitions. [2023-08-26 19:16:24,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 984 transitions. [2023-08-26 19:16:24,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:24,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 984 transitions. [2023-08-26 19:16:24,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.8) internal successors, (984), 5 states have internal predecessors, (984), 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) [2023-08-26 19:16:24,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 580.0) internal successors, (3480), 6 states have internal predecessors, (3480), 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) [2023-08-26 19:16:24,584 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 580.0) internal successors, (3480), 6 states have internal predecessors, (3480), 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) [2023-08-26 19:16:24,584 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 109 flow. Second operand 5 states and 984 transitions. [2023-08-26 19:16:24,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 195 flow [2023-08-26 19:16:24,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:16:24,585 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 111 flow [2023-08-26 19:16:24,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-26 19:16:24,587 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -68 predicate places. [2023-08-26 19:16:24,587 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 111 flow [2023-08-26 19:16:24,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 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) [2023-08-26 19:16:24,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:24,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:24,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 19:16:24,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:24,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2113331105, now seen corresponding path program 1 times [2023-08-26 19:16:24,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:24,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376286063] [2023-08-26 19:16:24,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:24,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:24,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376286063] [2023-08-26 19:16:24,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376286063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:24,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:24,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:16:24,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319165729] [2023-08-26 19:16:24,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:24,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 19:16:24,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:24,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 19:16:24,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 19:16:24,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 580 [2023-08-26 19:16:24,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 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) [2023-08-26 19:16:24,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:24,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 580 [2023-08-26 19:16:24,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:24,877 INFO L124 PetriNetUnfolderBase]: 58/166 cut-off events. [2023-08-26 19:16:24,877 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-26 19:16:24,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 166 events. 58/166 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 486 event pairs, 3 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 396. Up to 130 conditions per place. [2023-08-26 19:16:24,878 INFO L140 encePairwiseOnDemand]: 577/580 looper letters, 35 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-26 19:16:24,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 43 transitions, 190 flow [2023-08-26 19:16:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 19:16:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 19:16:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 788 transitions. [2023-08-26 19:16:24,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3396551724137931 [2023-08-26 19:16:24,880 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 788 transitions. [2023-08-26 19:16:24,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 788 transitions. [2023-08-26 19:16:24,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:24,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 788 transitions. [2023-08-26 19:16:24,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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) [2023-08-26 19:16:24,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 580.0) internal successors, (2900), 5 states have internal predecessors, (2900), 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) [2023-08-26 19:16:24,887 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 580.0) internal successors, (2900), 5 states have internal predecessors, (2900), 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) [2023-08-26 19:16:24,887 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 111 flow. Second operand 4 states and 788 transitions. [2023-08-26 19:16:24,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 43 transitions, 190 flow [2023-08-26 19:16:24,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 19:16:24,888 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 106 flow [2023-08-26 19:16:24,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-26 19:16:24,889 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -69 predicate places. [2023-08-26 19:16:24,889 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 106 flow [2023-08-26 19:16:24,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 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) [2023-08-26 19:16:24,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:24,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:24,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 19:16:24,890 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:24,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:24,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1088755616, now seen corresponding path program 1 times [2023-08-26 19:16:24,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:24,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145439807] [2023-08-26 19:16:24,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:24,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:24,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:24,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145439807] [2023-08-26 19:16:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145439807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:24,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:24,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:16:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292527273] [2023-08-26 19:16:24,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:24,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:16:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:16:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:16:24,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 580 [2023-08-26 19:16:24,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 199.8) internal successors, (999), 5 states have internal predecessors, (999), 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) [2023-08-26 19:16:24,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:24,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 580 [2023-08-26 19:16:24,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:25,105 INFO L124 PetriNetUnfolderBase]: 48/138 cut-off events. [2023-08-26 19:16:25,106 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-08-26 19:16:25,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 138 events. 48/138 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 353 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 333. Up to 100 conditions per place. [2023-08-26 19:16:25,106 INFO L140 encePairwiseOnDemand]: 571/580 looper letters, 31 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-26 19:16:25,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 180 flow [2023-08-26 19:16:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:16:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:16:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1030 transitions. [2023-08-26 19:16:25,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35517241379310344 [2023-08-26 19:16:25,110 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1030 transitions. [2023-08-26 19:16:25,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1030 transitions. [2023-08-26 19:16:25,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:25,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1030 transitions. [2023-08-26 19:16:25,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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) [2023-08-26 19:16:25,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 580.0) internal successors, (3480), 6 states have internal predecessors, (3480), 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) [2023-08-26 19:16:25,117 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 580.0) internal successors, (3480), 6 states have internal predecessors, (3480), 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) [2023-08-26 19:16:25,117 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 106 flow. Second operand 5 states and 1030 transitions. [2023-08-26 19:16:25,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 180 flow [2023-08-26 19:16:25,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 177 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 19:16:25,118 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 99 flow [2023-08-26 19:16:25,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-08-26 19:16:25,119 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -73 predicate places. [2023-08-26 19:16:25,119 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 99 flow [2023-08-26 19:16:25,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 199.8) internal successors, (999), 5 states have internal predecessors, (999), 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) [2023-08-26 19:16:25,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:25,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:25,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 19:16:25,119 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:25,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1088755615, now seen corresponding path program 1 times [2023-08-26 19:16:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:25,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25468092] [2023-08-26 19:16:25,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:25,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25468092] [2023-08-26 19:16:25,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25468092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:25,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:25,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 19:16:25,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065020284] [2023-08-26 19:16:25,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:25,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 19:16:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:25,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 19:16:25,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 19:16:25,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 580 [2023-08-26 19:16:25,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 197.8) internal successors, (989), 5 states have internal predecessors, (989), 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) [2023-08-26 19:16:25,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:25,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 580 [2023-08-26 19:16:25,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:25,278 INFO L124 PetriNetUnfolderBase]: 36/108 cut-off events. [2023-08-26 19:16:25,279 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-26 19:16:25,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 108 events. 36/108 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 240 event pairs, 0 based on Foata normal form. 3/102 useless extension candidates. Maximal degree in co-relation 269. Up to 70 conditions per place. [2023-08-26 19:16:25,279 INFO L140 encePairwiseOnDemand]: 571/580 looper letters, 19 selfloop transitions, 4 changer transitions 8/34 dead transitions. [2023-08-26 19:16:25,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 161 flow [2023-08-26 19:16:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 19:16:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 19:16:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1014 transitions. [2023-08-26 19:16:25,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3496551724137931 [2023-08-26 19:16:25,282 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1014 transitions. [2023-08-26 19:16:25,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1014 transitions. [2023-08-26 19:16:25,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:25,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1014 transitions. [2023-08-26 19:16:25,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 202.8) internal successors, (1014), 5 states have internal predecessors, (1014), 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) [2023-08-26 19:16:25,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 580.0) internal successors, (3480), 6 states have internal predecessors, (3480), 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) [2023-08-26 19:16:25,289 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 580.0) internal successors, (3480), 6 states have internal predecessors, (3480), 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) [2023-08-26 19:16:25,289 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 99 flow. Second operand 5 states and 1014 transitions. [2023-08-26 19:16:25,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 161 flow [2023-08-26 19:16:25,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 19:16:25,290 INFO L231 Difference]: Finished difference. Result has 45 places, 21 transitions, 72 flow [2023-08-26 19:16:25,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=45, PETRI_TRANSITIONS=21} [2023-08-26 19:16:25,291 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -78 predicate places. [2023-08-26 19:16:25,291 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 21 transitions, 72 flow [2023-08-26 19:16:25,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 197.8) internal successors, (989), 5 states have internal predecessors, (989), 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) [2023-08-26 19:16:25,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:25,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:25,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 19:16:25,292 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:25,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash -608313402, now seen corresponding path program 1 times [2023-08-26 19:16:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:25,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377377470] [2023-08-26 19:16:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:25,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:25,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377377470] [2023-08-26 19:16:25,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377377470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:25,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:25,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:16:25,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718732423] [2023-08-26 19:16:25,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:25,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:16:25,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:25,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:16:25,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:16:25,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 580 [2023-08-26 19:16:25,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 21 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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) [2023-08-26 19:16:25,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:25,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 580 [2023-08-26 19:16:25,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:25,371 INFO L124 PetriNetUnfolderBase]: 22/67 cut-off events. [2023-08-26 19:16:25,371 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-26 19:16:25,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 67 events. 22/67 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs, 4 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 182. Up to 35 conditions per place. [2023-08-26 19:16:25,372 INFO L140 encePairwiseOnDemand]: 578/580 looper letters, 18 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2023-08-26 19:16:25,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 22 transitions, 115 flow [2023-08-26 19:16:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:16:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:16:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2023-08-26 19:16:25,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3603448275862069 [2023-08-26 19:16:25,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2023-08-26 19:16:25,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2023-08-26 19:16:25,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:25,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2023-08-26 19:16:25,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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) [2023-08-26 19:16:25,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:25,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:25,379 INFO L175 Difference]: Start difference. First operand has 45 places, 21 transitions, 72 flow. Second operand 3 states and 627 transitions. [2023-08-26 19:16:25,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 22 transitions, 115 flow [2023-08-26 19:16:25,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 22 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 19:16:25,379 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 65 flow [2023-08-26 19:16:25,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-08-26 19:16:25,380 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -88 predicate places. [2023-08-26 19:16:25,380 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 65 flow [2023-08-26 19:16:25,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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) [2023-08-26 19:16:25,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:25,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:25,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 19:16:25,381 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:25,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash -608313401, now seen corresponding path program 1 times [2023-08-26 19:16:25,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:25,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100188125] [2023-08-26 19:16:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:16:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 19:16:25,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:16:25,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100188125] [2023-08-26 19:16:25,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100188125] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 19:16:25,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 19:16:25,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 19:16:25,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134419439] [2023-08-26 19:16:25,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 19:16:25,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 19:16:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:16:25,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 19:16:25,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 19:16:25,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 580 [2023-08-26 19:16:25,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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) [2023-08-26 19:16:25,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:16:25,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 580 [2023-08-26 19:16:25,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:16:25,469 INFO L124 PetriNetUnfolderBase]: 20/62 cut-off events. [2023-08-26 19:16:25,469 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 19:16:25,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 62 events. 20/62 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 4 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 167. Up to 30 conditions per place. [2023-08-26 19:16:25,470 INFO L140 encePairwiseOnDemand]: 578/580 looper letters, 17 selfloop transitions, 1 changer transitions 0/21 dead transitions. [2023-08-26 19:16:25,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 106 flow [2023-08-26 19:16:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 19:16:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 19:16:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2023-08-26 19:16:25,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3632183908045977 [2023-08-26 19:16:25,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 632 transitions. [2023-08-26 19:16:25,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 632 transitions. [2023-08-26 19:16:25,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:16:25,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 632 transitions. [2023-08-26 19:16:25,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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) [2023-08-26 19:16:25,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:25,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 580.0) internal successors, (2320), 4 states have internal predecessors, (2320), 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) [2023-08-26 19:16:25,477 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 65 flow. Second operand 3 states and 632 transitions. [2023-08-26 19:16:25,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 106 flow [2023-08-26 19:16:25,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 21 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 19:16:25,477 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 64 flow [2023-08-26 19:16:25,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2023-08-26 19:16:25,478 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -88 predicate places. [2023-08-26 19:16:25,478 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 64 flow [2023-08-26 19:16:25,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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) [2023-08-26 19:16:25,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:16:25,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:25,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 19:16:25,479 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr20ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-26 19:16:25,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:16:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash -140189193, now seen corresponding path program 1 times [2023-08-26 19:16:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:16:25,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402334010] [2023-08-26 19:16:25,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:16:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:16:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 19:16:25,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 19:16:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 19:16:25,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 19:16:25,555 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 19:16:25,556 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr20ASSERT_VIOLATIONASSERT (80 of 81 remaining) [2023-08-26 19:16:25,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 81 remaining) [2023-08-26 19:16:25,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 81 remaining) [2023-08-26 19:16:25,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 81 remaining) [2023-08-26 19:16:25,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 81 remaining) [2023-08-26 19:16:25,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 81 remaining) [2023-08-26 19:16:25,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 81 remaining) [2023-08-26 19:16:25,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 81 remaining) [2023-08-26 19:16:25,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 81 remaining) [2023-08-26 19:16:25,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 81 remaining) [2023-08-26 19:16:25,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 81 remaining) [2023-08-26 19:16:25,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 81 remaining) [2023-08-26 19:16:25,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 81 remaining) [2023-08-26 19:16:25,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 81 remaining) [2023-08-26 19:16:25,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 81 remaining) [2023-08-26 19:16:25,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 81 remaining) [2023-08-26 19:16:25,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 81 remaining) [2023-08-26 19:16:25,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 81 remaining) [2023-08-26 19:16:25,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 81 remaining) [2023-08-26 19:16:25,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 81 remaining) [2023-08-26 19:16:25,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 81 remaining) [2023-08-26 19:16:25,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 81 remaining) [2023-08-26 19:16:25,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 81 remaining) [2023-08-26 19:16:25,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 81 remaining) [2023-08-26 19:16:25,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 81 remaining) [2023-08-26 19:16:25,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 81 remaining) [2023-08-26 19:16:25,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 81 remaining) [2023-08-26 19:16:25,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 81 remaining) [2023-08-26 19:16:25,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 81 remaining) [2023-08-26 19:16:25,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 81 remaining) [2023-08-26 19:16:25,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 81 remaining) [2023-08-26 19:16:25,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 81 remaining) [2023-08-26 19:16:25,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 81 remaining) [2023-08-26 19:16:25,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 81 remaining) [2023-08-26 19:16:25,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 81 remaining) [2023-08-26 19:16:25,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 81 remaining) [2023-08-26 19:16:25,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 81 remaining) [2023-08-26 19:16:25,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 81 remaining) [2023-08-26 19:16:25,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 81 remaining) [2023-08-26 19:16:25,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 81 remaining) [2023-08-26 19:16:25,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 81 remaining) [2023-08-26 19:16:25,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 81 remaining) [2023-08-26 19:16:25,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 81 remaining) [2023-08-26 19:16:25,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 81 remaining) [2023-08-26 19:16:25,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 81 remaining) [2023-08-26 19:16:25,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONASSERT (35 of 81 remaining) [2023-08-26 19:16:25,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 81 remaining) [2023-08-26 19:16:25,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 81 remaining) [2023-08-26 19:16:25,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 81 remaining) [2023-08-26 19:16:25,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 81 remaining) [2023-08-26 19:16:25,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 81 remaining) [2023-08-26 19:16:25,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr20ASSERT_VIOLATIONASSERT (29 of 81 remaining) [2023-08-26 19:16:25,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 81 remaining) [2023-08-26 19:16:25,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 81 remaining) [2023-08-26 19:16:25,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 81 remaining) [2023-08-26 19:16:25,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 81 remaining) [2023-08-26 19:16:25,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 81 remaining) [2023-08-26 19:16:25,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 81 remaining) [2023-08-26 19:16:25,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 81 remaining) [2023-08-26 19:16:25,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 81 remaining) [2023-08-26 19:16:25,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 81 remaining) [2023-08-26 19:16:25,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 81 remaining) [2023-08-26 19:16:25,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 81 remaining) [2023-08-26 19:16:25,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 81 remaining) [2023-08-26 19:16:25,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 81 remaining) [2023-08-26 19:16:25,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 81 remaining) [2023-08-26 19:16:25,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 81 remaining) [2023-08-26 19:16:25,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 81 remaining) [2023-08-26 19:16:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 81 remaining) [2023-08-26 19:16:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 81 remaining) [2023-08-26 19:16:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 81 remaining) [2023-08-26 19:16:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 81 remaining) [2023-08-26 19:16:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 81 remaining) [2023-08-26 19:16:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 81 remaining) [2023-08-26 19:16:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 81 remaining) [2023-08-26 19:16:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 81 remaining) [2023-08-26 19:16:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 81 remaining) [2023-08-26 19:16:25,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 81 remaining) [2023-08-26 19:16:25,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 81 remaining) [2023-08-26 19:16:25,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 81 remaining) [2023-08-26 19:16:25,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 81 remaining) [2023-08-26 19:16:25,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 19:16:25,566 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:16:25,568 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-26 19:16:25,572 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 19:16:25,572 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:16:25,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:16:25 BasicIcfg [2023-08-26 19:16:25,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:16:25,605 INFO L158 Benchmark]: Toolchain (without parser) took 24016.82ms. Allocated memory was 375.4MB in the beginning and 650.1MB in the end (delta: 274.7MB). Free memory was 328.1MB in the beginning and 497.6MB in the end (delta: -169.5MB). Peak memory consumption was 108.3MB. Max. memory is 16.0GB. [2023-08-26 19:16:25,605 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 375.4MB. Free memory was 352.0MB in the beginning and 351.8MB in the end (delta: 167.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:16:25,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.85ms. Allocated memory is still 375.4MB. Free memory was 328.1MB in the beginning and 287.2MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-26 19:16:25,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.10ms. Allocated memory is still 375.4MB. Free memory was 287.2MB in the beginning and 284.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:16:25,606 INFO L158 Benchmark]: Boogie Preprocessor took 36.04ms. Allocated memory is still 375.4MB. Free memory was 284.0MB in the beginning and 281.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:16:25,606 INFO L158 Benchmark]: RCFGBuilder took 735.28ms. Allocated memory is still 375.4MB. Free memory was 281.9MB in the beginning and 247.3MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-26 19:16:25,606 INFO L158 Benchmark]: TraceAbstraction took 22484.71ms. Allocated memory was 375.4MB in the beginning and 650.1MB in the end (delta: 274.7MB). Free memory was 246.3MB in the beginning and 497.6MB in the end (delta: -251.3MB). Peak memory consumption was 26.5MB. Max. memory is 16.0GB. [2023-08-26 19:16:25,608 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.16ms. Allocated memory is still 375.4MB. Free memory was 352.0MB in the beginning and 351.8MB in the end (delta: 167.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 688.85ms. Allocated memory is still 375.4MB. Free memory was 328.1MB in the beginning and 287.2MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.10ms. Allocated memory is still 375.4MB. Free memory was 287.2MB in the beginning and 284.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.04ms. Allocated memory is still 375.4MB. Free memory was 284.0MB in the beginning and 281.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 735.28ms. Allocated memory is still 375.4MB. Free memory was 281.9MB in the beginning and 247.3MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 22484.71ms. Allocated memory was 375.4MB in the beginning and 650.1MB in the end (delta: 274.7MB). Free memory was 246.3MB in the beginning and 497.6MB in the end (delta: -251.3MB). Peak memory consumption was 26.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 1044]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [1044] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.3s, 280 PlacesBefore, 123 PlacesAfterwards, 308 TransitionsBefore, 145 TransitionsAfterwards, 29580 CoEnabledTransitionPairs, 7 FixpointIterations, 83 TrivialSequentialCompositions, 164 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 6 ChoiceCompositions, 272 TotalNumberOfCompositions, 103486 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31329, independent: 30176, independent conditional: 0, independent unconditional: 30176, dependent: 1153, dependent conditional: 0, dependent unconditional: 1153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 14224, independent: 13999, independent conditional: 0, independent unconditional: 13999, dependent: 225, dependent conditional: 0, dependent unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31329, independent: 16177, independent conditional: 0, independent unconditional: 16177, dependent: 928, dependent conditional: 0, dependent unconditional: 928, unknown: 14224, unknown conditional: 0, unknown unconditional: 14224] , Statistics on independence cache: Total cache size (in pairs): 2116, Positive cache size: 2010, Positive conditional cache size: 0, Positive unconditional cache size: 2010, Negative cache size: 106, Negative conditional cache size: 0, Negative unconditional cache size: 106, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 1234]: assertion can be violated assertion can be violated We found a FailurePath: [L1240] 0 pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1241-L1244] 0 struct s { int datum; struct s *next; } *A; [L1253] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1254] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1267] 0 struct s *p; [L1268] 0 A = malloc(sizeof(struct s)) [L1269] EXPR 0 \read(*A) [L1269] CALL 0 init(A,3) [L1246] 0 p -> datum = x [L1247] 0 p -> next = ((void *)0) [L1269] RET 0 init(A,3) [L1270] 0 pthread_t t_ids[10000]; [L1270] 0 int i=0; VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, i=0, t_ids={14:0}] [L1270] COND TRUE 0 i<10000 [L1270] FCALL, FORK 0 pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0)) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, i=0, pthread_create(&t_ids[i], ((void *)0), t_fun, ((void *)0))=-1, t_ids={14:0}] [L1256] 1 struct s *p = malloc(sizeof(struct s)); [L1257] CALL 1 init(p,7) [L1246] 1 p -> datum = x VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \old(x)=3, \old(x)=7, __global_lock={3:0}, p={-2:0}, p={-2:0}, p={9:0}, p={9:0}, x=3, x=7] [L1247] 1 p -> next = ((void *)0) [L1257] RET 1 init(p,7) [L1259] CALL 1 insert(p, &A) [L1250] EXPR 1 \read(**list) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \read(**list)={-2:0}, __global_lock={3:0}, list={4:0}, list={4:0}, p={9:0}, p={9:0}] [L1250] 1 p->next = *list VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, \read(**list)={-2:0}, __global_lock={3:0}, list={4:0}, list={4:0}, p={9:0}, p={9:0}] [L1251] 1 *list = p VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}, list={4:0}, list={4:0}, p={9:0}, p={9:0}] [L1259] RET 1 insert(p, &A) [L1262] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1262] EXPR 1 p->datum [L1262] CALL 1 __VERIFIER_assert((p->datum) == 0) [L1235] COND TRUE 1 !(cond) [L1235] CALL 1 reach_error() [L1234] COND FALSE 1 !(0) [L1234] 1 __assert_fail ("0", "racemacros.h", 9, __extension__ __PRETTY_FUNCTION__) VAL [A={4:0}, A_mutex={5:0}, B_mutex={6:0}, __global_lock={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 1234]: Unable to prove that assertion always holds Unable to prove that assertion always holds 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 368 locations, 82 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: 22.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1015 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1015 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1901 IncrementalHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 36 mSDtfsCounter, 1901 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=0, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 642 SizeOfPredicates, 1 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 19:16:25,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...