./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-2_1-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fddded73cca9ade55587111b2e2c843e75dd81397929514bda88fadfc663c7db --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 02:52:38,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 02:52:38,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 02:52:38,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 02:52:38,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 02:52:38,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 02:52:38,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 02:52:38,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 02:52:38,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 02:52:38,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 02:52:38,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 02:52:38,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 02:52:38,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 02:52:38,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 02:52:38,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 02:52:38,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 02:52:38,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 02:52:38,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 02:52:38,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 02:52:38,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 02:52:38,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 02:52:38,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 02:52:38,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 02:52:38,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 02:52:38,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 02:52:38,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 02:52:38,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 02:52:38,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 02:52:38,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 02:52:38,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 02:52:38,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 02:52:38,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 02:52:38,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 02:52:38,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 02:52:38,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 02:52:38,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 02:52:38,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 02:52:38,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 02:52:38,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 02:52:38,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 02:52:38,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 02:52:38,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-16 02:52:38,887 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 02:52:38,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 02:52:38,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 02:52:38,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 02:52:38,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 02:52:38,888 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 02:52:38,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 02:52:38,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 02:52:38,889 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 02:52:38,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 02:52:38,890 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 02:52:38,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 02:52:38,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 02:52:38,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 02:52:38,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-16 02:52:38,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 02:52:38,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-16 02:52:38,891 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 02:52:38,891 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 02:52:38,891 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 02:52:38,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-16 02:52:38,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 02:52:38,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 02:52:38,892 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 02:52:38,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:52:38,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 02:52:38,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 02:52:38,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-16 02:52:38,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 02:52:38,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 02:52:38,893 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-16 02:52:38,893 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-16 02:52:38,893 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-16 02:52:38,893 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 02:52:38,893 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fddded73cca9ade55587111b2e2c843e75dd81397929514bda88fadfc663c7db [2021-12-16 02:52:39,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 02:52:39,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 02:52:39,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 02:52:39,107 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 02:52:39,107 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 02:52:39,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2021-12-16 02:52:39,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3bfcbd56/ae7bc44244ab4b7a85dfd39e13177d42/FLAG95869905a [2021-12-16 02:52:39,608 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 02:52:39,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i [2021-12-16 02:52:39,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3bfcbd56/ae7bc44244ab4b7a85dfd39e13177d42/FLAG95869905a [2021-12-16 02:52:39,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3bfcbd56/ae7bc44244ab4b7a85dfd39e13177d42 [2021-12-16 02:52:39,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 02:52:39,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 02:52:39,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 02:52:39,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 02:52:39,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 02:52:39,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:52:39" (1/1) ... [2021-12-16 02:52:39,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aacca71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:39, skipping insertion in model container [2021-12-16 02:52:39,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:52:39" (1/1) ... [2021-12-16 02:52:39,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 02:52:39,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 02:52:40,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] [2021-12-16 02:52:40,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:52:40,328 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 02:52:40,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_1-container_of.i[76077,76090] [2021-12-16 02:52:40,379 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 02:52:40,453 INFO L208 MainTranslator]: Completed translation [2021-12-16 02:52:40,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40 WrapperNode [2021-12-16 02:52:40,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 02:52:40,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 02:52:40,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 02:52:40,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 02:52:40,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (1/1) ... [2021-12-16 02:52:40,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (1/1) ... [2021-12-16 02:52:40,517 INFO L137 Inliner]: procedures = 482, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 133 [2021-12-16 02:52:40,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 02:52:40,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 02:52:40,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 02:52:40,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 02:52:40,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (1/1) ... [2021-12-16 02:52:40,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (1/1) ... [2021-12-16 02:52:40,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (1/1) ... [2021-12-16 02:52:40,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (1/1) ... [2021-12-16 02:52:40,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (1/1) ... [2021-12-16 02:52:40,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (1/1) ... [2021-12-16 02:52:40,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (1/1) ... [2021-12-16 02:52:40,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 02:52:40,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 02:52:40,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 02:52:40,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 02:52:40,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (1/1) ... [2021-12-16 02:52:40,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 02:52:40,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 02:52:40,593 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) [2021-12-16 02:52:40,600 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 [2021-12-16 02:52:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 02:52:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 02:52:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-12-16 02:52:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 02:52:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 02:52:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 02:52:40,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 02:52:40,624 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-12-16 02:52:40,625 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-12-16 02:52:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 02:52:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 02:52:40,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 02:52:40,626 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-16 02:52:40,813 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 02:52:40,814 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 02:52:41,017 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 02:52:41,024 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 02:52:41,033 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-16 02:52:41,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:52:41 BoogieIcfgContainer [2021-12-16 02:52:41,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 02:52:41,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 02:52:41,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 02:52:41,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 02:52:41,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:52:39" (1/3) ... [2021-12-16 02:52:41,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ead765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:52:41, skipping insertion in model container [2021-12-16 02:52:41,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:52:40" (2/3) ... [2021-12-16 02:52:41,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ead765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:52:41, skipping insertion in model container [2021-12-16 02:52:41,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:52:41" (3/3) ... [2021-12-16 02:52:41,042 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2021-12-16 02:52:41,045 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-16 02:52:41,045 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 02:52:41,046 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-12-16 02:52:41,046 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-16 02:52:41,070 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,071 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,071 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,071 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,071 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,071 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,071 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,071 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,071 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,071 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,072 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,073 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,074 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,075 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,075 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,075 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,075 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,075 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,075 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,075 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,075 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,075 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,075 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,076 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,077 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,077 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,077 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,077 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,077 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,077 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,077 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,077 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,077 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,077 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,078 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,079 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,080 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,081 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,082 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,083 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,083 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,083 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,085 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,091 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,091 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,091 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,091 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,092 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,092 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,093 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,093 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,093 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,093 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,093 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,093 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,097 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,098 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,098 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,098 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,098 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,098 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,099 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,099 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,099 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,099 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,099 WARN L322 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,099 WARN L322 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-16 02:52:41,102 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-12-16 02:52:41,143 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 02:52:41,149 INFO L339 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=true, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 02:52:41,150 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-12-16 02:52:41,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 193 places, 195 transitions, 406 flow [2021-12-16 02:52:41,238 INFO L129 PetriNetUnfolder]: 10/240 cut-off events. [2021-12-16 02:52:41,239 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-16 02:52:41,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 240 events. 10/240 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 405 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 141. Up to 4 conditions per place. [2021-12-16 02:52:41,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 195 transitions, 406 flow [2021-12-16 02:52:41,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 181 transitions, 374 flow [2021-12-16 02:52:41,263 INFO L129 PetriNetUnfolder]: 1/48 cut-off events. [2021-12-16 02:52:41,264 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-16 02:52:41,264 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:41,265 INFO L254 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] [2021-12-16 02:52:41,265 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:41,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1888391755, now seen corresponding path program 1 times [2021-12-16 02:52:41,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:41,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424328706] [2021-12-16 02:52:41,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:41,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:41,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424328706] [2021-12-16 02:52:41,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424328706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:41,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:41,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:52:41,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835159520] [2021-12-16 02:52:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:41,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:52:41,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:41,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:52:41,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:52:41,626 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 195 [2021-12-16 02:52:41,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 181 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:41,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:41,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 195 [2021-12-16 02:52:41,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:41,925 INFO L129 PetriNetUnfolder]: 361/1046 cut-off events. [2021-12-16 02:52:41,926 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-12-16 02:52:41,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 1046 events. 361/1046 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6124 event pairs, 216 based on Foata normal form. 20/1012 useless extension candidates. Maximal degree in co-relation 1489. Up to 397 conditions per place. [2021-12-16 02:52:41,935 INFO L132 encePairwiseOnDemand]: 173/195 looper letters, 53 selfloop transitions, 17 changer transitions 1/177 dead transitions. [2021-12-16 02:52:41,936 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 177 transitions, 508 flow [2021-12-16 02:52:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 02:52:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-16 02:52:41,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1138 transitions. [2021-12-16 02:52:41,949 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6484330484330484 [2021-12-16 02:52:41,950 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1138 transitions. [2021-12-16 02:52:41,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1138 transitions. [2021-12-16 02:52:41,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:41,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1138 transitions. [2021-12-16 02:52:41,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.44444444444444) internal successors, (1138), 9 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:41,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:41,964 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:41,965 INFO L186 Difference]: Start difference. First operand has 181 places, 181 transitions, 374 flow. Second operand 9 states and 1138 transitions. [2021-12-16 02:52:41,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 177 transitions, 508 flow [2021-12-16 02:52:41,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 177 transitions, 500 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-16 02:52:41,971 INFO L242 Difference]: Finished difference. Result has 179 places, 170 transitions, 385 flow [2021-12-16 02:52:41,973 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=385, PETRI_PLACES=179, PETRI_TRANSITIONS=170} [2021-12-16 02:52:41,975 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, -2 predicate places. [2021-12-16 02:52:41,975 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 170 transitions, 385 flow [2021-12-16 02:52:41,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:41,976 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:41,976 INFO L254 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] [2021-12-16 02:52:41,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 02:52:41,976 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash -57843741, now seen corresponding path program 1 times [2021-12-16 02:52:41,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:41,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489938817] [2021-12-16 02:52:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:41,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:42,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:42,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489938817] [2021-12-16 02:52:42,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489938817] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:42,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:42,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:52:42,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231002858] [2021-12-16 02:52:42,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:42,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:52:42,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:52:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:52:42,104 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 195 [2021-12-16 02:52:42,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 170 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,105 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:42,105 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 195 [2021-12-16 02:52:42,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:42,322 INFO L129 PetriNetUnfolder]: 361/1016 cut-off events. [2021-12-16 02:52:42,322 INFO L130 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2021-12-16 02:52:42,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1784 conditions, 1016 events. 361/1016 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5789 event pairs, 120 based on Foata normal form. 1/983 useless extension candidates. Maximal degree in co-relation 882. Up to 262 conditions per place. [2021-12-16 02:52:42,329 INFO L132 encePairwiseOnDemand]: 176/195 looper letters, 61 selfloop transitions, 18 changer transitions 1/185 dead transitions. [2021-12-16 02:52:42,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 185 transitions, 577 flow [2021-12-16 02:52:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 02:52:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-16 02:52:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1261 transitions. [2021-12-16 02:52:42,331 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2021-12-16 02:52:42,331 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1261 transitions. [2021-12-16 02:52:42,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1261 transitions. [2021-12-16 02:52:42,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:42,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1261 transitions. [2021-12-16 02:52:42,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.1) internal successors, (1261), 10 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 195.0) internal successors, (2145), 11 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,337 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 195.0) internal successors, (2145), 11 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,338 INFO L186 Difference]: Start difference. First operand has 179 places, 170 transitions, 385 flow. Second operand 10 states and 1261 transitions. [2021-12-16 02:52:42,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 185 transitions, 577 flow [2021-12-16 02:52:42,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 185 transitions, 548 flow, removed 0 selfloop flow, removed 7 redundant places. [2021-12-16 02:52:42,346 INFO L242 Difference]: Finished difference. Result has 180 places, 169 transitions, 396 flow [2021-12-16 02:52:42,347 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=396, PETRI_PLACES=180, PETRI_TRANSITIONS=169} [2021-12-16 02:52:42,347 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, -1 predicate places. [2021-12-16 02:52:42,347 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 169 transitions, 396 flow [2021-12-16 02:52:42,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,348 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:42,349 INFO L254 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] [2021-12-16 02:52:42,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 02:52:42,350 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:42,351 INFO L85 PathProgramCache]: Analyzing trace with hash 5829728, now seen corresponding path program 1 times [2021-12-16 02:52:42,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:42,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223136639] [2021-12-16 02:52:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:42,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:42,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:42,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223136639] [2021-12-16 02:52:42,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223136639] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:42,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:42,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:52:42,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201847173] [2021-12-16 02:52:42,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:42,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:52:42,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:42,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:52:42,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:52:42,473 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 195 [2021-12-16 02:52:42,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 169 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:42,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 195 [2021-12-16 02:52:42,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:42,812 INFO L129 PetriNetUnfolder]: 832/2098 cut-off events. [2021-12-16 02:52:42,813 INFO L130 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2021-12-16 02:52:42,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3841 conditions, 2098 events. 832/2098 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14158 event pairs, 169 based on Foata normal form. 32/2102 useless extension candidates. Maximal degree in co-relation 1029. Up to 499 conditions per place. [2021-12-16 02:52:42,823 INFO L132 encePairwiseOnDemand]: 174/195 looper letters, 100 selfloop transitions, 49 changer transitions 0/254 dead transitions. [2021-12-16 02:52:42,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 254 transitions, 880 flow [2021-12-16 02:52:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 02:52:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-16 02:52:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1657 transitions. [2021-12-16 02:52:42,826 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6536489151873768 [2021-12-16 02:52:42,826 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1657 transitions. [2021-12-16 02:52:42,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1657 transitions. [2021-12-16 02:52:42,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:42,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1657 transitions. [2021-12-16 02:52:42,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 127.46153846153847) internal successors, (1657), 13 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 195.0) internal successors, (2730), 14 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,833 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 195.0) internal successors, (2730), 14 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,833 INFO L186 Difference]: Start difference. First operand has 180 places, 169 transitions, 396 flow. Second operand 13 states and 1657 transitions. [2021-12-16 02:52:42,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 254 transitions, 880 flow [2021-12-16 02:52:42,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 254 transitions, 834 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-16 02:52:42,853 INFO L242 Difference]: Finished difference. Result has 192 places, 206 transitions, 666 flow [2021-12-16 02:52:42,854 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=666, PETRI_PLACES=192, PETRI_TRANSITIONS=206} [2021-12-16 02:52:42,855 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 11 predicate places. [2021-12-16 02:52:42,855 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 206 transitions, 666 flow [2021-12-16 02:52:42,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,855 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:42,855 INFO L254 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] [2021-12-16 02:52:42,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 02:52:42,856 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:42,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2139572029, now seen corresponding path program 1 times [2021-12-16 02:52:42,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:42,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684083042] [2021-12-16 02:52:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:42,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:42,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:42,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684083042] [2021-12-16 02:52:42,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684083042] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:42,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:42,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 02:52:42,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632126304] [2021-12-16 02:52:42,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:42,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 02:52:42,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:42,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 02:52:42,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 02:52:42,953 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 195 [2021-12-16 02:52:42,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 206 transitions, 666 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:42,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:42,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 195 [2021-12-16 02:52:42,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:43,384 INFO L129 PetriNetUnfolder]: 1084/2667 cut-off events. [2021-12-16 02:52:43,385 INFO L130 PetriNetUnfolder]: For 10874/10936 co-relation queries the response was YES. [2021-12-16 02:52:43,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9161 conditions, 2667 events. 1084/2667 cut-off events. For 10874/10936 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 19229 event pairs, 218 based on Foata normal form. 47/2686 useless extension candidates. Maximal degree in co-relation 7852. Up to 732 conditions per place. [2021-12-16 02:52:43,402 INFO L132 encePairwiseOnDemand]: 176/195 looper letters, 74 selfloop transitions, 48 changer transitions 69/295 dead transitions. [2021-12-16 02:52:43,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 295 transitions, 1750 flow [2021-12-16 02:52:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 02:52:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-16 02:52:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1406 transitions. [2021-12-16 02:52:43,405 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6554778554778555 [2021-12-16 02:52:43,406 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1406 transitions. [2021-12-16 02:52:43,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1406 transitions. [2021-12-16 02:52:43,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:43,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1406 transitions. [2021-12-16 02:52:43,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 127.81818181818181) internal successors, (1406), 11 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:43,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 195.0) internal successors, (2340), 12 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:43,412 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 195.0) internal successors, (2340), 12 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:43,412 INFO L186 Difference]: Start difference. First operand has 192 places, 206 transitions, 666 flow. Second operand 11 states and 1406 transitions. [2021-12-16 02:52:43,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 295 transitions, 1750 flow [2021-12-16 02:52:43,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 295 transitions, 1750 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-16 02:52:43,428 INFO L242 Difference]: Finished difference. Result has 210 places, 212 transitions, 979 flow [2021-12-16 02:52:43,429 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=979, PETRI_PLACES=210, PETRI_TRANSITIONS=212} [2021-12-16 02:52:43,430 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 29 predicate places. [2021-12-16 02:52:43,430 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 212 transitions, 979 flow [2021-12-16 02:52:43,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:43,431 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:43,431 INFO L254 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] [2021-12-16 02:52:43,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 02:52:43,431 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash 881004710, now seen corresponding path program 1 times [2021-12-16 02:52:43,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:43,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768130806] [2021-12-16 02:52:43,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:43,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:43,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:43,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768130806] [2021-12-16 02:52:43,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768130806] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:43,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:43,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 02:52:43,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938948471] [2021-12-16 02:52:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:43,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 02:52:43,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:43,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 02:52:43,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 02:52:43,536 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 195 [2021-12-16 02:52:43,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 212 transitions, 979 flow. Second operand has 5 states, 5 states have (on average 170.2) internal successors, (851), 5 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:43,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:43,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 195 [2021-12-16 02:52:43,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:43,590 INFO L129 PetriNetUnfolder]: 4/168 cut-off events. [2021-12-16 02:52:43,590 INFO L130 PetriNetUnfolder]: For 459/531 co-relation queries the response was YES. [2021-12-16 02:52:43,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 168 events. 4/168 cut-off events. For 459/531 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 194 event pairs, 4 based on Foata normal form. 8/174 useless extension candidates. Maximal degree in co-relation 337. Up to 13 conditions per place. [2021-12-16 02:52:43,591 INFO L132 encePairwiseOnDemand]: 190/195 looper letters, 9 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2021-12-16 02:52:43,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 140 transitions, 438 flow [2021-12-16 02:52:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 02:52:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-16 02:52:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1022 transitions. [2021-12-16 02:52:43,594 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8735042735042735 [2021-12-16 02:52:43,594 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1022 transitions. [2021-12-16 02:52:43,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1022 transitions. [2021-12-16 02:52:43,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:43,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1022 transitions. [2021-12-16 02:52:43,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.33333333333334) internal successors, (1022), 6 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:43,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:43,598 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:43,598 INFO L186 Difference]: Start difference. First operand has 210 places, 212 transitions, 979 flow. Second operand 6 states and 1022 transitions. [2021-12-16 02:52:43,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 140 transitions, 438 flow [2021-12-16 02:52:43,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 140 transitions, 318 flow, removed 40 selfloop flow, removed 19 redundant places. [2021-12-16 02:52:43,601 INFO L242 Difference]: Finished difference. Result has 153 places, 140 transitions, 300 flow [2021-12-16 02:52:43,601 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=153, PETRI_TRANSITIONS=140} [2021-12-16 02:52:43,602 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, -28 predicate places. [2021-12-16 02:52:43,602 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 140 transitions, 300 flow [2021-12-16 02:52:43,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 170.2) internal successors, (851), 5 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:43,602 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:43,603 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:52:43,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 02:52:43,603 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:43,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash -971686872, now seen corresponding path program 1 times [2021-12-16 02:52:43,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:43,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606650662] [2021-12-16 02:52:43,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:43,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:44,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:44,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606650662] [2021-12-16 02:52:44,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606650662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:44,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:44,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-12-16 02:52:44,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274387236] [2021-12-16 02:52:44,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:44,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-16 02:52:44,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:44,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-16 02:52:44,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-12-16 02:52:44,357 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 195 [2021-12-16 02:52:44,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 140 transitions, 300 flow. Second operand has 22 states, 22 states have (on average 101.72727272727273) internal successors, (2238), 22 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:44,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:44,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 195 [2021-12-16 02:52:44,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:46,116 INFO L129 PetriNetUnfolder]: 698/1674 cut-off events. [2021-12-16 02:52:46,117 INFO L130 PetriNetUnfolder]: For 148/148 co-relation queries the response was YES. [2021-12-16 02:52:46,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3160 conditions, 1674 events. 698/1674 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10908 event pairs, 18 based on Foata normal form. 12/1618 useless extension candidates. Maximal degree in co-relation 3152. Up to 340 conditions per place. [2021-12-16 02:52:46,125 INFO L132 encePairwiseOnDemand]: 169/195 looper letters, 154 selfloop transitions, 29 changer transitions 0/257 dead transitions. [2021-12-16 02:52:46,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 257 transitions, 949 flow [2021-12-16 02:52:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-16 02:52:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-12-16 02:52:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2461 transitions. [2021-12-16 02:52:46,131 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5487179487179488 [2021-12-16 02:52:46,132 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2461 transitions. [2021-12-16 02:52:46,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2461 transitions. [2021-12-16 02:52:46,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:46,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2461 transitions. [2021-12-16 02:52:46,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 107.0) internal successors, (2461), 23 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:46,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 195.0) internal successors, (4680), 24 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:46,142 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 195.0) internal successors, (4680), 24 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:46,143 INFO L186 Difference]: Start difference. First operand has 153 places, 140 transitions, 300 flow. Second operand 23 states and 2461 transitions. [2021-12-16 02:52:46,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 257 transitions, 949 flow [2021-12-16 02:52:46,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 257 transitions, 942 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-16 02:52:46,148 INFO L242 Difference]: Finished difference. Result has 176 places, 150 transitions, 400 flow [2021-12-16 02:52:46,148 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=400, PETRI_PLACES=176, PETRI_TRANSITIONS=150} [2021-12-16 02:52:46,150 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, -5 predicate places. [2021-12-16 02:52:46,150 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 150 transitions, 400 flow [2021-12-16 02:52:46,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 101.72727272727273) internal successors, (2238), 22 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:46,151 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:46,151 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:52:46,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-16 02:52:46,152 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:46,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:46,153 INFO L85 PathProgramCache]: Analyzing trace with hash -118839364, now seen corresponding path program 2 times [2021-12-16 02:52:46,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:46,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047252210] [2021-12-16 02:52:46,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:46,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:46,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047252210] [2021-12-16 02:52:46,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047252210] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:46,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:46,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-16 02:52:46,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38187687] [2021-12-16 02:52:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:46,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 02:52:46,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:46,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 02:52:46,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-12-16 02:52:46,653 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 195 [2021-12-16 02:52:46,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 150 transitions, 400 flow. Second operand has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:46,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:46,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 195 [2021-12-16 02:52:46,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:47,508 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= |v_#memory_int_29| (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1))) (= |v_#memory_$Pointer$.base_17| (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][130], [406#(and (= 1 (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|)) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= |ULTIMATE.start_my_drv_probe_~d~0#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (= |my_callbackThread1of1ForFork1_#in~arg.base| |ULTIMATE.start_main_~#data~1#1.base|) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (= my_callbackThread1of1ForFork1_~arg.base |ULTIMATE.start_main_~#data~1#1.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= |ULTIMATE.start_my_drv_probe_~data#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (= 0 |ULTIMATE.start_main_~#data~1#1.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|))), Black: 282#(and (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))), 24#L1711-1true, Black: 253#(and (= (+ |ULTIMATE.start_main_#t~mem48#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))), Black: 286#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0)), 359#(and (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24))), Black: 284#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))), Black: 245#(and (= (+ |ULTIMATE.start_main_#t~mem48#1| 1) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 24)) 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))), 306#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), 115#L1734-1true, Black: 369#(and (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (< 0 (+ my_callbackThread1of1ForFork0_~data~0.offset 1)) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork0_~data~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (not (= 0 (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset))) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (<= my_callbackThread1of1ForFork0_~data~0.offset 0) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (<= 24 my_callbackThread1of1ForFork0_~arg.offset)), Black: 365#(and (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (not (= 0 (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset))) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (<= 24 my_callbackThread1of1ForFork0_~arg.offset)), Black: 361#(and (not (= 0 (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset))) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24))), Black: 367#(and (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (not (= 0 (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset))) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (<= 24 my_callbackThread1of1ForFork0_~arg.offset)), Black: 363#(and (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (not (= 0 (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset))) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (<= 24 my_callbackThread1of1ForFork0_~arg.offset)), 23#L1714true]) [2021-12-16 02:52:47,509 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2021-12-16 02:52:47,509 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2021-12-16 02:52:47,509 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2021-12-16 02:52:47,509 INFO L387 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2021-12-16 02:52:47,525 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= |v_#memory_int_29| (store |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_30| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1))) (= |v_#memory_$Pointer$.base_17| (store |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_18| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_17| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0)))))) InVars {#memory_int=|v_#memory_int_30|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_18|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_18|} OutVars{#memory_int=|v_#memory_int_29|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset][130], [Black: 282#(and (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))), 406#(and (= 1 (select |#valid| |ULTIMATE.start_main_~#data~1#1.base|)) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= |ULTIMATE.start_my_drv_probe_~d~0#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (= |my_callbackThread1of1ForFork1_#in~arg.base| |ULTIMATE.start_main_~#data~1#1.base|) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (= my_callbackThread1of1ForFork1_~arg.base |ULTIMATE.start_main_~#data~1#1.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= |ULTIMATE.start_my_drv_probe_~data#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (= 0 |ULTIMATE.start_main_~#data~1#1.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.base| |ULTIMATE.start_main_~#data~1#1.base|) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0)) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (not (= |ULTIMATE.start_main_~#data~1#1.base| |ULTIMATE.start_my_drv_disconnect_~#status~0#1.base|))), 24#L1711-1true, Black: 253#(and (= (+ |ULTIMATE.start_main_#t~mem48#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))), Black: 286#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0)), 359#(and (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24))), Black: 284#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (= (+ |ULTIMATE.start_main_#t~mem49#1| 1) 0) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))), 100#L1735true, Black: 245#(and (= (+ |ULTIMATE.start_main_#t~mem48#1| 1) 0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#data~1#1.base|) (+ |ULTIMATE.start_main_~#data~1#1.offset| 24)) 1) 0) (not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0)) (not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))), 306#(and (= |ULTIMATE.start_my_drv_probe_#res#1| 0) (= |ULTIMATE.start_main_~probe_ret~0#1| 0)), Black: 369#(and (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (< 0 (+ my_callbackThread1of1ForFork0_~data~0.offset 1)) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork0_~data~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (not (= 0 (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset))) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (<= my_callbackThread1of1ForFork0_~data~0.offset 0) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (<= 24 my_callbackThread1of1ForFork0_~arg.offset)), Black: 365#(and (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (not (= 0 (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset))) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (<= 24 my_callbackThread1of1ForFork0_~arg.offset)), Black: 361#(and (not (= 0 (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset))) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24))), Black: 367#(and (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (not (= 0 (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset))) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (<= 24 my_callbackThread1of1ForFork0_~arg.offset)), Black: 363#(and (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| |ULTIMATE.start_my_drv_probe_~d~0#1.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (not (= 0 (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset))) (< 0 (+ my_callbackThread1of1ForFork1_~data~0.offset 1)) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (<= (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24) |ULTIMATE.start_my_drv_probe_~d~0#1.offset|) (= |ULTIMATE.start_my_drv_probe_~data#1.offset| 0) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~dev~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= |ULTIMATE.start_my_drv_probe_#in~data#1.offset| 0) (<= my_callbackThread1of1ForFork1_~data~0.offset 0) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (<= |ULTIMATE.start_my_drv_probe_~d~0#1.offset| (+ |ULTIMATE.start_my_drv_probe_~data#1.offset| 24)) (<= 24 my_callbackThread1of1ForFork0_~arg.offset)), 23#L1714true]) [2021-12-16 02:52:47,525 INFO L384 tUnfolder$Statistics]: this new event has 103 ancestors and is cut-off event [2021-12-16 02:52:47,525 INFO L387 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2021-12-16 02:52:47,525 INFO L387 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2021-12-16 02:52:47,525 INFO L387 tUnfolder$Statistics]: existing Event has 103 ancestors and is cut-off event [2021-12-16 02:52:47,866 INFO L129 PetriNetUnfolder]: 749/1961 cut-off events. [2021-12-16 02:52:47,867 INFO L130 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2021-12-16 02:52:47,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4343 conditions, 1961 events. 749/1961 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13468 event pairs, 126 based on Foata normal form. 0/1900 useless extension candidates. Maximal degree in co-relation 4330. Up to 665 conditions per place. [2021-12-16 02:52:47,880 INFO L132 encePairwiseOnDemand]: 169/195 looper letters, 155 selfloop transitions, 32 changer transitions 0/264 dead transitions. [2021-12-16 02:52:47,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 264 transitions, 1104 flow [2021-12-16 02:52:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 02:52:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-12-16 02:52:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2284 transitions. [2021-12-16 02:52:47,885 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5324009324009324 [2021-12-16 02:52:47,885 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2284 transitions. [2021-12-16 02:52:47,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2284 transitions. [2021-12-16 02:52:47,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:47,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2284 transitions. [2021-12-16 02:52:47,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 103.81818181818181) internal successors, (2284), 22 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:47,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 195.0) internal successors, (4485), 23 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:47,898 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 195.0) internal successors, (4485), 23 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:47,898 INFO L186 Difference]: Start difference. First operand has 176 places, 150 transitions, 400 flow. Second operand 22 states and 2284 transitions. [2021-12-16 02:52:47,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 264 transitions, 1104 flow [2021-12-16 02:52:47,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 264 transitions, 1061 flow, removed 0 selfloop flow, removed 16 redundant places. [2021-12-16 02:52:47,906 INFO L242 Difference]: Finished difference. Result has 192 places, 171 transitions, 542 flow [2021-12-16 02:52:47,906 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=542, PETRI_PLACES=192, PETRI_TRANSITIONS=171} [2021-12-16 02:52:47,907 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 11 predicate places. [2021-12-16 02:52:47,907 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 171 transitions, 542 flow [2021-12-16 02:52:47,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:47,908 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:47,908 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:52:47,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-16 02:52:47,909 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash -109966910, now seen corresponding path program 3 times [2021-12-16 02:52:47,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:47,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573792097] [2021-12-16 02:52:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:47,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:48,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:48,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573792097] [2021-12-16 02:52:48,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573792097] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:48,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:48,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-16 02:52:48,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16010707] [2021-12-16 02:52:48,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:48,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 02:52:48,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:48,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 02:52:48,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-12-16 02:52:48,427 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 195 [2021-12-16 02:52:48,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 171 transitions, 542 flow. Second operand has 19 states, 19 states have (on average 134.31578947368422) internal successors, (2552), 19 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:48,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:48,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 195 [2021-12-16 02:52:48,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:50,023 INFO L129 PetriNetUnfolder]: 1035/2694 cut-off events. [2021-12-16 02:52:50,023 INFO L130 PetriNetUnfolder]: For 2035/2064 co-relation queries the response was YES. [2021-12-16 02:52:50,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6780 conditions, 2694 events. 1035/2694 cut-off events. For 2035/2064 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20675 event pairs, 100 based on Foata normal form. 27/2620 useless extension candidates. Maximal degree in co-relation 6756. Up to 497 conditions per place. [2021-12-16 02:52:50,042 INFO L132 encePairwiseOnDemand]: 175/195 looper letters, 163 selfloop transitions, 33 changer transitions 0/304 dead transitions. [2021-12-16 02:52:50,042 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 304 transitions, 1545 flow [2021-12-16 02:52:50,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-16 02:52:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-16 02:52:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2658 transitions. [2021-12-16 02:52:50,047 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7174089068825911 [2021-12-16 02:52:50,047 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2658 transitions. [2021-12-16 02:52:50,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2658 transitions. [2021-12-16 02:52:50,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:50,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2658 transitions. [2021-12-16 02:52:50,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 139.89473684210526) internal successors, (2658), 19 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:50,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 195.0) internal successors, (3900), 20 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:50,068 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 195.0) internal successors, (3900), 20 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:50,069 INFO L186 Difference]: Start difference. First operand has 192 places, 171 transitions, 542 flow. Second operand 19 states and 2658 transitions. [2021-12-16 02:52:50,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 304 transitions, 1545 flow [2021-12-16 02:52:50,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 304 transitions, 1513 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-16 02:52:50,078 INFO L242 Difference]: Finished difference. Result has 210 places, 186 transitions, 707 flow [2021-12-16 02:52:50,078 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=707, PETRI_PLACES=210, PETRI_TRANSITIONS=186} [2021-12-16 02:52:50,081 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 29 predicate places. [2021-12-16 02:52:50,081 INFO L470 AbstractCegarLoop]: Abstraction has has 210 places, 186 transitions, 707 flow [2021-12-16 02:52:50,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 134.31578947368422) internal successors, (2552), 19 states have internal predecessors, (2552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:50,082 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:50,082 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:52:50,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-16 02:52:50,082 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:50,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash 992443142, now seen corresponding path program 4 times [2021-12-16 02:52:50,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:50,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112400147] [2021-12-16 02:52:50,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:50,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:50,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:50,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112400147] [2021-12-16 02:52:50,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112400147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:50,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:50,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-12-16 02:52:50,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415291066] [2021-12-16 02:52:50,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:50,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-16 02:52:50,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:50,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-16 02:52:50,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2021-12-16 02:52:50,687 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 195 [2021-12-16 02:52:50,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 186 transitions, 707 flow. Second operand has 24 states, 24 states have (on average 97.58333333333333) internal successors, (2342), 24 states have internal predecessors, (2342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:50,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:50,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 195 [2021-12-16 02:52:50,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:53,200 INFO L129 PetriNetUnfolder]: 1719/4826 cut-off events. [2021-12-16 02:52:53,200 INFO L130 PetriNetUnfolder]: For 4229/4393 co-relation queries the response was YES. [2021-12-16 02:52:53,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12774 conditions, 4826 events. 1719/4826 cut-off events. For 4229/4393 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 43354 event pairs, 238 based on Foata normal form. 34/4722 useless extension candidates. Maximal degree in co-relation 12743. Up to 1179 conditions per place. [2021-12-16 02:52:53,226 INFO L132 encePairwiseOnDemand]: 163/195 looper letters, 178 selfloop transitions, 66 changer transitions 0/331 dead transitions. [2021-12-16 02:52:53,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 331 transitions, 1855 flow [2021-12-16 02:52:53,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-16 02:52:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-12-16 02:52:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3112 transitions. [2021-12-16 02:52:53,246 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5148056244830438 [2021-12-16 02:52:53,246 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3112 transitions. [2021-12-16 02:52:53,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3112 transitions. [2021-12-16 02:52:53,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:53,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3112 transitions. [2021-12-16 02:52:53,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 100.38709677419355) internal successors, (3112), 31 states have internal predecessors, (3112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:53,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 195.0) internal successors, (6240), 32 states have internal predecessors, (6240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:53,259 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 195.0) internal successors, (6240), 32 states have internal predecessors, (6240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:53,259 INFO L186 Difference]: Start difference. First operand has 210 places, 186 transitions, 707 flow. Second operand 31 states and 3112 transitions. [2021-12-16 02:52:53,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 331 transitions, 1855 flow [2021-12-16 02:52:53,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 331 transitions, 1807 flow, removed 10 selfloop flow, removed 10 redundant places. [2021-12-16 02:52:53,276 INFO L242 Difference]: Finished difference. Result has 239 places, 225 transitions, 1092 flow [2021-12-16 02:52:53,276 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1092, PETRI_PLACES=239, PETRI_TRANSITIONS=225} [2021-12-16 02:52:53,277 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 58 predicate places. [2021-12-16 02:52:53,277 INFO L470 AbstractCegarLoop]: Abstraction has has 239 places, 225 transitions, 1092 flow [2021-12-16 02:52:53,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 97.58333333333333) internal successors, (2342), 24 states have internal predecessors, (2342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:53,278 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:53,278 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:52:53,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-16 02:52:53,278 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2110513158, now seen corresponding path program 5 times [2021-12-16 02:52:53,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:53,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531199238] [2021-12-16 02:52:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:53,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:53,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:53,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531199238] [2021-12-16 02:52:53,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531199238] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:53,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:53,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-16 02:52:53,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558472079] [2021-12-16 02:52:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:53,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 02:52:53,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:53,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 02:52:53,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-12-16 02:52:53,729 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 195 [2021-12-16 02:52:53,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 225 transitions, 1092 flow. Second operand has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:53,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:53,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 195 [2021-12-16 02:52:53,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:55,335 INFO L129 PetriNetUnfolder]: 2179/6563 cut-off events. [2021-12-16 02:52:55,335 INFO L130 PetriNetUnfolder]: For 8045/8263 co-relation queries the response was YES. [2021-12-16 02:52:55,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18071 conditions, 6563 events. 2179/6563 cut-off events. For 8045/8263 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 62954 event pairs, 1004 based on Foata normal form. 33/6415 useless extension candidates. Maximal degree in co-relation 18031. Up to 2409 conditions per place. [2021-12-16 02:52:55,377 INFO L132 encePairwiseOnDemand]: 170/195 looper letters, 164 selfloop transitions, 77 changer transitions 0/329 dead transitions. [2021-12-16 02:52:55,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 329 transitions, 2154 flow [2021-12-16 02:52:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-16 02:52:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-12-16 02:52:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2155 transitions. [2021-12-16 02:52:55,380 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5262515262515263 [2021-12-16 02:52:55,380 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2155 transitions. [2021-12-16 02:52:55,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2155 transitions. [2021-12-16 02:52:55,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:55,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2155 transitions. [2021-12-16 02:52:55,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 102.61904761904762) internal successors, (2155), 21 states have internal predecessors, (2155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:55,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 195.0) internal successors, (4290), 22 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:55,387 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 195.0) internal successors, (4290), 22 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:55,387 INFO L186 Difference]: Start difference. First operand has 239 places, 225 transitions, 1092 flow. Second operand 21 states and 2155 transitions. [2021-12-16 02:52:55,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 329 transitions, 2154 flow [2021-12-16 02:52:55,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 329 transitions, 2091 flow, removed 5 selfloop flow, removed 15 redundant places. [2021-12-16 02:52:55,410 INFO L242 Difference]: Finished difference. Result has 256 places, 253 transitions, 1507 flow [2021-12-16 02:52:55,410 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1507, PETRI_PLACES=256, PETRI_TRANSITIONS=253} [2021-12-16 02:52:55,410 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 75 predicate places. [2021-12-16 02:52:55,411 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 253 transitions, 1507 flow [2021-12-16 02:52:55,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:55,411 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:55,411 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:52:55,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-16 02:52:55,412 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1703742018, now seen corresponding path program 6 times [2021-12-16 02:52:55,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:55,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181187909] [2021-12-16 02:52:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:55,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:55,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181187909] [2021-12-16 02:52:55,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181187909] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:55,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:55,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-16 02:52:55,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524253393] [2021-12-16 02:52:55,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:55,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 02:52:55,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:55,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 02:52:55,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-12-16 02:52:55,890 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 195 [2021-12-16 02:52:55,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 253 transitions, 1507 flow. Second operand has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:55,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:55,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 195 [2021-12-16 02:52:55,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:52:57,854 INFO L129 PetriNetUnfolder]: 2932/8312 cut-off events. [2021-12-16 02:52:57,855 INFO L130 PetriNetUnfolder]: For 13145/13339 co-relation queries the response was YES. [2021-12-16 02:52:57,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24162 conditions, 8312 events. 2932/8312 cut-off events. For 13145/13339 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 84926 event pairs, 173 based on Foata normal form. 103/8262 useless extension candidates. Maximal degree in co-relation 24109. Up to 1864 conditions per place. [2021-12-16 02:52:57,906 INFO L132 encePairwiseOnDemand]: 167/195 looper letters, 195 selfloop transitions, 74 changer transitions 0/362 dead transitions. [2021-12-16 02:52:57,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 362 transitions, 2649 flow [2021-12-16 02:52:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-16 02:52:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-12-16 02:52:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2072 transitions. [2021-12-16 02:52:57,909 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5312820512820513 [2021-12-16 02:52:57,909 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2072 transitions. [2021-12-16 02:52:57,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2072 transitions. [2021-12-16 02:52:57,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:52:57,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2072 transitions. [2021-12-16 02:52:57,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 103.6) internal successors, (2072), 20 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:57,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 195.0) internal successors, (4095), 21 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:57,915 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 195.0) internal successors, (4095), 21 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:57,915 INFO L186 Difference]: Start difference. First operand has 256 places, 253 transitions, 1507 flow. Second operand 20 states and 2072 transitions. [2021-12-16 02:52:57,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 362 transitions, 2649 flow [2021-12-16 02:52:57,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 362 transitions, 2592 flow, removed 21 selfloop flow, removed 6 redundant places. [2021-12-16 02:52:57,955 INFO L242 Difference]: Finished difference. Result has 277 places, 269 transitions, 1848 flow [2021-12-16 02:52:57,956 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1848, PETRI_PLACES=277, PETRI_TRANSITIONS=269} [2021-12-16 02:52:57,956 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 96 predicate places. [2021-12-16 02:52:57,956 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 269 transitions, 1848 flow [2021-12-16 02:52:57,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:57,957 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:52:57,957 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:52:57,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 02:52:57,958 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:52:57,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:52:57,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1061898016, now seen corresponding path program 7 times [2021-12-16 02:52:57,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:52:57,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608572163] [2021-12-16 02:52:57,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:52:57,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:52:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:52:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:52:58,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:52:58,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608572163] [2021-12-16 02:52:58,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608572163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:52:58,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:52:58,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-16 02:52:58,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519461489] [2021-12-16 02:52:58,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:52:58,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 02:52:58,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:52:58,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 02:52:58,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-12-16 02:52:58,348 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 195 [2021-12-16 02:52:58,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 269 transitions, 1848 flow. Second operand has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:52:58,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:52:58,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 195 [2021-12-16 02:52:58,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:53:00,863 INFO L129 PetriNetUnfolder]: 3494/10313 cut-off events. [2021-12-16 02:53:00,863 INFO L130 PetriNetUnfolder]: For 24476/24771 co-relation queries the response was YES. [2021-12-16 02:53:00,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32381 conditions, 10313 events. 3494/10313 cut-off events. For 24476/24771 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 110273 event pairs, 1021 based on Foata normal form. 145/10207 useless extension candidates. Maximal degree in co-relation 32321. Up to 3460 conditions per place. [2021-12-16 02:53:00,935 INFO L132 encePairwiseOnDemand]: 169/195 looper letters, 249 selfloop transitions, 100 changer transitions 0/442 dead transitions. [2021-12-16 02:53:00,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 442 transitions, 3816 flow [2021-12-16 02:53:00,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 02:53:00,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-12-16 02:53:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2284 transitions. [2021-12-16 02:53:00,938 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5324009324009324 [2021-12-16 02:53:00,938 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2284 transitions. [2021-12-16 02:53:00,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2284 transitions. [2021-12-16 02:53:00,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:53:00,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2284 transitions. [2021-12-16 02:53:00,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 103.81818181818181) internal successors, (2284), 22 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:00,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 195.0) internal successors, (4485), 23 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:00,945 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 195.0) internal successors, (4485), 23 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:00,945 INFO L186 Difference]: Start difference. First operand has 277 places, 269 transitions, 1848 flow. Second operand 22 states and 2284 transitions. [2021-12-16 02:53:00,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 442 transitions, 3816 flow [2021-12-16 02:53:01,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 442 transitions, 3735 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-12-16 02:53:01,027 INFO L242 Difference]: Finished difference. Result has 299 places, 312 transitions, 2625 flow [2021-12-16 02:53:01,027 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2625, PETRI_PLACES=299, PETRI_TRANSITIONS=312} [2021-12-16 02:53:01,028 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 118 predicate places. [2021-12-16 02:53:01,028 INFO L470 AbstractCegarLoop]: Abstraction has has 299 places, 312 transitions, 2625 flow [2021-12-16 02:53:01,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:01,028 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:53:01,029 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:53:01,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 02:53:01,029 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:53:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:53:01,029 INFO L85 PathProgramCache]: Analyzing trace with hash -626634122, now seen corresponding path program 8 times [2021-12-16 02:53:01,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:53:01,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809166859] [2021-12-16 02:53:01,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:53:01,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:53:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:53:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:53:01,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:53:01,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809166859] [2021-12-16 02:53:01,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809166859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:53:01,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:53:01,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-16 02:53:01,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610550781] [2021-12-16 02:53:01,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:53:01,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 02:53:01,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:53:01,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 02:53:01,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-12-16 02:53:01,466 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 195 [2021-12-16 02:53:01,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 312 transitions, 2625 flow. Second operand has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:01,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:53:01,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 195 [2021-12-16 02:53:01,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:53:03,921 INFO L129 PetriNetUnfolder]: 3514/10686 cut-off events. [2021-12-16 02:53:03,922 INFO L130 PetriNetUnfolder]: For 31050/31296 co-relation queries the response was YES. [2021-12-16 02:53:03,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34303 conditions, 10686 events. 3514/10686 cut-off events. For 31050/31296 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 114921 event pairs, 1816 based on Foata normal form. 125/10543 useless extension candidates. Maximal degree in co-relation 34232. Up to 4734 conditions per place. [2021-12-16 02:53:04,029 INFO L132 encePairwiseOnDemand]: 170/195 looper letters, 214 selfloop transitions, 124 changer transitions 0/431 dead transitions. [2021-12-16 02:53:04,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 431 transitions, 4134 flow [2021-12-16 02:53:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-16 02:53:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-12-16 02:53:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2167 transitions. [2021-12-16 02:53:04,033 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5291819291819292 [2021-12-16 02:53:04,033 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2167 transitions. [2021-12-16 02:53:04,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2167 transitions. [2021-12-16 02:53:04,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:53:04,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2167 transitions. [2021-12-16 02:53:04,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 103.19047619047619) internal successors, (2167), 21 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:04,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 195.0) internal successors, (4290), 22 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:04,040 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 195.0) internal successors, (4290), 22 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:04,040 INFO L186 Difference]: Start difference. First operand has 299 places, 312 transitions, 2625 flow. Second operand 21 states and 2167 transitions. [2021-12-16 02:53:04,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 431 transitions, 4134 flow [2021-12-16 02:53:04,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 431 transitions, 4049 flow, removed 27 selfloop flow, removed 7 redundant places. [2021-12-16 02:53:04,240 INFO L242 Difference]: Finished difference. Result has 324 places, 337 transitions, 3251 flow [2021-12-16 02:53:04,241 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=2546, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3251, PETRI_PLACES=324, PETRI_TRANSITIONS=337} [2021-12-16 02:53:04,252 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 143 predicate places. [2021-12-16 02:53:04,253 INFO L470 AbstractCegarLoop]: Abstraction has has 324 places, 337 transitions, 3251 flow [2021-12-16 02:53:04,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:04,253 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:53:04,254 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:53:04,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 02:53:04,254 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:53:04,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:53:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash -606091608, now seen corresponding path program 9 times [2021-12-16 02:53:04,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:53:04,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385215750] [2021-12-16 02:53:04,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:53:04,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:53:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:53:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:53:04,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:53:04,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385215750] [2021-12-16 02:53:04,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385215750] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:53:04,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:53:04,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-16 02:53:04,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101351400] [2021-12-16 02:53:04,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:53:04,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 02:53:04,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:53:04,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 02:53:04,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-12-16 02:53:04,647 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 195 [2021-12-16 02:53:04,648 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 337 transitions, 3251 flow. Second operand has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:04,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:53:04,648 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 195 [2021-12-16 02:53:04,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:53:07,546 INFO L129 PetriNetUnfolder]: 4000/12151 cut-off events. [2021-12-16 02:53:07,546 INFO L130 PetriNetUnfolder]: For 40386/40785 co-relation queries the response was YES. [2021-12-16 02:53:07,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40307 conditions, 12151 events. 4000/12151 cut-off events. For 40386/40785 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 135571 event pairs, 325 based on Foata normal form. 164/12105 useless extension candidates. Maximal degree in co-relation 40223. Up to 2449 conditions per place. [2021-12-16 02:53:07,706 INFO L132 encePairwiseOnDemand]: 167/195 looper letters, 263 selfloop transitions, 151 changer transitions 0/507 dead transitions. [2021-12-16 02:53:07,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 507 transitions, 5542 flow [2021-12-16 02:53:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 02:53:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-12-16 02:53:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2292 transitions. [2021-12-16 02:53:07,709 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5342657342657343 [2021-12-16 02:53:07,710 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2292 transitions. [2021-12-16 02:53:07,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2292 transitions. [2021-12-16 02:53:07,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:53:07,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2292 transitions. [2021-12-16 02:53:07,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 104.18181818181819) internal successors, (2292), 22 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:07,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 195.0) internal successors, (4485), 23 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:07,716 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 195.0) internal successors, (4485), 23 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:07,716 INFO L186 Difference]: Start difference. First operand has 324 places, 337 transitions, 3251 flow. Second operand 22 states and 2292 transitions. [2021-12-16 02:53:07,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 507 transitions, 5542 flow [2021-12-16 02:53:07,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 507 transitions, 5448 flow, removed 39 selfloop flow, removed 6 redundant places. [2021-12-16 02:53:07,918 INFO L242 Difference]: Finished difference. Result has 346 places, 378 transitions, 4323 flow [2021-12-16 02:53:07,919 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=3157, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4323, PETRI_PLACES=346, PETRI_TRANSITIONS=378} [2021-12-16 02:53:07,919 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 165 predicate places. [2021-12-16 02:53:07,920 INFO L470 AbstractCegarLoop]: Abstraction has has 346 places, 378 transitions, 4323 flow [2021-12-16 02:53:07,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:07,920 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:53:07,920 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:53:07,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 02:53:07,921 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:53:07,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:53:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2008727780, now seen corresponding path program 10 times [2021-12-16 02:53:07,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:53:07,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181267478] [2021-12-16 02:53:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:53:07,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:53:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:53:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:53:08,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:53:08,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181267478] [2021-12-16 02:53:08,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181267478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:53:08,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:53:08,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-12-16 02:53:08,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613581213] [2021-12-16 02:53:08,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:53:08,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-16 02:53:08,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:53:08,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 02:53:08,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-12-16 02:53:08,363 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 195 [2021-12-16 02:53:08,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 378 transitions, 4323 flow. Second operand has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:08,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:53:08,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 195 [2021-12-16 02:53:08,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:53:11,713 INFO L129 PetriNetUnfolder]: 4010/12429 cut-off events. [2021-12-16 02:53:11,713 INFO L130 PetriNetUnfolder]: For 54605/55024 co-relation queries the response was YES. [2021-12-16 02:53:11,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43270 conditions, 12429 events. 4010/12429 cut-off events. For 54605/55024 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 138967 event pairs, 1145 based on Foata normal form. 178/12324 useless extension candidates. Maximal degree in co-relation 43179. Up to 4202 conditions per place. [2021-12-16 02:53:11,890 INFO L132 encePairwiseOnDemand]: 169/195 looper letters, 283 selfloop transitions, 160 changer transitions 0/536 dead transitions. [2021-12-16 02:53:11,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 536 transitions, 6631 flow [2021-12-16 02:53:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 02:53:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-12-16 02:53:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2284 transitions. [2021-12-16 02:53:11,893 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5324009324009324 [2021-12-16 02:53:11,894 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2284 transitions. [2021-12-16 02:53:11,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2284 transitions. [2021-12-16 02:53:11,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:53:11,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2284 transitions. [2021-12-16 02:53:11,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 103.81818181818181) internal successors, (2284), 22 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:11,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 195.0) internal successors, (4485), 23 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:11,901 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 195.0) internal successors, (4485), 23 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:11,901 INFO L186 Difference]: Start difference. First operand has 346 places, 378 transitions, 4323 flow. Second operand 22 states and 2284 transitions. [2021-12-16 02:53:11,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 536 transitions, 6631 flow [2021-12-16 02:53:12,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 536 transitions, 6478 flow, removed 45 selfloop flow, removed 9 redundant places. [2021-12-16 02:53:12,186 INFO L242 Difference]: Finished difference. Result has 367 places, 413 transitions, 5357 flow [2021-12-16 02:53:12,187 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=4190, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5357, PETRI_PLACES=367, PETRI_TRANSITIONS=413} [2021-12-16 02:53:12,187 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 186 predicate places. [2021-12-16 02:53:12,187 INFO L470 AbstractCegarLoop]: Abstraction has has 367 places, 413 transitions, 5357 flow [2021-12-16 02:53:12,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 99.21052631578948) internal successors, (1885), 19 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:12,188 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:53:12,188 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:53:12,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 02:53:12,188 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:53:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:53:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1035531630, now seen corresponding path program 11 times [2021-12-16 02:53:12,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:53:12,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704402614] [2021-12-16 02:53:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:53:12,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:53:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:53:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:53:12,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:53:12,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704402614] [2021-12-16 02:53:12,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704402614] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:53:12,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:53:12,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-12-16 02:53:12,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185690529] [2021-12-16 02:53:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:53:12,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-16 02:53:12,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:53:12,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-16 02:53:12,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2021-12-16 02:53:12,823 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 195 [2021-12-16 02:53:12,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 413 transitions, 5357 flow. Second operand has 24 states, 24 states have (on average 97.58333333333333) internal successors, (2342), 24 states have internal predecessors, (2342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:12,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:53:12,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 195 [2021-12-16 02:53:12,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:53:17,131 INFO L129 PetriNetUnfolder]: 4540/14062 cut-off events. [2021-12-16 02:53:17,131 INFO L130 PetriNetUnfolder]: For 75529/76576 co-relation queries the response was YES. [2021-12-16 02:53:17,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50337 conditions, 14062 events. 4540/14062 cut-off events. For 75529/76576 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 160168 event pairs, 925 based on Foata normal form. 167/13846 useless extension candidates. Maximal degree in co-relation 50236. Up to 3788 conditions per place. [2021-12-16 02:53:17,270 INFO L132 encePairwiseOnDemand]: 161/195 looper letters, 308 selfloop transitions, 161 changer transitions 0/570 dead transitions. [2021-12-16 02:53:17,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 570 transitions, 8211 flow [2021-12-16 02:53:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-16 02:53:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2021-12-16 02:53:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2900 transitions. [2021-12-16 02:53:17,273 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2021-12-16 02:53:17,273 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2900 transitions. [2021-12-16 02:53:17,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2900 transitions. [2021-12-16 02:53:17,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:53:17,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2900 transitions. [2021-12-16 02:53:17,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 100.0) internal successors, (2900), 29 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:17,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 195.0) internal successors, (5850), 30 states have internal predecessors, (5850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:17,280 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 195.0) internal successors, (5850), 30 states have internal predecessors, (5850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:17,280 INFO L186 Difference]: Start difference. First operand has 367 places, 413 transitions, 5357 flow. Second operand 29 states and 2900 transitions. [2021-12-16 02:53:17,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 570 transitions, 8211 flow [2021-12-16 02:53:17,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 570 transitions, 7988 flow, removed 70 selfloop flow, removed 9 redundant places. [2021-12-16 02:53:17,518 INFO L242 Difference]: Finished difference. Result has 394 places, 437 transitions, 6141 flow [2021-12-16 02:53:17,518 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=5209, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=6141, PETRI_PLACES=394, PETRI_TRANSITIONS=437} [2021-12-16 02:53:17,519 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 213 predicate places. [2021-12-16 02:53:17,519 INFO L470 AbstractCegarLoop]: Abstraction has has 394 places, 437 transitions, 6141 flow [2021-12-16 02:53:17,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 97.58333333333333) internal successors, (2342), 24 states have internal predecessors, (2342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:17,519 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:53:17,520 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:53:17,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 02:53:17,520 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:53:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:53:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash -686127016, now seen corresponding path program 12 times [2021-12-16 02:53:17,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:53:17,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837264929] [2021-12-16 02:53:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:53:17,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:53:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:53:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:53:17,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:53:17,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837264929] [2021-12-16 02:53:17,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837264929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:53:17,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:53:17,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-16 02:53:17,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200413723] [2021-12-16 02:53:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:53:17,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-16 02:53:17,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:53:17,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-16 02:53:17,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-12-16 02:53:17,937 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 195 [2021-12-16 02:53:17,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 437 transitions, 6141 flow. Second operand has 20 states, 20 states have (on average 99.05) internal successors, (1981), 20 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:17,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:53:17,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 195 [2021-12-16 02:53:17,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:53:21,934 INFO L129 PetriNetUnfolder]: 4557/14557 cut-off events. [2021-12-16 02:53:21,934 INFO L130 PetriNetUnfolder]: For 94149/95142 co-relation queries the response was YES. [2021-12-16 02:53:22,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55885 conditions, 14557 events. 4557/14557 cut-off events. For 94149/95142 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 168762 event pairs, 708 based on Foata normal form. 180/14391 useless extension candidates. Maximal degree in co-relation 55777. Up to 2609 conditions per place. [2021-12-16 02:53:22,087 INFO L132 encePairwiseOnDemand]: 166/195 looper letters, 369 selfloop transitions, 237 changer transitions 0/708 dead transitions. [2021-12-16 02:53:22,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 708 transitions, 11098 flow [2021-12-16 02:53:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-16 02:53:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-12-16 02:53:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2764 transitions. [2021-12-16 02:53:22,090 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5249762583095916 [2021-12-16 02:53:22,091 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2764 transitions. [2021-12-16 02:53:22,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2764 transitions. [2021-12-16 02:53:22,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:53:22,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2764 transitions. [2021-12-16 02:53:22,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 102.37037037037037) internal successors, (2764), 27 states have internal predecessors, (2764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:22,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 195.0) internal successors, (5460), 28 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:22,099 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 195.0) internal successors, (5460), 28 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:22,099 INFO L186 Difference]: Start difference. First operand has 394 places, 437 transitions, 6141 flow. Second operand 27 states and 2764 transitions. [2021-12-16 02:53:22,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 708 transitions, 11098 flow [2021-12-16 02:53:22,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 708 transitions, 10969 flow, removed 36 selfloop flow, removed 16 redundant places. [2021-12-16 02:53:22,439 INFO L242 Difference]: Finished difference. Result has 412 places, 514 transitions, 8500 flow [2021-12-16 02:53:22,440 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=6012, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=8500, PETRI_PLACES=412, PETRI_TRANSITIONS=514} [2021-12-16 02:53:22,440 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 231 predicate places. [2021-12-16 02:53:22,440 INFO L470 AbstractCegarLoop]: Abstraction has has 412 places, 514 transitions, 8500 flow [2021-12-16 02:53:22,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 99.05) internal successors, (1981), 20 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:22,441 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:53:22,441 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:53:22,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-16 02:53:22,441 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:53:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:53:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1018712226, now seen corresponding path program 13 times [2021-12-16 02:53:22,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:53:22,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626032877] [2021-12-16 02:53:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:53:22,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:53:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:53:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:53:22,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:53:22,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626032877] [2021-12-16 02:53:22,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626032877] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:53:22,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:53:22,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-12-16 02:53:22,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485759571] [2021-12-16 02:53:22,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:53:22,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-16 02:53:22,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:53:22,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-16 02:53:22,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-12-16 02:53:22,885 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 195 [2021-12-16 02:53:22,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 514 transitions, 8500 flow. Second operand has 20 states, 20 states have (on average 99.05) internal successors, (1981), 20 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:22,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:53:22,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 195 [2021-12-16 02:53:22,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:53:27,483 INFO L129 PetriNetUnfolder]: 5429/18014 cut-off events. [2021-12-16 02:53:27,483 INFO L130 PetriNetUnfolder]: For 134265/135364 co-relation queries the response was YES. [2021-12-16 02:53:27,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71336 conditions, 18014 events. 5429/18014 cut-off events. For 134265/135364 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 216773 event pairs, 2640 based on Foata normal form. 210/17822 useless extension candidates. Maximal degree in co-relation 71219. Up to 6119 conditions per place. [2021-12-16 02:53:27,852 INFO L132 encePairwiseOnDemand]: 168/195 looper letters, 344 selfloop transitions, 326 changer transitions 0/772 dead transitions. [2021-12-16 02:53:27,852 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 772 transitions, 13665 flow [2021-12-16 02:53:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-16 02:53:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-12-16 02:53:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2754 transitions. [2021-12-16 02:53:27,855 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2021-12-16 02:53:27,855 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2754 transitions. [2021-12-16 02:53:27,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2754 transitions. [2021-12-16 02:53:27,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:53:27,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2754 transitions. [2021-12-16 02:53:27,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 102.0) internal successors, (2754), 27 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:27,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 195.0) internal successors, (5460), 28 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:27,861 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 195.0) internal successors, (5460), 28 states have internal predecessors, (5460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:27,861 INFO L186 Difference]: Start difference. First operand has 412 places, 514 transitions, 8500 flow. Second operand 27 states and 2754 transitions. [2021-12-16 02:53:27,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 772 transitions, 13665 flow [2021-12-16 02:53:28,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 772 transitions, 13452 flow, removed 75 selfloop flow, removed 10 redundant places. [2021-12-16 02:53:28,537 INFO L242 Difference]: Finished difference. Result has 439 places, 609 transitions, 11422 flow [2021-12-16 02:53:28,538 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=8321, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=11422, PETRI_PLACES=439, PETRI_TRANSITIONS=609} [2021-12-16 02:53:28,538 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 258 predicate places. [2021-12-16 02:53:28,538 INFO L470 AbstractCegarLoop]: Abstraction has has 439 places, 609 transitions, 11422 flow [2021-12-16 02:53:28,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 99.05) internal successors, (1981), 20 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:28,538 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:53:28,539 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:53:28,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 02:53:28,539 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:53:28,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:53:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1147742538, now seen corresponding path program 14 times [2021-12-16 02:53:28,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:53:28,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424230209] [2021-12-16 02:53:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:53:28,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:53:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:53:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:53:28,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:53:28,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424230209] [2021-12-16 02:53:28,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424230209] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:53:28,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:53:28,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-16 02:53:28,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835278410] [2021-12-16 02:53:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:53:28,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-16 02:53:28,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:53:28,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-16 02:53:28,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-12-16 02:53:28,933 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 195 [2021-12-16 02:53:28,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 609 transitions, 11422 flow. Second operand has 18 states, 18 states have (on average 142.05555555555554) internal successors, (2557), 18 states have internal predecessors, (2557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:28,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:53:28,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 195 [2021-12-16 02:53:28,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-16 02:53:33,375 INFO L129 PetriNetUnfolder]: 3958/16392 cut-off events. [2021-12-16 02:53:33,375 INFO L130 PetriNetUnfolder]: For 140027/140338 co-relation queries the response was YES. [2021-12-16 02:53:33,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68575 conditions, 16392 events. 3958/16392 cut-off events. For 140027/140338 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 210154 event pairs, 919 based on Foata normal form. 82/16168 useless extension candidates. Maximal degree in co-relation 68446. Up to 5552 conditions per place. [2021-12-16 02:53:33,692 INFO L132 encePairwiseOnDemand]: 177/195 looper letters, 292 selfloop transitions, 65 changer transitions 0/833 dead transitions. [2021-12-16 02:53:33,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 833 transitions, 14477 flow [2021-12-16 02:53:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 02:53:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-16 02:53:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2526 transitions. [2021-12-16 02:53:33,695 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7619909502262443 [2021-12-16 02:53:33,695 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2526 transitions. [2021-12-16 02:53:33,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2526 transitions. [2021-12-16 02:53:33,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 02:53:33,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2526 transitions. [2021-12-16 02:53:33,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 148.58823529411765) internal successors, (2526), 17 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:33,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 195.0) internal successors, (3510), 18 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:33,700 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 195.0) internal successors, (3510), 18 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:33,700 INFO L186 Difference]: Start difference. First operand has 439 places, 609 transitions, 11422 flow. Second operand 17 states and 2526 transitions. [2021-12-16 02:53:33,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 833 transitions, 14477 flow [2021-12-16 02:53:34,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 833 transitions, 14310 flow, removed 73 selfloop flow, removed 7 redundant places. [2021-12-16 02:53:34,463 INFO L242 Difference]: Finished difference. Result has 455 places, 630 transitions, 11720 flow [2021-12-16 02:53:34,463 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=11255, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=11720, PETRI_PLACES=455, PETRI_TRANSITIONS=630} [2021-12-16 02:53:34,464 INFO L334 CegarLoopForPetriNet]: 181 programPoint places, 274 predicate places. [2021-12-16 02:53:34,464 INFO L470 AbstractCegarLoop]: Abstraction has has 455 places, 630 transitions, 11720 flow [2021-12-16 02:53:34,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 142.05555555555554) internal successors, (2557), 18 states have internal predecessors, (2557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:34,464 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-16 02:53:34,464 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 02:53:34,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-16 02:53:34,465 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-12-16 02:53:34,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 02:53:34,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1677925532, now seen corresponding path program 15 times [2021-12-16 02:53:34,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 02:53:34,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937681064] [2021-12-16 02:53:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 02:53:34,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 02:53:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 02:53:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 02:53:35,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 02:53:35,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937681064] [2021-12-16 02:53:35,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937681064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 02:53:35,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 02:53:35,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-12-16 02:53:35,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980502196] [2021-12-16 02:53:35,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 02:53:35,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-16 02:53:35,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 02:53:35,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-16 02:53:35,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2021-12-16 02:53:35,267 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 195 [2021-12-16 02:53:35,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 630 transitions, 11720 flow. Second operand has 25 states, 25 states have (on average 91.72) internal successors, (2293), 25 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 02:53:35,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-16 02:53:35,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 195 [2021-12-16 02:53:35,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand