/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/pthread-wmm/mix025_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:13:11,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:13:11,332 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 18:13:11,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:13:11,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:13:11,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:13:11,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:13:11,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:13:11,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:13:11,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:13:11,373 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:13:11,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:13:11,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:13:11,375 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:13:11,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:13:11,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:13:11,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:13:11,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:13:11,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:13:11,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:13:11,377 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:13:11,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:13:11,377 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:13:11,378 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:13:11,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:13:11,378 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:13:11,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:13:11,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:13:11,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:13:11,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:13:11,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:13:11,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:13:11,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:13:11,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:13:11,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:13:11,381 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 18:13:11,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:13:11,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:13:11,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:13:11,721 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:13:11,724 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:13:11,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i [2023-08-26 18:13:12,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:13:13,125 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:13:13,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_pso.opt_rmo.opt.i [2023-08-26 18:13:13,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a3d6787/a4ac7b1c64734c55b3ec20746383c68b/FLAGd21c273d1 [2023-08-26 18:13:13,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a3d6787/a4ac7b1c64734c55b3ec20746383c68b [2023-08-26 18:13:13,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:13:13,164 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:13:13,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:13:13,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:13:13,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:13:13,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7958738c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13, skipping insertion in model container [2023-08-26 18:13:13,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,229 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:13:13,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:13:13,581 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:13:13,614 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:13:13,615 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:13:13,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:13:13,678 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:13:13,678 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:13:13,684 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:13:13,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13 WrapperNode [2023-08-26 18:13:13,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:13:13,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:13:13,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:13:13,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:13:13,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,725 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-08-26 18:13:13,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:13:13,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:13:13,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:13:13,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:13:13,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:13:13,768 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:13:13,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:13:13,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:13:13,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (1/1) ... [2023-08-26 18:13:13,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:13:13,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:13:13,802 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 18:13:13,805 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 18:13:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:13:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:13:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:13:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:13:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:13:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:13:13,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:13:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:13:13,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:13:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:13:13,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:13:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:13:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:13:13,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:13:13,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:13:13,845 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 18:13:13,961 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:13:13,962 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:13:14,340 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:13:14,461 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:13:14,461 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:13:14,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:13:14 BoogieIcfgContainer [2023-08-26 18:13:14,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:13:14,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:13:14,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:13:14,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:13:14,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:13:13" (1/3) ... [2023-08-26 18:13:14,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fabb079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:13:14, skipping insertion in model container [2023-08-26 18:13:14,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:13:13" (2/3) ... [2023-08-26 18:13:14,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fabb079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:13:14, skipping insertion in model container [2023-08-26 18:13:14,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:13:14" (3/3) ... [2023-08-26 18:13:14,471 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_pso.opt_rmo.opt.i [2023-08-26 18:13:14,488 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:13:14,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 18:13:14,489 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:13:14,537 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:13:14,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 119 transitions, 253 flow [2023-08-26 18:13:14,605 INFO L124 PetriNetUnfolderBase]: 3/116 cut-off events. [2023-08-26 18:13:14,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:13:14,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 18:13:14,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 119 transitions, 253 flow [2023-08-26 18:13:14,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 116 transitions, 241 flow [2023-08-26 18:13:14,618 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:13:14,626 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 116 transitions, 241 flow [2023-08-26 18:13:14,628 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 116 transitions, 241 flow [2023-08-26 18:13:14,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 241 flow [2023-08-26 18:13:14,653 INFO L124 PetriNetUnfolderBase]: 3/116 cut-off events. [2023-08-26 18:13:14,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:13:14,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 18:13:14,656 INFO L119 LiptonReduction]: Number of co-enabled transitions 2132 [2023-08-26 18:13:18,540 INFO L134 LiptonReduction]: Checked pairs total: 5579 [2023-08-26 18:13:18,540 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-26 18:13:18,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:13:18,557 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;@5bbc1a65, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:13:18,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 18:13:18,558 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:13:18,558 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:13:18,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:13:18,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:18,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:13:18,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:18,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash 533, now seen corresponding path program 1 times [2023-08-26 18:13:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:18,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353477665] [2023-08-26 18:13:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:18,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:18,661 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 18:13:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353477665] [2023-08-26 18:13:18,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353477665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:18,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:18,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:13:18,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140088536] [2023-08-26 18:13:18,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:18,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:13:18,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:18,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:13:18,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:13:18,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-26 18:13:18,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 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 18:13:18,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:18,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-26 18:13:18,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:18,985 INFO L124 PetriNetUnfolderBase]: 909/1394 cut-off events. [2023-08-26 18:13:18,985 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 18:13:18,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 1394 events. 909/1394 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6341 event pairs, 909 based on Foata normal form. 0/1182 useless extension candidates. Maximal degree in co-relation 2796. Up to 1359 conditions per place. [2023-08-26 18:13:19,003 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-26 18:13:19,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 95 flow [2023-08-26 18:13:19,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:13:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:13:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2023-08-26 18:13:19,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042194092827004 [2023-08-26 18:13:19,016 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 239 transitions. [2023-08-26 18:13:19,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 239 transitions. [2023-08-26 18:13:19,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:19,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 239 transitions. [2023-08-26 18:13:19,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 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 18:13:19,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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 18:13:19,031 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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 18:13:19,033 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 2 states and 239 transitions. [2023-08-26 18:13:19,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 95 flow [2023-08-26 18:13:19,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:13:19,039 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-26 18:13:19,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-26 18:13:19,044 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-08-26 18:13:19,045 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-26 18:13:19,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 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 18:13:19,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:19,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 18:13:19,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:13:19,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:19,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash 505071581, now seen corresponding path program 1 times [2023-08-26 18:13:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280525759] [2023-08-26 18:13:19,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:19,412 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 18:13:19,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280525759] [2023-08-26 18:13:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280525759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:19,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:19,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:13:19,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259076635] [2023-08-26 18:13:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:19,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:13:19,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:19,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:13:19,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:13:19,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 237 [2023-08-26 18:13:19,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 18:13:19,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:19,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 237 [2023-08-26 18:13:19,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:19,601 INFO L124 PetriNetUnfolderBase]: 711/1128 cut-off events. [2023-08-26 18:13:19,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:13:19,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2245 conditions, 1128 events. 711/1128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5081 event pairs, 197 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 2242. Up to 859 conditions per place. [2023-08-26 18:13:19,608 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-08-26 18:13:19,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 138 flow [2023-08-26 18:13:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:13:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:13:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-08-26 18:13:19,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880450070323488 [2023-08-26 18:13:19,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-08-26 18:13:19,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-08-26 18:13:19,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:19,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-08-26 18:13:19,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 18:13:19,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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 18:13:19,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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 18:13:19,623 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 347 transitions. [2023-08-26 18:13:19,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 138 flow [2023-08-26 18:13:19,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:13:19,624 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-26 18:13:19,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-26 18:13:19,625 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-08-26 18:13:19,626 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-26 18:13:19,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 18:13:19,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:19,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:19,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:13:19,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:19,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:19,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2050622930, now seen corresponding path program 1 times [2023-08-26 18:13:19,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:19,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445105211] [2023-08-26 18:13:19,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:19,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:19,929 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 18:13:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445105211] [2023-08-26 18:13:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445105211] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:19,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:19,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:13:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627812371] [2023-08-26 18:13:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:19,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:13:19,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:19,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:13:19,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:13:19,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 237 [2023-08-26 18:13:19,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 18:13:19,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:19,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 237 [2023-08-26 18:13:19,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:20,230 INFO L124 PetriNetUnfolderBase]: 1531/2326 cut-off events. [2023-08-26 18:13:20,230 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-08-26 18:13:20,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4821 conditions, 2326 events. 1531/2326 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10799 event pairs, 457 based on Foata normal form. 76/2402 useless extension candidates. Maximal degree in co-relation 4817. Up to 1560 conditions per place. [2023-08-26 18:13:20,241 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 33 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2023-08-26 18:13:20,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 172 flow [2023-08-26 18:13:20,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:13:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:13:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2023-08-26 18:13:20,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46554149085794655 [2023-08-26 18:13:20,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2023-08-26 18:13:20,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2023-08-26 18:13:20,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:20,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2023-08-26 18:13:20,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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 18:13:20,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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 18:13:20,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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 18:13:20,248 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 3 states and 331 transitions. [2023-08-26 18:13:20,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 172 flow [2023-08-26 18:13:20,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:13:20,250 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 94 flow [2023-08-26 18:13:20,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2023-08-26 18:13:20,251 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -6 predicate places. [2023-08-26 18:13:20,251 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 94 flow [2023-08-26 18:13:20,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 18:13:20,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:20,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:20,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:13:20,255 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:20,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 855197448, now seen corresponding path program 1 times [2023-08-26 18:13:20,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242596554] [2023-08-26 18:13:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:20,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:20,431 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 18:13:20,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242596554] [2023-08-26 18:13:20,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242596554] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:20,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:20,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:13:20,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297079411] [2023-08-26 18:13:20,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:20,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:13:20,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:20,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:13:20,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:13:20,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 237 [2023-08-26 18:13:20,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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 18:13:20,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:20,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 237 [2023-08-26 18:13:20,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:20,711 INFO L124 PetriNetUnfolderBase]: 1433/2180 cut-off events. [2023-08-26 18:13:20,711 INFO L125 PetriNetUnfolderBase]: For 790/790 co-relation queries the response was YES. [2023-08-26 18:13:20,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5388 conditions, 2180 events. 1433/2180 cut-off events. For 790/790 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9696 event pairs, 379 based on Foata normal form. 30/2210 useless extension candidates. Maximal degree in co-relation 5383. Up to 1105 conditions per place. [2023-08-26 18:13:20,725 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 38 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2023-08-26 18:13:20,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 228 flow [2023-08-26 18:13:20,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:13:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:13:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2023-08-26 18:13:20,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525316455696203 [2023-08-26 18:13:20,728 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 429 transitions. [2023-08-26 18:13:20,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 429 transitions. [2023-08-26 18:13:20,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:20,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 429 transitions. [2023-08-26 18:13:20,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 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 18:13:20,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 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 18:13:20,732 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 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 18:13:20,732 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 94 flow. Second operand 4 states and 429 transitions. [2023-08-26 18:13:20,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 228 flow [2023-08-26 18:13:20,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:13:20,740 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 120 flow [2023-08-26 18:13:20,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-08-26 18:13:20,741 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-08-26 18:13:20,741 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 120 flow [2023-08-26 18:13:20,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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 18:13:20,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:20,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:20,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:13:20,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:20,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash 705853407, now seen corresponding path program 1 times [2023-08-26 18:13:20,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:20,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902290576] [2023-08-26 18:13:20,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:20,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:20,949 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 18:13:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:20,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902290576] [2023-08-26 18:13:20,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902290576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:20,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:20,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:13:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867222214] [2023-08-26 18:13:20,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:20,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:13:20,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:20,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:13:20,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:13:20,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 237 [2023-08-26 18:13:20,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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 18:13:20,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:20,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 237 [2023-08-26 18:13:20,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:21,252 INFO L124 PetriNetUnfolderBase]: 798/1379 cut-off events. [2023-08-26 18:13:21,252 INFO L125 PetriNetUnfolderBase]: For 561/575 co-relation queries the response was YES. [2023-08-26 18:13:21,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1379 events. 798/1379 cut-off events. For 561/575 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7419 event pairs, 149 based on Foata normal form. 148/1490 useless extension candidates. Maximal degree in co-relation 3316. Up to 785 conditions per place. [2023-08-26 18:13:21,260 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 46 selfloop transitions, 7 changer transitions 9/69 dead transitions. [2023-08-26 18:13:21,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 378 flow [2023-08-26 18:13:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:13:21,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:13:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2023-08-26 18:13:21,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46160337552742614 [2023-08-26 18:13:21,263 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 547 transitions. [2023-08-26 18:13:21,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 547 transitions. [2023-08-26 18:13:21,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:21,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 547 transitions. [2023-08-26 18:13:21,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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 18:13:21,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 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 18:13:21,267 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 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 18:13:21,268 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 120 flow. Second operand 5 states and 547 transitions. [2023-08-26 18:13:21,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 378 flow [2023-08-26 18:13:21,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:13:21,272 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 171 flow [2023-08-26 18:13:21,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-08-26 18:13:21,274 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-08-26 18:13:21,274 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 171 flow [2023-08-26 18:13:21,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 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 18:13:21,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:21,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:21,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:13:21,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:21,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:21,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1721823110, now seen corresponding path program 1 times [2023-08-26 18:13:21,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:21,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685781582] [2023-08-26 18:13:21,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:21,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:21,462 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 18:13:21,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:21,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685781582] [2023-08-26 18:13:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685781582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:21,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:13:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983062075] [2023-08-26 18:13:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:21,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:13:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:21,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:13:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:13:21,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 237 [2023-08-26 18:13:21,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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 18:13:21,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:21,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 237 [2023-08-26 18:13:21,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:21,696 INFO L124 PetriNetUnfolderBase]: 582/1065 cut-off events. [2023-08-26 18:13:21,697 INFO L125 PetriNetUnfolderBase]: For 860/865 co-relation queries the response was YES. [2023-08-26 18:13:21,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3331 conditions, 1065 events. 582/1065 cut-off events. For 860/865 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5764 event pairs, 74 based on Foata normal form. 83/1123 useless extension candidates. Maximal degree in co-relation 3320. Up to 354 conditions per place. [2023-08-26 18:13:21,704 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 57 selfloop transitions, 13 changer transitions 16/93 dead transitions. [2023-08-26 18:13:21,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 93 transitions, 577 flow [2023-08-26 18:13:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:13:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:13:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 765 transitions. [2023-08-26 18:13:21,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46112115732368897 [2023-08-26 18:13:21,707 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 765 transitions. [2023-08-26 18:13:21,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 765 transitions. [2023-08-26 18:13:21,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:21,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 765 transitions. [2023-08-26 18:13:21,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 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 18:13:21,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 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 18:13:21,712 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 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 18:13:21,712 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 171 flow. Second operand 7 states and 765 transitions. [2023-08-26 18:13:21,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 93 transitions, 577 flow [2023-08-26 18:13:21,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:13:21,719 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 255 flow [2023-08-26 18:13:21,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-26 18:13:21,719 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-08-26 18:13:21,719 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 255 flow [2023-08-26 18:13:21,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 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 18:13:21,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:21,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:21,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:13:21,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:21,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:21,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2000637100, now seen corresponding path program 1 times [2023-08-26 18:13:21,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:21,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008474822] [2023-08-26 18:13:21,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:21,883 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 18:13:21,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:21,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008474822] [2023-08-26 18:13:21,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008474822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:21,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:21,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:13:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324663639] [2023-08-26 18:13:21,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:21,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:13:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:13:21,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:13:21,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 237 [2023-08-26 18:13:21,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 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 18:13:21,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:21,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 237 [2023-08-26 18:13:21,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:22,181 INFO L124 PetriNetUnfolderBase]: 942/1633 cut-off events. [2023-08-26 18:13:22,182 INFO L125 PetriNetUnfolderBase]: For 3853/3853 co-relation queries the response was YES. [2023-08-26 18:13:22,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6196 conditions, 1633 events. 942/1633 cut-off events. For 3853/3853 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8649 event pairs, 94 based on Foata normal form. 9/1642 useless extension candidates. Maximal degree in co-relation 6182. Up to 735 conditions per place. [2023-08-26 18:13:22,189 INFO L140 encePairwiseOnDemand]: 229/237 looper letters, 69 selfloop transitions, 16 changer transitions 21/106 dead transitions. [2023-08-26 18:13:22,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 106 transitions, 887 flow [2023-08-26 18:13:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:13:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:13:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-26 18:13:22,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45654008438818566 [2023-08-26 18:13:22,192 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-26 18:13:22,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-26 18:13:22,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:22,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-26 18:13:22,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 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 18:13:22,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 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 18:13:22,196 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 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 18:13:22,196 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 255 flow. Second operand 5 states and 541 transitions. [2023-08-26 18:13:22,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 106 transitions, 887 flow [2023-08-26 18:13:22,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 106 transitions, 790 flow, removed 36 selfloop flow, removed 2 redundant places. [2023-08-26 18:13:22,224 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 303 flow [2023-08-26 18:13:22,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-08-26 18:13:22,224 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2023-08-26 18:13:22,225 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 303 flow [2023-08-26 18:13:22,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 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 18:13:22,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:22,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:22,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:13:22,225 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:22,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:22,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1609589514, now seen corresponding path program 2 times [2023-08-26 18:13:22,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:22,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837063772] [2023-08-26 18:13:22,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:22,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:22,395 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 18:13:22,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:22,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837063772] [2023-08-26 18:13:22,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837063772] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:22,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:22,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:13:22,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507165125] [2023-08-26 18:13:22,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:22,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:13:22,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:22,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:13:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:13:22,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 237 [2023-08-26 18:13:22,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 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 18:13:22,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:22,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 237 [2023-08-26 18:13:22,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:22,652 INFO L124 PetriNetUnfolderBase]: 530/992 cut-off events. [2023-08-26 18:13:22,652 INFO L125 PetriNetUnfolderBase]: For 2228/2228 co-relation queries the response was YES. [2023-08-26 18:13:22,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3985 conditions, 992 events. 530/992 cut-off events. For 2228/2228 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4929 event pairs, 71 based on Foata normal form. 8/1000 useless extension candidates. Maximal degree in co-relation 3967. Up to 354 conditions per place. [2023-08-26 18:13:22,658 INFO L140 encePairwiseOnDemand]: 229/237 looper letters, 68 selfloop transitions, 15 changer transitions 19/102 dead transitions. [2023-08-26 18:13:22,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 102 transitions, 824 flow [2023-08-26 18:13:22,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:13:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:13:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 646 transitions. [2023-08-26 18:13:22,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4542897327707454 [2023-08-26 18:13:22,661 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 646 transitions. [2023-08-26 18:13:22,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 646 transitions. [2023-08-26 18:13:22,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:22,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 646 transitions. [2023-08-26 18:13:22,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 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 18:13:22,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 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 18:13:22,665 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 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 18:13:22,666 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 303 flow. Second operand 6 states and 646 transitions. [2023-08-26 18:13:22,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 102 transitions, 824 flow [2023-08-26 18:13:22,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 102 transitions, 788 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-26 18:13:22,673 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 300 flow [2023-08-26 18:13:22,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-26 18:13:22,674 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 16 predicate places. [2023-08-26 18:13:22,674 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 300 flow [2023-08-26 18:13:22,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 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 18:13:22,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:22,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:22,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:13:22,675 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:22,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1831708834, now seen corresponding path program 3 times [2023-08-26 18:13:22,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:22,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103452337] [2023-08-26 18:13:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:22,852 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 18:13:22,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:22,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103452337] [2023-08-26 18:13:22,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103452337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:22,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:22,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:13:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970412199] [2023-08-26 18:13:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:22,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:13:22,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:22,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:13:22,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:13:22,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 237 [2023-08-26 18:13:22,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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 18:13:22,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:22,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 237 [2023-08-26 18:13:22,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:23,022 INFO L124 PetriNetUnfolderBase]: 292/591 cut-off events. [2023-08-26 18:13:23,022 INFO L125 PetriNetUnfolderBase]: For 1395/1395 co-relation queries the response was YES. [2023-08-26 18:13:23,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2256 conditions, 591 events. 292/591 cut-off events. For 1395/1395 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2867 event pairs, 72 based on Foata normal form. 31/613 useless extension candidates. Maximal degree in co-relation 2239. Up to 210 conditions per place. [2023-08-26 18:13:23,026 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 32 selfloop transitions, 10 changer transitions 29/79 dead transitions. [2023-08-26 18:13:23,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 670 flow [2023-08-26 18:13:23,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:13:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:13:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 747 transitions. [2023-08-26 18:13:23,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45027124773960214 [2023-08-26 18:13:23,028 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 747 transitions. [2023-08-26 18:13:23,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 747 transitions. [2023-08-26 18:13:23,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:23,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 747 transitions. [2023-08-26 18:13:23,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 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 18:13:23,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 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 18:13:23,033 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 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 18:13:23,034 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 300 flow. Second operand 7 states and 747 transitions. [2023-08-26 18:13:23,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 670 flow [2023-08-26 18:13:23,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 580 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-08-26 18:13:23,038 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 230 flow [2023-08-26 18:13:23,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2023-08-26 18:13:23,039 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-26 18:13:23,039 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 230 flow [2023-08-26 18:13:23,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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 18:13:23,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:23,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:23,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:13:23,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:23,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1223995267, now seen corresponding path program 1 times [2023-08-26 18:13:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:23,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775006578] [2023-08-26 18:13:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:23,221 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 18:13:23,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:23,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775006578] [2023-08-26 18:13:23,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775006578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:23,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:23,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:13:23,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358447831] [2023-08-26 18:13:23,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:23,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:13:23,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:23,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:13:23,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:13:23,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-08-26 18:13:23,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 18:13:23,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:23,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-08-26 18:13:23,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:23,319 INFO L124 PetriNetUnfolderBase]: 249/493 cut-off events. [2023-08-26 18:13:23,319 INFO L125 PetriNetUnfolderBase]: For 1167/1167 co-relation queries the response was YES. [2023-08-26 18:13:23,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 493 events. 249/493 cut-off events. For 1167/1167 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2139 event pairs, 110 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 1859. Up to 256 conditions per place. [2023-08-26 18:13:23,321 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 28 selfloop transitions, 2 changer transitions 22/53 dead transitions. [2023-08-26 18:13:23,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 455 flow [2023-08-26 18:13:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:13:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:13:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2023-08-26 18:13:23,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739803094233474 [2023-08-26 18:13:23,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2023-08-26 18:13:23,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2023-08-26 18:13:23,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:23,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2023-08-26 18:13:23,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 18:13:23,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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 18:13:23,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 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 18:13:23,326 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 230 flow. Second operand 3 states and 337 transitions. [2023-08-26 18:13:23,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 455 flow [2023-08-26 18:13:23,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 372 flow, removed 21 selfloop flow, removed 9 redundant places. [2023-08-26 18:13:23,330 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 133 flow [2023-08-26 18:13:23,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-26 18:13:23,331 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-26 18:13:23,331 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 133 flow [2023-08-26 18:13:23,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 18:13:23,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:23,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:23,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:13:23,331 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:23,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:23,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2124786243, now seen corresponding path program 2 times [2023-08-26 18:13:23,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:23,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059336132] [2023-08-26 18:13:23,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:23,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:13:23,722 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 18:13:23,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:13:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059336132] [2023-08-26 18:13:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059336132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:13:23,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:13:23,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:13:23,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905550252] [2023-08-26 18:13:23,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:13:23,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:13:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:13:23,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:13:23,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:13:23,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 237 [2023-08-26 18:13:23,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 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 18:13:23,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:13:23,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 237 [2023-08-26 18:13:23,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:13:23,860 INFO L124 PetriNetUnfolderBase]: 65/154 cut-off events. [2023-08-26 18:13:23,861 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2023-08-26 18:13:23,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 154 events. 65/154 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 504 event pairs, 3 based on Foata normal form. 1/150 useless extension candidates. Maximal degree in co-relation 497. Up to 67 conditions per place. [2023-08-26 18:13:23,862 INFO L140 encePairwiseOnDemand]: 231/237 looper letters, 34 selfloop transitions, 5 changer transitions 17/59 dead transitions. [2023-08-26 18:13:23,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 402 flow [2023-08-26 18:13:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:13:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:13:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 727 transitions. [2023-08-26 18:13:23,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4382157926461724 [2023-08-26 18:13:23,865 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 727 transitions. [2023-08-26 18:13:23,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 727 transitions. [2023-08-26 18:13:23,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:13:23,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 727 transitions. [2023-08-26 18:13:23,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 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 18:13:23,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 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 18:13:23,870 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 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 18:13:23,870 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 133 flow. Second operand 7 states and 727 transitions. [2023-08-26 18:13:23,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 402 flow [2023-08-26 18:13:23,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 380 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-26 18:13:23,872 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 140 flow [2023-08-26 18:13:23,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2023-08-26 18:13:23,873 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2023-08-26 18:13:23,873 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 140 flow [2023-08-26 18:13:23,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 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 18:13:23,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:13:23,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:23,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:13:23,873 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:13:23,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:13:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash -503282223, now seen corresponding path program 3 times [2023-08-26 18:13:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:13:23,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906682334] [2023-08-26 18:13:23,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:13:23,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:13:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:13:23,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:13:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:13:23,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:13:23,967 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:13:23,967 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 18:13:23,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 18:13:23,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 18:13:23,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 18:13:23,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 18:13:23,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 18:13:23,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 18:13:23,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 18:13:23,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 18:13:23,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 18:13:23,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 18:13:23,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 18:13:23,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:13:23,970 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2023-08-26 18:13:23,975 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:13:23,976 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:13:24,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:13:24 BasicIcfg [2023-08-26 18:13:24,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:13:24,033 INFO L158 Benchmark]: Toolchain (without parser) took 10868.65ms. Allocated memory was 367.0MB in the beginning and 597.7MB in the end (delta: 230.7MB). Free memory was 341.6MB in the beginning and 294.9MB in the end (delta: 46.7MB). Peak memory consumption was 278.0MB. Max. memory is 16.0GB. [2023-08-26 18:13:24,033 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 367.0MB. Free memory was 342.8MB in the beginning and 342.7MB in the end (delta: 176.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:13:24,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.89ms. Allocated memory is still 367.0MB. Free memory was 341.1MB in the beginning and 318.1MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:13:24,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.08ms. Allocated memory is still 367.0MB. Free memory was 318.1MB in the beginning and 316.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:13:24,034 INFO L158 Benchmark]: Boogie Preprocessor took 35.99ms. Allocated memory is still 367.0MB. Free memory was 316.0MB in the beginning and 313.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:13:24,034 INFO L158 Benchmark]: RCFGBuilder took 695.56ms. Allocated memory is still 367.0MB. Free memory was 313.9MB in the beginning and 332.8MB in the end (delta: -18.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-26 18:13:24,034 INFO L158 Benchmark]: TraceAbstraction took 9566.87ms. Allocated memory was 367.0MB in the beginning and 597.7MB in the end (delta: 230.7MB). Free memory was 331.8MB in the beginning and 294.9MB in the end (delta: 36.9MB). Peak memory consumption was 267.5MB. Max. memory is 16.0GB. [2023-08-26 18:13:24,035 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.14ms. Allocated memory is still 367.0MB. Free memory was 342.8MB in the beginning and 342.7MB in the end (delta: 176.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 517.89ms. Allocated memory is still 367.0MB. Free memory was 341.1MB in the beginning and 318.1MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.08ms. Allocated memory is still 367.0MB. Free memory was 318.1MB in the beginning and 316.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.99ms. Allocated memory is still 367.0MB. Free memory was 316.0MB in the beginning and 313.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 695.56ms. Allocated memory is still 367.0MB. Free memory was 313.9MB in the beginning and 332.8MB in the end (delta: -18.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 9566.87ms. Allocated memory was 367.0MB in the beginning and 597.7MB in the end (delta: 230.7MB). Free memory was 331.8MB in the beginning and 294.9MB in the end (delta: 36.9MB). Peak memory consumption was 267.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 123 PlacesBefore, 39 PlacesAfterwards, 116 TransitionsBefore, 30 TransitionsAfterwards, 2132 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 118 TotalNumberOfCompositions, 5579 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3058, independent: 2896, independent conditional: 0, independent unconditional: 2896, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1207, independent: 1165, independent conditional: 0, independent unconditional: 1165, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3058, independent: 1731, independent conditional: 0, independent unconditional: 1731, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 1207, unknown conditional: 0, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t666; [L835] FCALL, FORK 0 pthread_create(&t666, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t666, ((void *)0), P0, ((void *)0))=-3, t666={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] 0 pthread_t t667; [L837] FCALL, FORK 0 pthread_create(&t667, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t667, ((void *)0), P1, ((void *)0))=-2, t666={5:0}, t667={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] 0 pthread_t t668; [L839] FCALL, FORK 0 pthread_create(&t668, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t668, ((void *)0), P2, ((void *)0))=-1, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t666={5:0}, t667={6:0}, t668={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L854] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix025_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 254 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 757 IncrementalHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 23 mSDtfsCounter, 757 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=7, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:13:24,059 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...