/usr/bin/java -Xmx8000000000 -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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:41:57,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:41:57,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:41:57,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:41:57,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:41:57,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:41:57,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:41:57,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:41:57,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:41:57,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:41:57,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:41:57,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:41:57,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:41:57,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:41:57,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:41:57,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:41:57,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:41:57,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:41:57,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:41:57,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:41:57,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:41:57,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:41:57,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:41:57,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:41:57,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:41:57,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:41:57,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:41:57,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:41:57,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:41:57,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:41:57,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:41:57,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:41:57,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:41:57,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:41:57,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:41:57,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:41:57,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:41:57,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:41:57,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:41:57,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:41:57,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:41:57,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 16:41:57,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:41:57,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:41:57,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:41:57,644 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:41:57,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:41:57,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:41:57,645 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:41:57,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:41:57,645 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:41:57,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:41:57,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:41:57,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:41:57,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:41:57,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:41:57,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:41:57,646 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:41:57,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:41:57,647 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:41:57,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:41:57,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:41:57,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:41:57,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:41:57,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:41:57,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:41:57,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:41:57,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:41:57,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:41:57,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:41:57,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:41:57,648 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:41:57,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:41:57,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Use on-demand Petri net difference -> true [2022-12-06 16:41:57,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:41:57,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:41:57,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:41:57,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:41:57,899 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:41:57,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-06 16:41:58,869 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:41:59,134 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:41:59,134 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2022-12-06 16:41:59,147 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96f03797/a9e443494e4d417eb316f03ffb0b9f00/FLAG7706a90e7 [2022-12-06 16:41:59,158 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e96f03797/a9e443494e4d417eb316f03ffb0b9f00 [2022-12-06 16:41:59,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:41:59,161 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:41:59,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:41:59,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:41:59,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:41:59,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@419c1d55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59, skipping insertion in model container [2022-12-06 16:41:59,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:41:59,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:41:59,631 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2022-12-06 16:41:59,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:41:59,672 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:41:59,719 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2022-12-06 16:41:59,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:41:59,807 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:41:59,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59 WrapperNode [2022-12-06 16:41:59,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:41:59,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:41:59,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:41:59,809 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:41:59,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,861 INFO L138 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 133 [2022-12-06 16:41:59,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:41:59,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:41:59,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:41:59,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:41:59,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,896 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:41:59,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:41:59,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:41:59,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:41:59,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (1/1) ... [2022-12-06 16:41:59,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:41:59,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:41:59,925 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) [2022-12-06 16:41:59,929 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 [2022-12-06 16:41:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:41:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 16:41:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 16:41:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:41:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-06 16:41:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:41:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:41:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-06 16:41:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-06 16:41:59,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:41:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:41:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:41:59,953 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 16:42:00,169 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:42:00,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:42:00,348 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:42:00,353 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:42:00,354 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:42:00,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:42:00 BoogieIcfgContainer [2022-12-06 16:42:00,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:42:00,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:42:00,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:42:00,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:42:00,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:41:59" (1/3) ... [2022-12-06 16:42:00,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136b79b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:42:00, skipping insertion in model container [2022-12-06 16:42:00,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:41:59" (2/3) ... [2022-12-06 16:42:00,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136b79b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:42:00, skipping insertion in model container [2022-12-06 16:42:00,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:42:00" (3/3) ... [2022-12-06 16:42:00,361 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2022-12-06 16:42:00,373 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:42:00,373 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-06 16:42:00,373 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:42:00,445 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 16:42:00,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 174 transitions, 364 flow [2022-12-06 16:42:00,523 INFO L130 PetriNetUnfolder]: 10/212 cut-off events. [2022-12-06 16:42:00,524 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 16:42:00,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 212 events. 10/212 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 124. Up to 4 conditions per place. [2022-12-06 16:42:00,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 174 transitions, 364 flow [2022-12-06 16:42:00,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 162 transitions, 336 flow [2022-12-06 16:42:00,552 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:42:00,558 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;@5ff6e641, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:42:00,558 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-06 16:42:00,571 INFO L130 PetriNetUnfolder]: 0/39 cut-off events. [2022-12-06 16:42:00,572 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:42:00,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:00,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:00,573 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:00,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1960341610, now seen corresponding path program 1 times [2022-12-06 16:42:00,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:00,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014903960] [2022-12-06 16:42:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:00,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:01,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:01,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014903960] [2022-12-06 16:42:01,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014903960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:01,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:01,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:42:01,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405474613] [2022-12-06 16:42:01,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:01,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:42:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:01,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:42:01,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:42:01,231 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 174 [2022-12-06 16:42:01,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 162 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 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) [2022-12-06 16:42:01,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:01,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 174 [2022-12-06 16:42:01,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:01,633 INFO L130 PetriNetUnfolder]: 361/1019 cut-off events. [2022-12-06 16:42:01,633 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 16:42:01,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 1019 events. 361/1019 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6154 event pairs, 216 based on Foata normal form. 20/990 useless extension candidates. Maximal degree in co-relation 1481. Up to 397 conditions per place. [2022-12-06 16:42:01,646 INFO L137 encePairwiseOnDemand]: 152/174 looper letters, 53 selfloop transitions, 17 changer transitions 1/158 dead transitions. [2022-12-06 16:42:01,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 158 transitions, 470 flow [2022-12-06 16:42:01,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:42:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:42:01,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 949 transitions. [2022-12-06 16:42:01,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6060025542784163 [2022-12-06 16:42:01,668 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 1 predicate places. [2022-12-06 16:42:01,668 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 158 transitions, 470 flow [2022-12-06 16:42:01,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 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) [2022-12-06 16:42:01,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:01,669 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:01,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:42:01,670 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2039733244, now seen corresponding path program 1 times [2022-12-06 16:42:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:01,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440069110] [2022-12-06 16:42:01,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:01,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:01,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:01,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440069110] [2022-12-06 16:42:01,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440069110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:01,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:01,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:42:01,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505912555] [2022-12-06 16:42:01,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:01,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:42:01,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:01,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:42:01,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:42:01,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 174 [2022-12-06 16:42:01,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 158 transitions, 470 flow. Second operand has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 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) [2022-12-06 16:42:01,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:01,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 174 [2022-12-06 16:42:01,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:02,132 INFO L130 PetriNetUnfolder]: 361/958 cut-off events. [2022-12-06 16:42:02,133 INFO L131 PetriNetUnfolder]: For 81/251 co-relation queries the response was YES. [2022-12-06 16:42:02,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 958 events. 361/958 cut-off events. For 81/251 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5585 event pairs, 120 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 2017. Up to 400 conditions per place. [2022-12-06 16:42:02,139 INFO L137 encePairwiseOnDemand]: 155/174 looper letters, 61 selfloop transitions, 18 changer transitions 1/166 dead transitions. [2022-12-06 16:42:02,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 664 flow [2022-12-06 16:42:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:42:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:42:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1051 transitions. [2022-12-06 16:42:02,142 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6040229885057471 [2022-12-06 16:42:02,143 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 8 predicate places. [2022-12-06 16:42:02,143 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 664 flow [2022-12-06 16:42:02,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.33333333333333) internal successors, (602), 6 states have internal predecessors, (602), 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) [2022-12-06 16:42:02,144 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:02,144 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:02,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:42:02,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash 886989091, now seen corresponding path program 1 times [2022-12-06 16:42:02,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:02,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824362856] [2022-12-06 16:42:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:02,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:02,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:02,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824362856] [2022-12-06 16:42:02,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824362856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:02,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:02,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:42:02,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992199436] [2022-12-06 16:42:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:02,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:42:02,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:42:02,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:42:02,407 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 174 [2022-12-06 16:42:02,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 664 flow. Second operand has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:42:02,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:02,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 174 [2022-12-06 16:42:02,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:02,795 INFO L130 PetriNetUnfolder]: 832/1967 cut-off events. [2022-12-06 16:42:02,795 INFO L131 PetriNetUnfolder]: For 308/416 co-relation queries the response was YES. [2022-12-06 16:42:02,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6289 conditions, 1967 events. 832/1967 cut-off events. For 308/416 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12863 event pairs, 104 based on Foata normal form. 0/1931 useless extension candidates. Maximal degree in co-relation 5908. Up to 884 conditions per place. [2022-12-06 16:42:02,807 INFO L137 encePairwiseOnDemand]: 153/174 looper letters, 117 selfloop transitions, 59 changer transitions 1/263 dead transitions. [2022-12-06 16:42:02,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 263 transitions, 1592 flow [2022-12-06 16:42:02,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:42:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:42:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1384 transitions. [2022-12-06 16:42:02,810 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6118479221927497 [2022-12-06 16:42:02,811 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 20 predicate places. [2022-12-06 16:42:02,811 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 263 transitions, 1592 flow [2022-12-06 16:42:02,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 16:42:02,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:02,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:02,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:42:02,812 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1761071825, now seen corresponding path program 1 times [2022-12-06 16:42:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:02,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711648583] [2022-12-06 16:42:02,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:03,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:03,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711648583] [2022-12-06 16:42:03,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711648583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:03,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:03,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:42:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745664419] [2022-12-06 16:42:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:03,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:42:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:42:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:42:03,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 174 [2022-12-06 16:42:03,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 263 transitions, 1592 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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) [2022-12-06 16:42:03,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:03,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 174 [2022-12-06 16:42:03,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:03,491 INFO L130 PetriNetUnfolder]: 1144/2534 cut-off events. [2022-12-06 16:42:03,491 INFO L131 PetriNetUnfolder]: For 804/972 co-relation queries the response was YES. [2022-12-06 16:42:03,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10424 conditions, 2534 events. 1144/2534 cut-off events. For 804/972 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17170 event pairs, 109 based on Foata normal form. 47/2530 useless extension candidates. Maximal degree in co-relation 9974. Up to 1197 conditions per place. [2022-12-06 16:42:03,506 INFO L137 encePairwiseOnDemand]: 155/174 looper letters, 127 selfloop transitions, 53 changer transitions 100/366 dead transitions. [2022-12-06 16:42:03,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 366 transitions, 2970 flow [2022-12-06 16:42:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 16:42:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 16:42:03,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1175 transitions. [2022-12-06 16:42:03,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6138975966562173 [2022-12-06 16:42:03,509 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 30 predicate places. [2022-12-06 16:42:03,510 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 366 transitions, 2970 flow [2022-12-06 16:42:03,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 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) [2022-12-06 16:42:03,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:03,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:03,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:42:03,510 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:03,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2141811499, now seen corresponding path program 1 times [2022-12-06 16:42:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:03,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703450154] [2022-12-06 16:42:03,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:03,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:03,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:03,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703450154] [2022-12-06 16:42:03,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703450154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:03,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:03,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 16:42:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123269286] [2022-12-06 16:42:03,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:03,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 16:42:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 16:42:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 16:42:03,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 174 [2022-12-06 16:42:03,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 366 transitions, 2970 flow. Second operand has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 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) [2022-12-06 16:42:03,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:03,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 174 [2022-12-06 16:42:03,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:03,662 INFO L130 PetriNetUnfolder]: 72/386 cut-off events. [2022-12-06 16:42:03,662 INFO L131 PetriNetUnfolder]: For 233/293 co-relation queries the response was YES. [2022-12-06 16:42:03,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 386 events. 72/386 cut-off events. For 233/293 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1464 event pairs, 72 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 701. Up to 157 conditions per place. [2022-12-06 16:42:03,664 INFO L137 encePairwiseOnDemand]: 168/174 looper letters, 9 selfloop transitions, 4 changer transitions 29/154 dead transitions. [2022-12-06 16:42:03,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 154 transitions, 878 flow [2022-12-06 16:42:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 16:42:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 16:42:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1050 transitions. [2022-12-06 16:42:03,666 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8620689655172413 [2022-12-06 16:42:03,667 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 25 predicate places. [2022-12-06 16:42:03,667 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 154 transitions, 878 flow [2022-12-06 16:42:03,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 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) [2022-12-06 16:42:03,668 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:03,668 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:03,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:42:03,668 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:03,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash 161815419, now seen corresponding path program 1 times [2022-12-06 16:42:03,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:03,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335760225] [2022-12-06 16:42:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:05,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:05,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335760225] [2022-12-06 16:42:05,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335760225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:05,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:05,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-12-06 16:42:05,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019925376] [2022-12-06 16:42:05,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:05,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 16:42:05,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:05,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 16:42:05,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-12-06 16:42:05,177 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 174 [2022-12-06 16:42:05,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 154 transitions, 878 flow. Second operand has 20 states, 20 states have (on average 78.05) internal successors, (1561), 20 states have internal predecessors, (1561), 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) [2022-12-06 16:42:05,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:05,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 174 [2022-12-06 16:42:05,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:06,746 INFO L130 PetriNetUnfolder]: 490/1305 cut-off events. [2022-12-06 16:42:06,746 INFO L131 PetriNetUnfolder]: For 4080/4388 co-relation queries the response was YES. [2022-12-06 16:42:06,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4821 conditions, 1305 events. 490/1305 cut-off events. For 4080/4388 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7774 event pairs, 179 based on Foata normal form. 10/1301 useless extension candidates. Maximal degree in co-relation 4141. Up to 587 conditions per place. [2022-12-06 16:42:06,753 INFO L137 encePairwiseOnDemand]: 142/174 looper letters, 118 selfloop transitions, 32 changer transitions 41/248 dead transitions. [2022-12-06 16:42:06,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 248 transitions, 2039 flow [2022-12-06 16:42:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-06 16:42:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-06 16:42:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2130 transitions. [2022-12-06 16:42:06,757 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4708222811671088 [2022-12-06 16:42:06,759 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 50 predicate places. [2022-12-06 16:42:06,759 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 248 transitions, 2039 flow [2022-12-06 16:42:06,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 78.05) internal successors, (1561), 20 states have internal predecessors, (1561), 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) [2022-12-06 16:42:06,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:06,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:06,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:42:06,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash 568971725, now seen corresponding path program 2 times [2022-12-06 16:42:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:06,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710631044] [2022-12-06 16:42:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:06,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:07,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710631044] [2022-12-06 16:42:07,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710631044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:07,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:07,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 16:42:07,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455289572] [2022-12-06 16:42:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:07,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:42:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:07,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:42:07,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:42:07,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 174 [2022-12-06 16:42:07,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 248 transitions, 2039 flow. Second operand has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:07,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:07,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 174 [2022-12-06 16:42:07,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:08,479 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L1711-1-->L1712: Formula: (= |v_my_callbackThread1of1ForFork0_#t~mem32_1| (select (select |v_#memory_int_31| v_my_callbackThread1of1ForFork0_~data~0.base_9) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_9 28))) InVars {#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_9, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_9} OutVars{#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_9, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_1|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_9} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem32][346], [214#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), 208#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 297#(and (= 0 |ULTIMATE.start_my_drv_probe_#in~data#1.offset|) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (= |ULTIMATE.start_my_drv_probe_#in~data#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~data#1.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (select |#valid| 4) 1) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_main_~#data~1#1.base|) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|)), 88#L1735true, 180#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), 352#(and (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~__mptr~0.offset) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~arg.offset) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork1_~dev~0.base |my_callbackThread1of1ForFork0_#in~arg.base|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |ULTIMATE.start_my_drv_probe_~d~0#1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~dev~0.offset) (<= my_callbackThread1of1ForFork1_~dev~0.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= (+ my_callbackThread1of1ForFork1_~data~0.offset 24) |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| |my_callbackThread1of1ForFork1_#in~arg.offset|)), 238#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), my_callbackThread1of1ForFork0InUse, 144#L1712true, my_callbackThread1of1ForFork1InUse, 263#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 150#L1710true]) [2022-12-06 16:42:08,479 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-06 16:42:08,480 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:42:08,480 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:42:08,480 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 16:42:08,498 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L1711-1-->L1712: Formula: (= |v_my_callbackThread1of1ForFork0_#t~mem32_1| (select (select |v_#memory_int_31| v_my_callbackThread1of1ForFork0_~data~0.base_9) (+ v_my_callbackThread1of1ForFork0_~data~0.offset_9 28))) InVars {#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_9, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_9} OutVars{#memory_int=|v_#memory_int_31|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_9, my_callbackThread1of1ForFork0_#t~mem32=|v_my_callbackThread1of1ForFork0_#t~mem32_1|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_9} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_#t~mem32][363], [214#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), 208#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 297#(and (= 0 |ULTIMATE.start_my_drv_probe_#in~data#1.offset|) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (= |ULTIMATE.start_my_drv_probe_#in~data#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~data#1.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (select |#valid| 4) 1) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_main_~#data~1#1.base|) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|)), 88#L1735true, 180#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), 354#(and (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~__mptr~0.offset) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~arg.offset) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork1_~dev~0.base |my_callbackThread1of1ForFork0_#in~arg.base|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |ULTIMATE.start_my_drv_probe_~d~0#1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~dev~0.offset) (<= my_callbackThread1of1ForFork1_~dev~0.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= (+ my_callbackThread1of1ForFork1_~data~0.offset 24) |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| |my_callbackThread1of1ForFork1_#in~arg.offset|) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), 238#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), my_callbackThread1of1ForFork0InUse, 144#L1712true, my_callbackThread1of1ForFork1InUse, 263#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 89#L1710-1true]) [2022-12-06 16:42:08,498 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-06 16:42:08,498 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 16:42:08,498 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 16:42:08,498 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-06 16:42:08,513 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_7 24))) (and (= |v_#memory_int_29| (store |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 1))) (= (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_17|) (= (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork1_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.offset_17|))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_7, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][193], [214#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), 208#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 297#(and (= 0 |ULTIMATE.start_my_drv_probe_#in~data#1.offset|) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (= |ULTIMATE.start_my_drv_probe_#in~data#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~data#1.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (select |#valid| 4) 1) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_main_~#data~1#1.base|) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|)), 88#L1735true, 138#L1711-1true, 180#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), 354#(and (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~__mptr~0.offset) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~arg.offset) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork1_~dev~0.base |my_callbackThread1of1ForFork0_#in~arg.base|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |ULTIMATE.start_my_drv_probe_~d~0#1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~dev~0.offset) (<= my_callbackThread1of1ForFork1_~dev~0.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= (+ my_callbackThread1of1ForFork1_~data~0.offset 24) |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| |my_callbackThread1of1ForFork1_#in~arg.offset|) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1)), 22#L1711-1true, 238#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), my_callbackThread1of1ForFork0InUse, my_callbackThread1of1ForFork1InUse, 263#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0))]) [2022-12-06 16:42:08,513 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-06 16:42:08,513 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 16:42:08,513 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 16:42:08,513 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-06 16:42:08,638 INFO L130 PetriNetUnfolder]: 2509/5461 cut-off events. [2022-12-06 16:42:08,638 INFO L131 PetriNetUnfolder]: For 16769/17346 co-relation queries the response was YES. [2022-12-06 16:42:08,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20844 conditions, 5461 events. 2509/5461 cut-off events. For 16769/17346 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 41934 event pairs, 382 based on Foata normal form. 48/5298 useless extension candidates. Maximal degree in co-relation 18171. Up to 2013 conditions per place. [2022-12-06 16:42:08,691 INFO L137 encePairwiseOnDemand]: 160/174 looper letters, 306 selfloop transitions, 27 changer transitions 41/504 dead transitions. [2022-12-06 16:42:08,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 504 transitions, 4730 flow [2022-12-06 16:42:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:42:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:42:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1878 transitions. [2022-12-06 16:42:08,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.830238726790451 [2022-12-06 16:42:08,695 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 62 predicate places. [2022-12-06 16:42:08,695 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 504 transitions, 4730 flow [2022-12-06 16:42:08,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:08,696 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:08,696 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:08,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:42:08,696 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash 958597361, now seen corresponding path program 3 times [2022-12-06 16:42:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:08,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478541660] [2022-12-06 16:42:08,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:10,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:10,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478541660] [2022-12-06 16:42:10,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478541660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:10,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:10,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-06 16:42:10,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109661809] [2022-12-06 16:42:10,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:10,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 16:42:10,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:10,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 16:42:10,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-12-06 16:42:10,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 174 [2022-12-06 16:42:10,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 504 transitions, 4730 flow. Second operand has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:10,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:10,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 174 [2022-12-06 16:42:10,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:11,774 INFO L130 PetriNetUnfolder]: 2737/6210 cut-off events. [2022-12-06 16:42:11,775 INFO L131 PetriNetUnfolder]: For 20951/22381 co-relation queries the response was YES. [2022-12-06 16:42:11,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28149 conditions, 6210 events. 2737/6210 cut-off events. For 20951/22381 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 49899 event pairs, 51 based on Foata normal form. 71/6170 useless extension candidates. Maximal degree in co-relation 23755. Up to 2344 conditions per place. [2022-12-06 16:42:11,827 INFO L137 encePairwiseOnDemand]: 141/174 looper letters, 432 selfloop transitions, 135 changer transitions 53/695 dead transitions. [2022-12-06 16:42:11,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 695 transitions, 8350 flow [2022-12-06 16:42:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 16:42:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 16:42:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1766 transitions. [2022-12-06 16:42:11,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48330596606458676 [2022-12-06 16:42:11,835 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 82 predicate places. [2022-12-06 16:42:11,835 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 695 transitions, 8350 flow [2022-12-06 16:42:11,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:11,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:11,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:11,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 16:42:11,836 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:11,836 INFO L85 PathProgramCache]: Analyzing trace with hash 598221115, now seen corresponding path program 4 times [2022-12-06 16:42:11,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:11,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353747080] [2022-12-06 16:42:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:11,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:12,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:12,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353747080] [2022-12-06 16:42:12,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353747080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:12,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:12,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-06 16:42:12,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224747831] [2022-12-06 16:42:12,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:12,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 16:42:12,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:12,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 16:42:12,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-12-06 16:42:12,866 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 174 [2022-12-06 16:42:12,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 695 transitions, 8350 flow. Second operand has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:12,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:12,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 174 [2022-12-06 16:42:12,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:13,767 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L1709-->L1709-1: Formula: (and (= v_my_callbackThread1of1ForFork0_~dev~0.offset_3 v_my_callbackThread1of1ForFork0_~__mptr~0.offset_1) (= v_my_callbackThread1of1ForFork0_~dev~0.base_3 v_my_callbackThread1of1ForFork0_~__mptr~0.base_1)) InVars {my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_3, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_3} OutVars{my_callbackThread1of1ForFork0_~__mptr~0.base=v_my_callbackThread1of1ForFork0_~__mptr~0.base_1, my_callbackThread1of1ForFork0_~__mptr~0.offset=v_my_callbackThread1of1ForFork0_~__mptr~0.offset_1, my_callbackThread1of1ForFork0_~dev~0.base=v_my_callbackThread1of1ForFork0_~dev~0.base_3, my_callbackThread1of1ForFork0_~dev~0.offset=v_my_callbackThread1of1ForFork0_~dev~0.offset_3} AuxVars[] AssignedVars[my_callbackThread1of1ForFork0_~__mptr~0.base, my_callbackThread1of1ForFork0_~__mptr~0.offset][307], [395#(and (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~arg.base) (= my_callbackThread1of1ForFork0_~dev~0.base |ULTIMATE.start_main_~#data~1#1.base|) (= 0 |ULTIMATE.start_my_drv_probe_#in~data#1.offset|) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (= |ULTIMATE.start_my_drv_probe_#in~data#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~data#1.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~__mptr~0.base) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_main_~#data~1#1.base|) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|)), 88#L1735true, 352#(and (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~__mptr~0.offset) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~arg.offset) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork1_~dev~0.base |my_callbackThread1of1ForFork0_#in~arg.base|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| (+ my_callbackThread1of1ForFork1_~data~0.offset 24)) (= |ULTIMATE.start_my_drv_probe_~d~0#1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| my_callbackThread1of1ForFork1_~dev~0.offset) (<= my_callbackThread1of1ForFork1_~dev~0.offset |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= (+ my_callbackThread1of1ForFork1_~data~0.offset 24) |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| |my_callbackThread1of1ForFork1_#in~arg.offset|)), my_callbackThread1of1ForFork0InUse, 263#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), my_callbackThread1of1ForFork1InUse, 150#L1710true, 214#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), 208#(and (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))), 297#(and (= 0 |ULTIMATE.start_my_drv_probe_#in~data#1.offset|) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (= |ULTIMATE.start_my_drv_probe_#in~data#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|)) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~data#1.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (= (select |#valid| 4) 1) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_main_~#data~1#1.base|) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|)), 180#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), 98#L1709-1true, 238#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)), 446#(and (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~arg.base) (= my_callbackThread1of1ForFork0_~dev~0.base |ULTIMATE.start_main_~#data~1#1.base|) (= 0 |ULTIMATE.start_my_drv_probe_#in~data#1.offset|) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (= |ULTIMATE.start_my_drv_probe_#in~data#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~data#1.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= |ULTIMATE.start_main_~#data~1#1.base| my_callbackThread1of1ForFork0_~__mptr~0.base) (= (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|) 1) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_main_~#data~1#1.base|) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|))]) [2022-12-06 16:42:13,768 INFO L382 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-12-06 16:42:13,768 INFO L385 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-12-06 16:42:13,768 INFO L385 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-12-06 16:42:13,768 INFO L385 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-12-06 16:42:14,807 INFO L130 PetriNetUnfolder]: 3059/7229 cut-off events. [2022-12-06 16:42:14,807 INFO L131 PetriNetUnfolder]: For 31474/34307 co-relation queries the response was YES. [2022-12-06 16:42:14,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37815 conditions, 7229 events. 3059/7229 cut-off events. For 31474/34307 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 60808 event pairs, 77 based on Foata normal form. 393/7497 useless extension candidates. Maximal degree in co-relation 30969. Up to 2801 conditions per place. [2022-12-06 16:42:14,856 INFO L137 encePairwiseOnDemand]: 141/174 looper letters, 520 selfloop transitions, 157 changer transitions 67/819 dead transitions. [2022-12-06 16:42:14,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 819 transitions, 11562 flow [2022-12-06 16:42:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 16:42:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 16:42:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1871 transitions. [2022-12-06 16:42:14,858 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4887669801462905 [2022-12-06 16:42:14,859 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 103 predicate places. [2022-12-06 16:42:14,859 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 819 transitions, 11562 flow [2022-12-06 16:42:14,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:14,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:14,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:14,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 16:42:14,860 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1053055211, now seen corresponding path program 5 times [2022-12-06 16:42:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:14,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325606564] [2022-12-06 16:42:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:14,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:14,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:15,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:15,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325606564] [2022-12-06 16:42:15,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325606564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:15,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:15,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-06 16:42:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320529121] [2022-12-06 16:42:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:15,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 16:42:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 16:42:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-12-06 16:42:15,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 174 [2022-12-06 16:42:15,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 819 transitions, 11562 flow. Second operand has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:15,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:15,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 174 [2022-12-06 16:42:15,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:18,240 INFO L130 PetriNetUnfolder]: 3497/8478 cut-off events. [2022-12-06 16:42:18,240 INFO L131 PetriNetUnfolder]: For 45972/49597 co-relation queries the response was YES. [2022-12-06 16:42:18,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49966 conditions, 8478 events. 3497/8478 cut-off events. For 45972/49597 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 74147 event pairs, 92 based on Foata normal form. 453/8795 useless extension candidates. Maximal degree in co-relation 40118. Up to 3342 conditions per place. [2022-12-06 16:42:18,294 INFO L137 encePairwiseOnDemand]: 143/174 looper letters, 694 selfloop transitions, 114 changer transitions 81/964 dead transitions. [2022-12-06 16:42:18,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 964 transitions, 15638 flow [2022-12-06 16:42:18,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 16:42:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 16:42:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1863 transitions. [2022-12-06 16:42:18,297 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48667711598746083 [2022-12-06 16:42:18,297 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 124 predicate places. [2022-12-06 16:42:18,297 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 964 transitions, 15638 flow [2022-12-06 16:42:18,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:18,298 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:18,298 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:18,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 16:42:18,298 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:18,298 INFO L85 PathProgramCache]: Analyzing trace with hash -806337241, now seen corresponding path program 6 times [2022-12-06 16:42:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:18,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816233755] [2022-12-06 16:42:18,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:18,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:18,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:18,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816233755] [2022-12-06 16:42:18,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816233755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:18,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:18,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 16:42:18,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685011579] [2022-12-06 16:42:18,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:18,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:42:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:18,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:42:18,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:42:18,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 174 [2022-12-06 16:42:18,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 964 transitions, 15638 flow. Second operand has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:18,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:18,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 174 [2022-12-06 16:42:18,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:20,735 INFO L130 PetriNetUnfolder]: 3750/9067 cut-off events. [2022-12-06 16:42:20,735 INFO L131 PetriNetUnfolder]: For 59143/63102 co-relation queries the response was YES. [2022-12-06 16:42:20,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58842 conditions, 9067 events. 3750/9067 cut-off events. For 59143/63102 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 80246 event pairs, 69 based on Foata normal form. 465/9413 useless extension candidates. Maximal degree in co-relation 48545. Up to 3606 conditions per place. [2022-12-06 16:42:20,811 INFO L137 encePairwiseOnDemand]: 160/174 looper letters, 889 selfloop transitions, 62 changer transitions 81/1289 dead transitions. [2022-12-06 16:42:20,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 1289 transitions, 22769 flow [2022-12-06 16:42:20,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:42:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:42:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1867 transitions. [2022-12-06 16:42:20,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8253757736516357 [2022-12-06 16:42:20,813 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 136 predicate places. [2022-12-06 16:42:20,813 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 1289 transitions, 22769 flow [2022-12-06 16:42:20,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:20,814 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:20,814 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:20,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 16:42:20,814 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1084327693, now seen corresponding path program 7 times [2022-12-06 16:42:20,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:20,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554620264] [2022-12-06 16:42:20,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:20,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:21,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:21,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554620264] [2022-12-06 16:42:21,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554620264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:21,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:21,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-06 16:42:21,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043933272] [2022-12-06 16:42:21,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:21,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 16:42:21,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:21,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 16:42:21,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-12-06 16:42:21,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 174 [2022-12-06 16:42:21,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 1289 transitions, 22769 flow. Second operand has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:21,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:21,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 174 [2022-12-06 16:42:21,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:24,685 INFO L130 PetriNetUnfolder]: 4358/10656 cut-off events. [2022-12-06 16:42:24,685 INFO L131 PetriNetUnfolder]: For 80898/86144 co-relation queries the response was YES. [2022-12-06 16:42:24,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76206 conditions, 10656 events. 4358/10656 cut-off events. For 80898/86144 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 97672 event pairs, 82 based on Foata normal form. 489/11013 useless extension candidates. Maximal degree in co-relation 62113. Up to 4266 conditions per place. [2022-12-06 16:42:24,761 INFO L137 encePairwiseOnDemand]: 143/174 looper letters, 1182 selfloop transitions, 162 changer transitions 95/1520 dead transitions. [2022-12-06 16:42:24,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 1520 transitions, 29963 flow [2022-12-06 16:42:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 16:42:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 16:42:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1863 transitions. [2022-12-06 16:42:24,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48667711598746083 [2022-12-06 16:42:24,764 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 157 predicate places. [2022-12-06 16:42:24,764 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 1520 transitions, 29963 flow [2022-12-06 16:42:24,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:24,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:24,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:24,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 16:42:24,765 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:24,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash -65482027, now seen corresponding path program 8 times [2022-12-06 16:42:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:24,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82173246] [2022-12-06 16:42:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:25,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82173246] [2022-12-06 16:42:25,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82173246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:25,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:25,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-06 16:42:25,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022621956] [2022-12-06 16:42:25,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:25,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 16:42:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 16:42:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-12-06 16:42:25,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 174 [2022-12-06 16:42:25,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 1520 transitions, 29963 flow. Second operand has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:25,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:25,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 174 [2022-12-06 16:42:25,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:28,849 INFO L130 PetriNetUnfolder]: 4403/10854 cut-off events. [2022-12-06 16:42:28,849 INFO L131 PetriNetUnfolder]: For 96617/103162 co-relation queries the response was YES. [2022-12-06 16:42:28,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85073 conditions, 10854 events. 4403/10854 cut-off events. For 96617/103162 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 99774 event pairs, 98 based on Foata normal form. 501/11207 useless extension candidates. Maximal degree in co-relation 68511. Up to 4328 conditions per place. [2022-12-06 16:42:28,930 INFO L137 encePairwiseOnDemand]: 143/174 looper letters, 1235 selfloop transitions, 144 changer transitions 109/1569 dead transitions. [2022-12-06 16:42:28,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1569 transitions, 33889 flow [2022-12-06 16:42:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 16:42:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 16:42:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1863 transitions. [2022-12-06 16:42:28,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48667711598746083 [2022-12-06 16:42:28,933 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 178 predicate places. [2022-12-06 16:42:28,933 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 1569 transitions, 33889 flow [2022-12-06 16:42:28,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:28,934 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:28,934 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:28,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 16:42:28,934 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:28,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1946423669, now seen corresponding path program 9 times [2022-12-06 16:42:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:28,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167121920] [2022-12-06 16:42:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:29,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167121920] [2022-12-06 16:42:29,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167121920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:29,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:29,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 16:42:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542355183] [2022-12-06 16:42:29,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:29,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:42:29,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:29,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:42:29,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:42:29,383 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 174 [2022-12-06 16:42:29,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 1569 transitions, 33889 flow. Second operand has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:29,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:29,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 174 [2022-12-06 16:42:29,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:33,314 INFO L130 PetriNetUnfolder]: 5665/14638 cut-off events. [2022-12-06 16:42:33,315 INFO L131 PetriNetUnfolder]: For 156371/165883 co-relation queries the response was YES. [2022-12-06 16:42:33,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124193 conditions, 14638 events. 5665/14638 cut-off events. For 156371/165883 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 146332 event pairs, 113 based on Foata normal form. 988/15430 useless extension candidates. Maximal degree in co-relation 96299. Up to 6098 conditions per place. [2022-12-06 16:42:33,420 INFO L137 encePairwiseOnDemand]: 160/174 looper letters, 1413 selfloop transitions, 95 changer transitions 109/1944 dead transitions. [2022-12-06 16:42:33,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 1944 transitions, 45927 flow [2022-12-06 16:42:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:42:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:42:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1878 transitions. [2022-12-06 16:42:33,422 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.830238726790451 [2022-12-06 16:42:33,422 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 190 predicate places. [2022-12-06 16:42:33,422 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 1944 transitions, 45927 flow [2022-12-06 16:42:33,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:33,423 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:33,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:33,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 16:42:33,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:33,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash 120290971, now seen corresponding path program 10 times [2022-12-06 16:42:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:33,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629657645] [2022-12-06 16:42:33,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:33,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:33,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629657645] [2022-12-06 16:42:33,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629657645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:33,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:33,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 16:42:33,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680325719] [2022-12-06 16:42:33,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:33,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:42:33,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:33,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:42:33,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:42:33,843 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 174 [2022-12-06 16:42:33,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 1944 transitions, 45927 flow. Second operand has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:33,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:33,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 174 [2022-12-06 16:42:33,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:38,667 INFO L130 PetriNetUnfolder]: 5952/15161 cut-off events. [2022-12-06 16:42:38,667 INFO L131 PetriNetUnfolder]: For 178869/192778 co-relation queries the response was YES. [2022-12-06 16:42:38,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137856 conditions, 15161 events. 5952/15161 cut-off events. For 178869/192778 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 151448 event pairs, 130 based on Foata normal form. 901/15863 useless extension candidates. Maximal degree in co-relation 108989. Up to 6359 conditions per place. [2022-12-06 16:42:38,784 INFO L137 encePairwiseOnDemand]: 160/174 looper letters, 1526 selfloop transitions, 56 changer transitions 109/2018 dead transitions. [2022-12-06 16:42:38,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 2018 transitions, 50955 flow [2022-12-06 16:42:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:42:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:42:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1878 transitions. [2022-12-06 16:42:38,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.830238726790451 [2022-12-06 16:42:38,787 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 202 predicate places. [2022-12-06 16:42:38,787 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 2018 transitions, 50955 flow [2022-12-06 16:42:38,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:38,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:38,788 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:38,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 16:42:38,788 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash 991017685, now seen corresponding path program 11 times [2022-12-06 16:42:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:38,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483479497] [2022-12-06 16:42:38,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:39,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:39,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483479497] [2022-12-06 16:42:39,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483479497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:39,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:39,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 16:42:39,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318349439] [2022-12-06 16:42:39,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:39,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:42:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:39,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:42:39,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:42:39,378 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 174 [2022-12-06 16:42:39,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 2018 transitions, 50955 flow. Second operand has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:39,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:39,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 174 [2022-12-06 16:42:39,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:44,407 INFO L130 PetriNetUnfolder]: 6117/15464 cut-off events. [2022-12-06 16:42:44,408 INFO L131 PetriNetUnfolder]: For 205652/223917 co-relation queries the response was YES. [2022-12-06 16:42:44,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150392 conditions, 15464 events. 6117/15464 cut-off events. For 205652/223917 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 154843 event pairs, 104 based on Foata normal form. 921/16187 useless extension candidates. Maximal degree in co-relation 120534. Up to 6510 conditions per place. [2022-12-06 16:42:44,527 INFO L137 encePairwiseOnDemand]: 160/174 looper letters, 1586 selfloop transitions, 57 changer transitions 109/2079 dead transitions. [2022-12-06 16:42:44,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 2079 transitions, 55907 flow [2022-12-06 16:42:44,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:42:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:42:44,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1878 transitions. [2022-12-06 16:42:44,537 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.830238726790451 [2022-12-06 16:42:44,538 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 214 predicate places. [2022-12-06 16:42:44,538 INFO L495 AbstractCegarLoop]: Abstraction has has 376 places, 2079 transitions, 55907 flow [2022-12-06 16:42:44,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:44,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:44,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:44,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 16:42:44,539 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:44,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash 75473973, now seen corresponding path program 12 times [2022-12-06 16:42:44,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:44,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165057207] [2022-12-06 16:42:44,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:45,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:45,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165057207] [2022-12-06 16:42:45,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165057207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:45,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:45,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 16:42:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732607304] [2022-12-06 16:42:45,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:45,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:42:45,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:45,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:42:45,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:42:45,160 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 174 [2022-12-06 16:42:45,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 2079 transitions, 55907 flow. Second operand has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:45,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:45,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 174 [2022-12-06 16:42:45,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:50,473 INFO L130 PetriNetUnfolder]: 6245/15735 cut-off events. [2022-12-06 16:42:50,474 INFO L131 PetriNetUnfolder]: For 236227/256061 co-relation queries the response was YES. [2022-12-06 16:42:50,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162098 conditions, 15735 events. 6245/15735 cut-off events. For 236227/256061 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 157712 event pairs, 121 based on Foata normal form. 889/16418 useless extension candidates. Maximal degree in co-relation 131253. Up to 6656 conditions per place. [2022-12-06 16:42:50,598 INFO L137 encePairwiseOnDemand]: 160/174 looper letters, 1620 selfloop transitions, 63 changer transitions 109/2119 dead transitions. [2022-12-06 16:42:50,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 2119 transitions, 60473 flow [2022-12-06 16:42:50,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:42:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:42:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1877 transitions. [2022-12-06 16:42:50,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8297966401414677 [2022-12-06 16:42:50,620 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 226 predicate places. [2022-12-06 16:42:50,620 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 2119 transitions, 60473 flow [2022-12-06 16:42:50,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:42:50,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:50,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:50,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 16:42:50,621 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:50,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1209322651, now seen corresponding path program 13 times [2022-12-06 16:42:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:50,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221559963] [2022-12-06 16:42:50,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:51,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:51,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:51,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221559963] [2022-12-06 16:42:51,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221559963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:51,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:51,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 16:42:51,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378356007] [2022-12-06 16:42:51,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:51,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 16:42:51,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:51,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 16:42:51,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-12-06 16:42:51,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 174 [2022-12-06 16:42:51,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 2119 transitions, 60473 flow. Second operand has 14 states, 14 states have (on average 128.5) internal successors, (1799), 14 states have internal predecessors, (1799), 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) [2022-12-06 16:42:51,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:51,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 174 [2022-12-06 16:42:51,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:42:56,469 INFO L130 PetriNetUnfolder]: 5636/14057 cut-off events. [2022-12-06 16:42:56,469 INFO L131 PetriNetUnfolder]: For 222445/238862 co-relation queries the response was YES. [2022-12-06 16:42:56,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152582 conditions, 14057 events. 5636/14057 cut-off events. For 222445/238862 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 136335 event pairs, 98 based on Foata normal form. 478/14311 useless extension candidates. Maximal degree in co-relation 125303. Up to 5660 conditions per place. [2022-12-06 16:42:56,587 INFO L137 encePairwiseOnDemand]: 159/174 looper letters, 1533 selfloop transitions, 85 changer transitions 109/2031 dead transitions. [2022-12-06 16:42:56,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 2031 transitions, 60135 flow [2022-12-06 16:42:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:42:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:42:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2152 transitions. [2022-12-06 16:42:56,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7729885057471264 [2022-12-06 16:42:56,589 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 241 predicate places. [2022-12-06 16:42:56,590 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 2031 transitions, 60135 flow [2022-12-06 16:42:56,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 128.5) internal successors, (1799), 14 states have internal predecessors, (1799), 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) [2022-12-06 16:42:56,590 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:42:56,590 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:42:56,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 16:42:56,590 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:42:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:42:56,591 INFO L85 PathProgramCache]: Analyzing trace with hash -517655177, now seen corresponding path program 14 times [2022-12-06 16:42:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:42:56,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314788305] [2022-12-06 16:42:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:42:56,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:42:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:42:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:42:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:42:57,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314788305] [2022-12-06 16:42:57,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314788305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:42:57,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:42:57,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-06 16:42:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116820464] [2022-12-06 16:42:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:42:57,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 16:42:57,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:42:57,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 16:42:57,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-12-06 16:42:57,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 174 [2022-12-06 16:42:57,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 2031 transitions, 60135 flow. Second operand has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:42:57,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:42:57,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 174 [2022-12-06 16:42:57,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:43:04,548 INFO L130 PetriNetUnfolder]: 8581/20410 cut-off events. [2022-12-06 16:43:04,549 INFO L131 PetriNetUnfolder]: For 357234/380102 co-relation queries the response was YES. [2022-12-06 16:43:04,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236045 conditions, 20410 events. 8581/20410 cut-off events. For 357234/380102 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 207453 event pairs, 71 based on Foata normal form. 86/20337 useless extension candidates. Maximal degree in co-relation 190243. Up to 8922 conditions per place. [2022-12-06 16:43:04,739 INFO L137 encePairwiseOnDemand]: 141/174 looper letters, 1967 selfloop transitions, 421 changer transitions 121/3056 dead transitions. [2022-12-06 16:43:04,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 3056 transitions, 97161 flow [2022-12-06 16:43:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 16:43:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 16:43:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1758 transitions. [2022-12-06 16:43:04,742 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48111658456486045 [2022-12-06 16:43:04,742 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 261 predicate places. [2022-12-06 16:43:04,743 INFO L495 AbstractCegarLoop]: Abstraction has has 423 places, 3056 transitions, 97161 flow [2022-12-06 16:43:04,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:43:04,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:43:04,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:43:04,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 16:43:04,743 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:43:04,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:43:04,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1748638979, now seen corresponding path program 15 times [2022-12-06 16:43:04,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:43:04,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240263979] [2022-12-06 16:43:04,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:43:04,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:43:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:43:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:43:06,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:43:06,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240263979] [2022-12-06 16:43:06,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240263979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:43:06,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:43:06,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-12-06 16:43:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849894440] [2022-12-06 16:43:06,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:43:06,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 16:43:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:43:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 16:43:06,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2022-12-06 16:43:06,315 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 174 [2022-12-06 16:43:06,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 3056 transitions, 97161 flow. Second operand has 30 states, 30 states have (on average 69.3) internal successors, (2079), 30 states have internal predecessors, (2079), 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) [2022-12-06 16:43:06,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:43:06,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 174 [2022-12-06 16:43:06,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:43:28,098 INFO L130 PetriNetUnfolder]: 10744/27838 cut-off events. [2022-12-06 16:43:28,098 INFO L131 PetriNetUnfolder]: For 522701/571063 co-relation queries the response was YES. [2022-12-06 16:43:28,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333998 conditions, 27838 events. 10744/27838 cut-off events. For 522701/571063 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 308392 event pairs, 151 based on Foata normal form. 626/28262 useless extension candidates. Maximal degree in co-relation 256704. Up to 12113 conditions per place. [2022-12-06 16:43:28,356 INFO L137 encePairwiseOnDemand]: 130/174 looper letters, 3964 selfloop transitions, 886 changer transitions 307/5206 dead transitions. [2022-12-06 16:43:28,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 5206 transitions, 169130 flow [2022-12-06 16:43:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-06 16:43:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-12-06 16:43:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 4458 transitions. [2022-12-06 16:43:28,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4342489772063121 [2022-12-06 16:43:28,367 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 319 predicate places. [2022-12-06 16:43:28,367 INFO L495 AbstractCegarLoop]: Abstraction has has 481 places, 5206 transitions, 169130 flow [2022-12-06 16:43:28,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 69.3) internal successors, (2079), 30 states have internal predecessors, (2079), 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) [2022-12-06 16:43:28,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:43:28,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:43:28,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 16:43:28,369 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:43:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:43:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash 366849425, now seen corresponding path program 16 times [2022-12-06 16:43:28,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:43:28,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669055340] [2022-12-06 16:43:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:43:28,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:43:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:43:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:43:29,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:43:29,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669055340] [2022-12-06 16:43:29,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669055340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:43:29,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:43:29,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-12-06 16:43:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115931459] [2022-12-06 16:43:29,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:43:29,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 16:43:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:43:29,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 16:43:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-12-06 16:43:29,216 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 174 [2022-12-06 16:43:29,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 5206 transitions, 169130 flow. Second operand has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:43:29,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:43:29,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 174 [2022-12-06 16:43:29,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:44:00,209 INFO L130 PetriNetUnfolder]: 13090/35034 cut-off events. [2022-12-06 16:44:00,209 INFO L131 PetriNetUnfolder]: For 758472/792527 co-relation queries the response was YES. [2022-12-06 16:44:00,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436917 conditions, 35034 events. 13090/35034 cut-off events. For 758472/792527 co-relation queries the response was YES. Maximal size of possible extension queue 1349. Compared 409382 event pairs, 120 based on Foata normal form. 223/35015 useless extension candidates. Maximal degree in co-relation 330578. Up to 15249 conditions per place. [2022-12-06 16:44:00,529 INFO L137 encePairwiseOnDemand]: 143/174 looper letters, 4378 selfloop transitions, 447 changer transitions 387/6253 dead transitions. [2022-12-06 16:44:00,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 6253 transitions, 215198 flow [2022-12-06 16:44:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 16:44:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 16:44:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1857 transitions. [2022-12-06 16:44:00,532 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48510971786833856 [2022-12-06 16:44:00,532 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 340 predicate places. [2022-12-06 16:44:00,533 INFO L495 AbstractCegarLoop]: Abstraction has has 502 places, 6253 transitions, 215198 flow [2022-12-06 16:44:00,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 78.21052631578948) internal successors, (1486), 19 states have internal predecessors, (1486), 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) [2022-12-06 16:44:00,533 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:44:00,533 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:44:00,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 16:44:00,533 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:44:00,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:44:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash -4929769, now seen corresponding path program 17 times [2022-12-06 16:44:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:44:00,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114652835] [2022-12-06 16:44:00,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:44:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:44:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:44:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:44:01,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:44:01,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114652835] [2022-12-06 16:44:01,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114652835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:44:01,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:44:01,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 16:44:01,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194721126] [2022-12-06 16:44:01,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:44:01,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 16:44:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:44:01,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 16:44:01,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-12-06 16:44:01,019 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 174 [2022-12-06 16:44:01,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 6253 transitions, 215198 flow. Second operand has 14 states, 14 states have (on average 128.5) internal successors, (1799), 14 states have internal predecessors, (1799), 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) [2022-12-06 16:44:01,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:44:01,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 174 [2022-12-06 16:44:01,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:44:57,427 INFO L130 PetriNetUnfolder]: 16574/45147 cut-off events. [2022-12-06 16:44:57,427 INFO L131 PetriNetUnfolder]: For 1068217/1106926 co-relation queries the response was YES. [2022-12-06 16:44:57,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585152 conditions, 45147 events. 16574/45147 cut-off events. For 1068217/1106926 co-relation queries the response was YES. Maximal size of possible extension queue 1828. Compared 556238 event pairs, 211 based on Foata normal form. 298/45141 useless extension candidates. Maximal degree in co-relation 434690. Up to 19925 conditions per place. [2022-12-06 16:44:57,847 INFO L137 encePairwiseOnDemand]: 158/174 looper letters, 5065 selfloop transitions, 532 changer transitions 387/7689 dead transitions. [2022-12-06 16:44:57,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 7689 transitions, 281176 flow [2022-12-06 16:44:57,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 16:44:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 16:44:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2158 transitions. [2022-12-06 16:44:57,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7751436781609196 [2022-12-06 16:44:57,851 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 355 predicate places. [2022-12-06 16:44:57,851 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 7689 transitions, 281176 flow [2022-12-06 16:44:57,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 128.5) internal successors, (1799), 14 states have internal predecessors, (1799), 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) [2022-12-06 16:44:57,856 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:44:57,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:44:57,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 16:44:57,856 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:44:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:44:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash -160221163, now seen corresponding path program 18 times [2022-12-06 16:44:57,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:44:57,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978865653] [2022-12-06 16:44:57,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:44:57,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:44:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:44:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:44:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:44:58,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978865653] [2022-12-06 16:44:58,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978865653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:44:58,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:44:58,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 16:44:58,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176477232] [2022-12-06 16:44:58,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:44:58,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:44:58,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:44:58,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:44:58,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:44:58,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 174 [2022-12-06 16:44:58,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 7689 transitions, 281176 flow. Second operand has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:44:58,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:44:58,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 174 [2022-12-06 16:44:58,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:46:38,112 INFO L130 PetriNetUnfolder]: 18428/50435 cut-off events. [2022-12-06 16:46:38,113 INFO L131 PetriNetUnfolder]: For 1296302/1348238 co-relation queries the response was YES. [2022-12-06 16:46:38,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679633 conditions, 50435 events. 18428/50435 cut-off events. For 1296302/1348238 co-relation queries the response was YES. Maximal size of possible extension queue 2089. Compared 634918 event pairs, 239 based on Foata normal form. 303/50393 useless extension candidates. Maximal degree in co-relation 503901. Up to 22435 conditions per place. [2022-12-06 16:46:38,589 INFO L137 encePairwiseOnDemand]: 160/174 looper letters, 5946 selfloop transitions, 194 changer transitions 387/8417 dead transitions. [2022-12-06 16:46:38,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 8417 transitions, 323178 flow [2022-12-06 16:46:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:46:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:46:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1884 transitions. [2022-12-06 16:46:38,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8328912466843501 [2022-12-06 16:46:38,591 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 367 predicate places. [2022-12-06 16:46:38,591 INFO L495 AbstractCegarLoop]: Abstraction has has 529 places, 8417 transitions, 323178 flow [2022-12-06 16:46:38,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:46:38,591 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:46:38,591 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:46:38,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 16:46:38,591 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:46:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:46:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1825896871, now seen corresponding path program 19 times [2022-12-06 16:46:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:46:38,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330267907] [2022-12-06 16:46:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:46:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:46:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:46:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:46:38,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:46:38,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330267907] [2022-12-06 16:46:38,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330267907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:46:38,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:46:38,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 16:46:38,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356208485] [2022-12-06 16:46:38,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:46:38,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:46:38,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:46:38,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:46:38,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:46:38,967 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 174 [2022-12-06 16:46:38,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 8417 transitions, 323178 flow. Second operand has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:46:38,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:46:38,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 174 [2022-12-06 16:46:38,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:48:38,585 INFO L130 PetriNetUnfolder]: 19880/55014 cut-off events. [2022-12-06 16:48:38,585 INFO L131 PetriNetUnfolder]: For 1552188/1610170 co-relation queries the response was YES. [2022-12-06 16:48:38,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767738 conditions, 55014 events. 19880/55014 cut-off events. For 1552188/1610170 co-relation queries the response was YES. Maximal size of possible extension queue 2339. Compared 707435 event pairs, 255 based on Foata normal form. 407/55043 useless extension candidates. Maximal degree in co-relation 567249. Up to 24671 conditions per place. [2022-12-06 16:48:39,238 INFO L137 encePairwiseOnDemand]: 160/174 looper letters, 6520 selfloop transitions, 237 changer transitions 387/9034 dead transitions. [2022-12-06 16:48:39,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 9034 transitions, 363532 flow [2022-12-06 16:48:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:48:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:48:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1892 transitions. [2022-12-06 16:48:39,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8364279398762158 [2022-12-06 16:48:39,241 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 379 predicate places. [2022-12-06 16:48:39,241 INFO L495 AbstractCegarLoop]: Abstraction has has 541 places, 9034 transitions, 363532 flow [2022-12-06 16:48:39,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:48:39,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:48:39,241 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:48:39,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 16:48:39,241 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:48:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:48:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1294151701, now seen corresponding path program 20 times [2022-12-06 16:48:39,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:48:39,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965738300] [2022-12-06 16:48:39,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:48:39,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:48:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:48:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:48:39,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:48:39,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965738300] [2022-12-06 16:48:39,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965738300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:48:39,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:48:39,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 16:48:39,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755072467] [2022-12-06 16:48:39,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:48:39,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 16:48:39,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:48:39,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 16:48:39,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-12-06 16:48:39,713 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 174 [2022-12-06 16:48:39,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 9034 transitions, 363532 flow. Second operand has 14 states, 14 states have (on average 128.5) internal successors, (1799), 14 states have internal predecessors, (1799), 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) [2022-12-06 16:48:39,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:48:39,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 174 [2022-12-06 16:48:39,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:51:13,104 INFO L130 PetriNetUnfolder]: 22113/61105 cut-off events. [2022-12-06 16:51:13,104 INFO L131 PetriNetUnfolder]: For 1863092/1960279 co-relation queries the response was YES. [2022-12-06 16:51:13,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885847 conditions, 61105 events. 22113/61105 cut-off events. For 1863092/1960279 co-relation queries the response was YES. Maximal size of possible extension queue 2619. Compared 797489 event pairs, 280 based on Foata normal form. 350/61022 useless extension candidates. Maximal degree in co-relation 655654. Up to 27544 conditions per place. [2022-12-06 16:51:13,697 INFO L137 encePairwiseOnDemand]: 158/174 looper letters, 7434 selfloop transitions, 398 changer transitions 387/9924 dead transitions. [2022-12-06 16:51:13,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 9924 transitions, 417825 flow [2022-12-06 16:51:13,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 16:51:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 16:51:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2293 transitions. [2022-12-06 16:51:13,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7751859364435429 [2022-12-06 16:51:13,699 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 395 predicate places. [2022-12-06 16:51:13,699 INFO L495 AbstractCegarLoop]: Abstraction has has 557 places, 9924 transitions, 417825 flow [2022-12-06 16:51:13,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 128.5) internal successors, (1799), 14 states have internal predecessors, (1799), 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) [2022-12-06 16:51:13,700 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:51:13,700 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:51:13,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 16:51:13,700 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:51:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:51:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1691471079, now seen corresponding path program 21 times [2022-12-06 16:51:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:51:13,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994749009] [2022-12-06 16:51:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:51:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:51:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:51:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:51:14,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:51:14,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994749009] [2022-12-06 16:51:14,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994749009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:51:14,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:51:14,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-06 16:51:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429073472] [2022-12-06 16:51:14,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:51:14,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 16:51:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:51:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 16:51:14,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-12-06 16:51:14,137 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 174 [2022-12-06 16:51:14,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 9924 transitions, 417825 flow. Second operand has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:51:14,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:51:14,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 174 [2022-12-06 16:51:14,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:54:25,237 INFO L130 PetriNetUnfolder]: 22187/61207 cut-off events. [2022-12-06 16:54:25,238 INFO L131 PetriNetUnfolder]: For 2020856/2118237 co-relation queries the response was YES. [2022-12-06 16:54:25,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919177 conditions, 61207 events. 22187/61207 cut-off events. For 2020856/2118237 co-relation queries the response was YES. Maximal size of possible extension queue 2608. Compared 798131 event pairs, 281 based on Foata normal form. 353/61129 useless extension candidates. Maximal degree in co-relation 684257. Up to 27605 conditions per place. [2022-12-06 16:54:25,874 INFO L137 encePairwiseOnDemand]: 160/174 looper letters, 7487 selfloop transitions, 157 changer transitions 387/9972 dead transitions. [2022-12-06 16:54:25,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 9972 transitions, 435204 flow [2022-12-06 16:54:25,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:54:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:54:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1893 transitions. [2022-12-06 16:54:25,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8368700265251989 [2022-12-06 16:54:25,876 INFO L294 CegarLoopForPetriNet]: 162 programPoint places, 407 predicate places. [2022-12-06 16:54:25,876 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 9972 transitions, 435204 flow [2022-12-06 16:54:25,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 137.07692307692307) internal successors, (1782), 13 states have internal predecessors, (1782), 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) [2022-12-06 16:54:25,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:54:25,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:54:25,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 16:54:25,877 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 16:54:25,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:54:25,877 INFO L85 PathProgramCache]: Analyzing trace with hash 934828875, now seen corresponding path program 22 times [2022-12-06 16:54:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:54:25,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97922142] [2022-12-06 16:54:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:54:25,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:54:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:54:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 16:54:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:54:26,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97922142] [2022-12-06 16:54:26,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97922142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:54:26,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:54:26,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-06 16:54:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136467885] [2022-12-06 16:54:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:54:26,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 16:54:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:54:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 16:54:26,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-12-06 16:54:26,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 174 [2022-12-06 16:54:26,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 9972 transitions, 435204 flow. Second operand has 14 states, 14 states have (on average 128.5) internal successors, (1799), 14 states have internal predecessors, (1799), 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) [2022-12-06 16:54:26,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:54:26,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 174 [2022-12-06 16:54:26,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 16:55:52,638 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 16:55:52,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 16:55:52,734 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-06 16:55:52,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 16:55:52,734 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 126/174 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 437262 conditions, 24660 events (12022/24659 cut-off events. For 845180/930700 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 273175 event pairs, 106 based on Foata normal form. 246/26557 useless extension candidates. Maximal degree in co-relation 434270. Up to 11771 conditions per place.). [2022-12-06 16:55:52,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-06 16:55:52,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-06 16:55:52,735 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-06 16:55:52,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-06 16:55:52,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-06 16:55:52,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-06 16:55:52,736 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-06 16:55:52,736 INFO L458 BasicCegarLoop]: Path program histogram: [22, 1, 1, 1, 1, 1] [2022-12-06 16:55:52,739 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:55:52,740 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:55:52,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:55:52 BasicIcfg [2022-12-06 16:55:52,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:55:52,742 INFO L158 Benchmark]: Toolchain (without parser) took 833581.86ms. Allocated memory was 201.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 174.0MB in the beginning and 572.3MB in the end (delta: -398.3MB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-06 16:55:52,743 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 177.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:55:52,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.71ms. Allocated memory is still 201.3MB. Free memory was 174.0MB in the beginning and 117.4MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-12-06 16:55:52,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.73ms. Allocated memory is still 201.3MB. Free memory was 117.4MB in the beginning and 114.0MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 16:55:52,743 INFO L158 Benchmark]: Boogie Preprocessor took 39.55ms. Allocated memory is still 201.3MB. Free memory was 114.0MB in the beginning and 111.1MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 16:55:52,743 INFO L158 Benchmark]: RCFGBuilder took 453.04ms. Allocated memory is still 201.3MB. Free memory was 111.1MB in the beginning and 87.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 16:55:52,743 INFO L158 Benchmark]: TraceAbstraction took 832385.56ms. Allocated memory was 201.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 86.5MB in the beginning and 572.3MB in the end (delta: -485.8MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-06 16:55:52,745 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 201.3MB. Free memory is still 177.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 646.71ms. Allocated memory is still 201.3MB. Free memory was 174.0MB in the beginning and 117.4MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.73ms. Allocated memory is still 201.3MB. Free memory was 117.4MB in the beginning and 114.0MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.55ms. Allocated memory is still 201.3MB. Free memory was 114.0MB in the beginning and 111.1MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 453.04ms. Allocated memory is still 201.3MB. Free memory was 111.1MB in the beginning and 87.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 832385.56ms. Allocated memory was 201.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 86.5MB in the beginning and 572.3MB in the end (delta: -485.8MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1693]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 126/174 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 437262 conditions, 24660 events (12022/24659 cut-off events. For 845180/930700 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 273175 event pairs, 106 based on Foata normal form. 246/26557 useless extension candidates. Maximal degree in co-relation 434270. Up to 11771 conditions per place.). - TimeoutResultAtElement [Line: 1693]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 126/174 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 437262 conditions, 24660 events (12022/24659 cut-off events. For 845180/930700 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 273175 event pairs, 106 based on Foata normal form. 246/26557 useless extension candidates. Maximal degree in co-relation 434270. Up to 11771 conditions per place.). - TimeoutResultAtElement [Line: 1693]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 126/174 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 437262 conditions, 24660 events (12022/24659 cut-off events. For 845180/930700 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 273175 event pairs, 106 based on Foata normal form. 246/26557 useless extension candidates. Maximal degree in co-relation 434270. Up to 11771 conditions per place.). - TimeoutResultAtElement [Line: 1693]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 126/174 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 437262 conditions, 24660 events (12022/24659 cut-off events. For 845180/930700 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 273175 event pairs, 106 based on Foata normal form. 246/26557 useless extension candidates. Maximal degree in co-relation 434270. Up to 11771 conditions per place.). - TimeoutResultAtElement [Line: 1693]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 126/174 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 437262 conditions, 24660 events (12022/24659 cut-off events. For 845180/930700 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 273175 event pairs, 106 based on Foata normal form. 246/26557 useless extension candidates. Maximal degree in co-relation 434270. Up to 11771 conditions per place.). - TimeoutResultAtElement [Line: 1693]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 126/174 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 437262 conditions, 24660 events (12022/24659 cut-off events. For 845180/930700 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 273175 event pairs, 106 based on Foata normal form. 246/26557 useless extension candidates. Maximal degree in co-relation 434270. Up to 11771 conditions per place.). - TimeoutResultAtElement [Line: 1727]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 126/174 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 437262 conditions, 24660 events (12022/24659 cut-off events. For 845180/930700 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 273175 event pairs, 106 based on Foata normal form. 246/26557 useless extension candidates. Maximal degree in co-relation 434270. Up to 11771 conditions per place.). - TimeoutResultAtElement [Line: 1726]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 126/174 universal loopers) in iteration 27,while PetriNetUnfolder was constructing finite prefix that currently has 437262 conditions, 24660 events (12022/24659 cut-off events. For 845180/930700 co-relation queries the response was YES. Maximal size of possible extension queue 1867. Compared 273175 event pairs, 106 based on Foata normal form. 246/26557 useless extension candidates. Maximal degree in co-relation 434270. Up to 11771 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 183 locations, 8 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: 832.3s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 22, EmptinessCheckTime: 0.0s, AutomataDifference: 814.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9840 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9840 mSDsluCounter, 13461 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11479 mSDsCounter, 422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13671 IncrementalHoareTripleChecker+Invalid, 14093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 422 mSolverCounterUnsat, 1982 mSDtfsCounter, 13671 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 696 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2844 ImplicationChecksByTransitivity, 20.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=435204occurred in iteration=26, InterpolantAutomatonStates: 453, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 2874 NumberOfCodeBlocks, 2874 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2847 ConstructedInterpolants, 0 QuantifiedInterpolants, 22781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown