/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-231806ee773fbd0554de777ff4074f5592c67ff4-231806e [2021-10-13 22:45:29,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 22:45:29,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 22:45:29,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 22:45:29,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 22:45:29,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 22:45:29,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 22:45:29,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 22:45:29,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 22:45:29,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 22:45:29,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 22:45:29,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 22:45:29,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 22:45:29,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 22:45:29,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 22:45:29,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 22:45:29,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 22:45:29,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 22:45:29,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 22:45:29,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 22:45:29,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 22:45:29,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 22:45:29,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 22:45:29,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 22:45:29,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 22:45:29,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 22:45:29,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 22:45:29,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 22:45:29,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 22:45:29,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 22:45:29,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 22:45:29,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 22:45:29,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 22:45:29,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 22:45:29,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 22:45:29,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 22:45:29,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 22:45:29,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 22:45:29,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 22:45:29,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 22:45:29,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 22:45:29,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2021-10-13 22:45:29,131 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 22:45:29,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 22:45:29,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 22:45:29,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 22:45:29,137 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 22:45:29,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 22:45:29,138 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 22:45:29,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 22:45:29,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 22:45:29,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 22:45:29,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 22:45:29,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 22:45:29,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 22:45:29,139 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 22:45:29,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 22:45:29,139 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 22:45:29,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 22:45:29,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 22:45:29,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 22:45:29,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-10-13 22:45:29,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 22:45:29,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 22:45:29,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 22:45:29,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 22:45:29,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 22:45:29,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 22:45:29,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 22:45:29,141 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-13 22:45:29,141 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-13 22:45:29,141 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 [2021-10-13 22:45:29,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 22:45:29,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 22:45:29,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 22:45:29,350 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 22:45:29,352 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 22:45:29,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2021-10-13 22:45:29,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57398b94e/05b71e3db1dc4ea3bd9868c03491ee24/FLAG3f55a9311 [2021-10-13 22:45:29,902 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 22:45:29,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2021-10-13 22:45:29,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57398b94e/05b71e3db1dc4ea3bd9868c03491ee24/FLAG3f55a9311 [2021-10-13 22:45:30,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57398b94e/05b71e3db1dc4ea3bd9868c03491ee24 [2021-10-13 22:45:30,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 22:45:30,440 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-13 22:45:30,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 22:45:30,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 22:45:30,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 22:45:30,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:45:30" (1/1) ... [2021-10-13 22:45:30,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e5d721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:30, skipping insertion in model container [2021-10-13 22:45:30,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:45:30" (1/1) ... [2021-10-13 22:45:30,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 22:45:30,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 22:45:30,881 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2021-10-13 22:45:30,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 22:45:30,917 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 22:45:30,959 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i[76077,76090] [2021-10-13 22:45:30,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 22:45:31,040 INFO L208 MainTranslator]: Completed translation [2021-10-13 22:45:31,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31 WrapperNode [2021-10-13 22:45:31,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 22:45:31,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 22:45:31,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 22:45:31,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 22:45:31,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (1/1) ... [2021-10-13 22:45:31,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (1/1) ... [2021-10-13 22:45:31,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 22:45:31,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 22:45:31,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 22:45:31,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 22:45:31,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (1/1) ... [2021-10-13 22:45:31,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (1/1) ... [2021-10-13 22:45:31,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (1/1) ... [2021-10-13 22:45:31,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (1/1) ... [2021-10-13 22:45:31,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (1/1) ... [2021-10-13 22:45:31,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (1/1) ... [2021-10-13 22:45:31,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (1/1) ... [2021-10-13 22:45:31,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 22:45:31,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 22:45:31,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 22:45:31,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 22:45:31,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (1/1) ... [2021-10-13 22:45:31,141 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 22:45:31,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-10-13 22:45:31,157 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-10-13 22:45:31,158 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-10-13 22:45:31,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 22:45:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 22:45:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-10-13 22:45:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 22:45:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 22:45:31,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 22:45:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-10-13 22:45:31,182 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-10-13 22:45:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 22:45:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 22:45:31,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 22:45:31,183 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-13 22:45:31,607 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 22:45:31,608 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-10-13 22:45:31,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:45:31 BoogieIcfgContainer [2021-10-13 22:45:31,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 22:45:31,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 22:45:31,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 22:45:31,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 22:45:31,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:45:30" (1/3) ... [2021-10-13 22:45:31,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0462b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:45:31, skipping insertion in model container [2021-10-13 22:45:31,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:45:31" (2/3) ... [2021-10-13 22:45:31,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0462b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:45:31, skipping insertion in model container [2021-10-13 22:45:31,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:45:31" (3/3) ... [2021-10-13 22:45:31,615 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2021-10-13 22:45:31,618 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 22:45:31,618 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-10-13 22:45:31,618 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 22:45:31,650 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,650 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,650 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,650 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,651 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,652 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,652 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,652 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,652 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,652 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,652 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,652 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,653 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,653 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,653 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,653 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,653 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,653 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,654 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,655 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,655 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,655 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,655 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,655 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,655 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,655 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,656 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,656 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,656 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,657 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,658 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,658 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,658 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,658 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,658 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,659 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,660 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,660 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,660 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,660 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,660 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,660 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,660 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,661 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,662 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,663 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,663 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,664 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,665 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,669 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,669 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,669 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,669 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,670 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,670 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,670 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,670 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,671 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,671 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,671 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,671 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,671 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,671 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,671 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,671 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,671 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,672 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,673 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,675 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,675 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,675 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,676 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,676 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,676 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,680 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,680 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,680 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,680 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,681 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,681 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 22:45:31,686 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-13 22:45:31,719 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 22:45:31,724 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=false, mConcurrency=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-10-13 22:45:31,726 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-10-13 22:45:31,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 167 places, 169 transitions, 354 flow [2021-10-13 22:45:31,798 INFO L129 PetriNetUnfolder]: 10/205 cut-off events. [2021-10-13 22:45:31,798 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-13 22:45:31,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 205 events. 10/205 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 360 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 120. Up to 4 conditions per place. [2021-10-13 22:45:31,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 169 transitions, 354 flow [2021-10-13 22:45:31,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 157 transitions, 326 flow [2021-10-13 22:45:31,811 INFO L129 PetriNetUnfolder]: 1/38 cut-off events. [2021-10-13 22:45:31,811 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-13 22:45:31,811 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:31,811 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] [2021-10-13 22:45:31,812 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-10-13 22:45:31,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:31,815 INFO L82 PathProgramCache]: Analyzing trace with hash -988927327, now seen corresponding path program 1 times [2021-10-13 22:45:31,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:31,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087400249] [2021-10-13 22:45:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:31,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:32,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:32,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087400249] [2021-10-13 22:45:32,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087400249] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:32,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:32,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 22:45:32,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044984964] [2021-10-13 22:45:32,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 22:45:32,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 22:45:32,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 22:45:32,195 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 169 [2021-10-13 22:45:32,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 157 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 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-10-13 22:45:32,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:32,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 169 [2021-10-13 22:45:32,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:32,523 INFO L129 PetriNetUnfolder]: 355/991 cut-off events. [2021-10-13 22:45:32,523 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-13 22:45:32,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 991 events. 355/991 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6035 event pairs, 210 based on Foata normal form. 20/968 useless extension candidates. Maximal degree in co-relation 1457. Up to 381 conditions per place. [2021-10-13 22:45:32,534 INFO L132 encePairwiseOnDemand]: 147/169 looper letters, 49 selfloop transitions, 17 changer transitions 1/153 dead transitions. [2021-10-13 22:45:32,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 452 flow [2021-10-13 22:45:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 22:45:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-10-13 22:45:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 936 transitions. [2021-10-13 22:45:32,550 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2021-10-13 22:45:32,550 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 936 transitions. [2021-10-13 22:45:32,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 936 transitions. [2021-10-13 22:45:32,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:32,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 936 transitions. [2021-10-13 22:45:32,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.0) internal successors, (936), 9 states have internal predecessors, (936), 0 states have call successors, (0), 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-10-13 22:45:32,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 0 states have call successors, (0), 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-10-13 22:45:32,568 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 169.0) internal successors, (1690), 10 states have internal predecessors, (1690), 0 states have call successors, (0), 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-10-13 22:45:32,570 INFO L186 Difference]: Start difference. First operand has 157 places, 157 transitions, 326 flow. Second operand 9 states and 936 transitions. [2021-10-13 22:45:32,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 153 transitions, 452 flow [2021-10-13 22:45:32,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 153 transitions, 444 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-10-13 22:45:32,578 INFO L242 Difference]: Finished difference. Result has 155 places, 146 transitions, 337 flow [2021-10-13 22:45:32,579 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=337, PETRI_PLACES=155, PETRI_TRANSITIONS=146} [2021-10-13 22:45:32,580 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, -2 predicate places. [2021-10-13 22:45:32,580 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 146 transitions, 337 flow [2021-10-13 22:45:32,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 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-10-13 22:45:32,581 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:32,581 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] [2021-10-13 22:45:32,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 22:45:32,584 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-10-13 22:45:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1449842663, now seen corresponding path program 1 times [2021-10-13 22:45:32,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:32,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899158181] [2021-10-13 22:45:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:32,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:32,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:32,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899158181] [2021-10-13 22:45:32,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899158181] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:32,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:32,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 22:45:32,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648267753] [2021-10-13 22:45:32,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 22:45:32,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:32,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 22:45:32,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 22:45:32,709 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 169 [2021-10-13 22:45:32,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 146 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 22:45:32,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:32,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 169 [2021-10-13 22:45:32,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:32,910 INFO L129 PetriNetUnfolder]: 355/930 cut-off events. [2021-10-13 22:45:32,910 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-10-13 22:45:32,912 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 930 events. 355/930 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5480 event pairs, 114 based on Foata normal form. 1/909 useless extension candidates. Maximal degree in co-relation 857. Up to 262 conditions per place. [2021-10-13 22:45:32,915 INFO L132 encePairwiseOnDemand]: 150/169 looper letters, 57 selfloop transitions, 18 changer transitions 1/161 dead transitions. [2021-10-13 22:45:32,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 161 transitions, 521 flow [2021-10-13 22:45:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 22:45:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-10-13 22:45:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1037 transitions. [2021-10-13 22:45:32,917 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6136094674556213 [2021-10-13 22:45:32,917 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1037 transitions. [2021-10-13 22:45:32,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1037 transitions. [2021-10-13 22:45:32,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:32,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1037 transitions. [2021-10-13 22:45:32,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.7) internal successors, (1037), 10 states have internal predecessors, (1037), 0 states have call successors, (0), 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-10-13 22:45:32,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 169.0) internal successors, (1859), 11 states have internal predecessors, (1859), 0 states have call successors, (0), 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-10-13 22:45:32,922 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 169.0) internal successors, (1859), 11 states have internal predecessors, (1859), 0 states have call successors, (0), 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-10-13 22:45:32,923 INFO L186 Difference]: Start difference. First operand has 155 places, 146 transitions, 337 flow. Second operand 10 states and 1037 transitions. [2021-10-13 22:45:32,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 161 transitions, 521 flow [2021-10-13 22:45:32,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 161 transitions, 492 flow, removed 0 selfloop flow, removed 7 redundant places. [2021-10-13 22:45:32,927 INFO L242 Difference]: Finished difference. Result has 156 places, 145 transitions, 348 flow [2021-10-13 22:45:32,927 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=348, PETRI_PLACES=156, PETRI_TRANSITIONS=145} [2021-10-13 22:45:32,927 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, -1 predicate places. [2021-10-13 22:45:32,927 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 145 transitions, 348 flow [2021-10-13 22:45:32,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 22:45:32,928 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:32,928 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] [2021-10-13 22:45:32,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 22:45:32,928 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-10-13 22:45:32,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash 53531805, now seen corresponding path program 1 times [2021-10-13 22:45:32,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:32,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953312203] [2021-10-13 22:45:32,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:32,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:33,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:33,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953312203] [2021-10-13 22:45:33,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953312203] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:33,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:33,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 22:45:33,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934104485] [2021-10-13 22:45:33,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 22:45:33,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:33,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 22:45:33,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 22:45:33,003 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 169 [2021-10-13 22:45:33,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 145 transitions, 348 flow. Second operand has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 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-10-13 22:45:33,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:33,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 169 [2021-10-13 22:45:33,004 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:33,355 INFO L129 PetriNetUnfolder]: 826/1944 cut-off events. [2021-10-13 22:45:33,356 INFO L130 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2021-10-13 22:45:33,359 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1944 events. 826/1944 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12754 event pairs, 163 based on Foata normal form. 32/1963 useless extension candidates. Maximal degree in co-relation 953. Up to 483 conditions per place. [2021-10-13 22:45:33,365 INFO L132 encePairwiseOnDemand]: 148/169 looper letters, 96 selfloop transitions, 49 changer transitions 0/230 dead transitions. [2021-10-13 22:45:33,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 230 transitions, 824 flow [2021-10-13 22:45:33,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 22:45:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-10-13 22:45:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1367 transitions. [2021-10-13 22:45:33,368 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.622212107419208 [2021-10-13 22:45:33,368 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1367 transitions. [2021-10-13 22:45:33,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1367 transitions. [2021-10-13 22:45:33,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:33,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1367 transitions. [2021-10-13 22:45:33,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 105.15384615384616) internal successors, (1367), 13 states have internal predecessors, (1367), 0 states have call successors, (0), 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-10-13 22:45:33,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 169.0) internal successors, (2366), 14 states have internal predecessors, (2366), 0 states have call successors, (0), 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-10-13 22:45:33,373 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 169.0) internal successors, (2366), 14 states have internal predecessors, (2366), 0 states have call successors, (0), 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-10-13 22:45:33,373 INFO L186 Difference]: Start difference. First operand has 156 places, 145 transitions, 348 flow. Second operand 13 states and 1367 transitions. [2021-10-13 22:45:33,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 230 transitions, 824 flow [2021-10-13 22:45:33,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 230 transitions, 778 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-10-13 22:45:33,378 INFO L242 Difference]: Finished difference. Result has 168 places, 182 transitions, 618 flow [2021-10-13 22:45:33,378 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=618, PETRI_PLACES=168, PETRI_TRANSITIONS=182} [2021-10-13 22:45:33,378 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 11 predicate places. [2021-10-13 22:45:33,378 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 182 transitions, 618 flow [2021-10-13 22:45:33,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.33333333333333) internal successors, (590), 6 states have internal predecessors, (590), 0 states have call successors, (0), 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-10-13 22:45:33,379 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:33,379 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] [2021-10-13 22:45:33,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 22:45:33,379 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-10-13 22:45:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:33,379 INFO L82 PathProgramCache]: Analyzing trace with hash 143085669, now seen corresponding path program 1 times [2021-10-13 22:45:33,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:33,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141047708] [2021-10-13 22:45:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:33,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:33,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:33,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141047708] [2021-10-13 22:45:33,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141047708] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:33,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:33,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 22:45:33,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433030911] [2021-10-13 22:45:33,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 22:45:33,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:33,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 22:45:33,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 22:45:33,496 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 169 [2021-10-13 22:45:33,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 182 transitions, 618 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 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-10-13 22:45:33,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:33,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 169 [2021-10-13 22:45:33,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:33,946 INFO L129 PetriNetUnfolder]: 1079/2463 cut-off events. [2021-10-13 22:45:33,946 INFO L130 PetriNetUnfolder]: For 10528/10549 co-relation queries the response was YES. [2021-10-13 22:45:33,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8917 conditions, 2463 events. 1079/2463 cut-off events. For 10528/10549 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 17255 event pairs, 212 based on Foata normal form. 47/2497 useless extension candidates. Maximal degree in co-relation 7621. Up to 716 conditions per place. [2021-10-13 22:45:33,964 INFO L132 encePairwiseOnDemand]: 150/169 looper letters, 70 selfloop transitions, 48 changer transitions 68/271 dead transitions. [2021-10-13 22:45:33,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 271 transitions, 1694 flow [2021-10-13 22:45:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 22:45:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-10-13 22:45:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1160 transitions. [2021-10-13 22:45:33,967 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6239913932221625 [2021-10-13 22:45:33,967 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1160 transitions. [2021-10-13 22:45:33,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1160 transitions. [2021-10-13 22:45:33,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:33,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1160 transitions. [2021-10-13 22:45:33,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 105.45454545454545) internal successors, (1160), 11 states have internal predecessors, (1160), 0 states have call successors, (0), 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-10-13 22:45:33,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 169.0) internal successors, (2028), 12 states have internal predecessors, (2028), 0 states have call successors, (0), 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-10-13 22:45:33,972 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 169.0) internal successors, (2028), 12 states have internal predecessors, (2028), 0 states have call successors, (0), 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-10-13 22:45:33,972 INFO L186 Difference]: Start difference. First operand has 168 places, 182 transitions, 618 flow. Second operand 11 states and 1160 transitions. [2021-10-13 22:45:33,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 271 transitions, 1694 flow [2021-10-13 22:45:33,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 271 transitions, 1694 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-10-13 22:45:33,988 INFO L242 Difference]: Finished difference. Result has 186 places, 189 transitions, 933 flow [2021-10-13 22:45:33,988 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=933, PETRI_PLACES=186, PETRI_TRANSITIONS=189} [2021-10-13 22:45:33,988 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 29 predicate places. [2021-10-13 22:45:33,988 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 189 transitions, 933 flow [2021-10-13 22:45:33,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 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-10-13 22:45:33,989 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:33,989 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] [2021-10-13 22:45:33,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 22:45:33,989 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-10-13 22:45:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:33,990 INFO L82 PathProgramCache]: Analyzing trace with hash 227354099, now seen corresponding path program 1 times [2021-10-13 22:45:33,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:33,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149122667] [2021-10-13 22:45:33,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:33,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:34,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:34,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149122667] [2021-10-13 22:45:34,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149122667] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:34,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:34,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 22:45:34,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928840148] [2021-10-13 22:45:34,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 22:45:34,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:34,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 22:45:34,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 22:45:34,062 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 169 [2021-10-13 22:45:34,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 189 transitions, 933 flow. Second operand has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 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-10-13 22:45:34,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:34,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 169 [2021-10-13 22:45:34,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:34,095 INFO L129 PetriNetUnfolder]: 4/150 cut-off events. [2021-10-13 22:45:34,095 INFO L130 PetriNetUnfolder]: For 455/515 co-relation queries the response was YES. [2021-10-13 22:45:34,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 150 events. 4/150 cut-off events. For 455/515 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 182 event pairs, 4 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 313. Up to 13 conditions per place. [2021-10-13 22:45:34,096 INFO L132 encePairwiseOnDemand]: 164/169 looper letters, 5 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2021-10-13 22:45:34,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 122 transitions, 394 flow [2021-10-13 22:45:34,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 22:45:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-10-13 22:45:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 886 transitions. [2021-10-13 22:45:34,098 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.873767258382643 [2021-10-13 22:45:34,098 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 886 transitions. [2021-10-13 22:45:34,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 886 transitions. [2021-10-13 22:45:34,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:34,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 886 transitions. [2021-10-13 22:45:34,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.66666666666666) internal successors, (886), 6 states have internal predecessors, (886), 0 states have call successors, (0), 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-10-13 22:45:34,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-10-13 22:45:34,101 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 169.0) internal successors, (1183), 7 states have internal predecessors, (1183), 0 states have call successors, (0), 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-10-13 22:45:34,102 INFO L186 Difference]: Start difference. First operand has 186 places, 189 transitions, 933 flow. Second operand 6 states and 886 transitions. [2021-10-13 22:45:34,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 122 transitions, 394 flow [2021-10-13 22:45:34,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 122 transitions, 274 flow, removed 40 selfloop flow, removed 19 redundant places. [2021-10-13 22:45:34,104 INFO L242 Difference]: Finished difference. Result has 135 places, 122 transitions, 264 flow [2021-10-13 22:45:34,105 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=135, PETRI_TRANSITIONS=122} [2021-10-13 22:45:34,105 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, -22 predicate places. [2021-10-13 22:45:34,105 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 122 transitions, 264 flow [2021-10-13 22:45:34,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 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-10-13 22:45:34,105 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:34,106 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] [2021-10-13 22:45:34,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 22:45:34,106 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-10-13 22:45:34,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash 2107923556, now seen corresponding path program 1 times [2021-10-13 22:45:34,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:34,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222947695] [2021-10-13 22:45:34,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:34,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:34,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:34,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222947695] [2021-10-13 22:45:34,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222947695] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:34,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:34,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-10-13 22:45:34,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244012278] [2021-10-13 22:45:34,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-13 22:45:34,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:34,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-13 22:45:34,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-10-13 22:45:34,790 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 169 [2021-10-13 22:45:34,792 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 122 transitions, 264 flow. Second operand has 18 states, 18 states have (on average 117.94444444444444) internal successors, (2123), 18 states have internal predecessors, (2123), 0 states have call successors, (0), 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-10-13 22:45:34,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:34,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 169 [2021-10-13 22:45:34,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:36,125 INFO L129 PetriNetUnfolder]: 398/1224 cut-off events. [2021-10-13 22:45:36,125 INFO L130 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2021-10-13 22:45:36,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2106 conditions, 1224 events. 398/1224 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8595 event pairs, 57 based on Foata normal form. 8/1186 useless extension candidates. Maximal degree in co-relation 2098. Up to 208 conditions per place. [2021-10-13 22:45:36,131 INFO L132 encePairwiseOnDemand]: 151/169 looper letters, 108 selfloop transitions, 22 changer transitions 0/216 dead transitions. [2021-10-13 22:45:36,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 216 transitions, 761 flow [2021-10-13 22:45:36,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 22:45:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-13 22:45:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2103 transitions. [2021-10-13 22:45:36,135 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7319874695440306 [2021-10-13 22:45:36,135 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2103 transitions. [2021-10-13 22:45:36,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2103 transitions. [2021-10-13 22:45:36,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:36,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2103 transitions. [2021-10-13 22:45:36,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 123.70588235294117) internal successors, (2103), 17 states have internal predecessors, (2103), 0 states have call successors, (0), 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-10-13 22:45:36,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 169.0) internal successors, (3042), 18 states have internal predecessors, (3042), 0 states have call successors, (0), 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-10-13 22:45:36,143 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 169.0) internal successors, (3042), 18 states have internal predecessors, (3042), 0 states have call successors, (0), 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-10-13 22:45:36,143 INFO L186 Difference]: Start difference. First operand has 135 places, 122 transitions, 264 flow. Second operand 17 states and 2103 transitions. [2021-10-13 22:45:36,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 216 transitions, 761 flow [2021-10-13 22:45:36,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 216 transitions, 754 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-10-13 22:45:36,146 INFO L242 Difference]: Finished difference. Result has 153 places, 134 transitions, 360 flow [2021-10-13 22:45:36,146 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=360, PETRI_PLACES=153, PETRI_TRANSITIONS=134} [2021-10-13 22:45:36,147 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, -4 predicate places. [2021-10-13 22:45:36,147 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 134 transitions, 360 flow [2021-10-13 22:45:36,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 117.94444444444444) internal successors, (2123), 18 states have internal predecessors, (2123), 0 states have call successors, (0), 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-10-13 22:45:36,147 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:36,148 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] [2021-10-13 22:45:36,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 22:45:36,148 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-10-13 22:45:36,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash 137945982, now seen corresponding path program 2 times [2021-10-13 22:45:36,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:36,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361531791] [2021-10-13 22:45:36,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:36,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:36,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:36,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361531791] [2021-10-13 22:45:36,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361531791] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:36,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:36,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:45:36,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131708813] [2021-10-13 22:45:36,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:45:36,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:36,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:45:36,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:45:36,626 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:45:36,627 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 134 transitions, 360 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:36,627 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:36,627 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:45:36,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:37,359 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([367] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= |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)))) (= |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))) (= (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$.base_17|))) 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][113], [369#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= ULTIMATE.start_my_drv_probe_~d~0.offset (+ ULTIMATE.start_my_drv_probe_~data.offset 24)) (= |ULTIMATE.start_main_~#data~1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork1_~dev~0.base |ULTIMATE.start_main_~#data~1.base|) (<= (+ ULTIMATE.start_my_drv_probe_~data.offset 24) ULTIMATE.start_my_drv_probe_~d~0.offset) (= |ULTIMATE.start_main_~#data~1.base| ULTIMATE.start_my_drv_probe_~d~0.base) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork1_~arg.base |ULTIMATE.start_main_~#data~1.base|) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~data.base |ULTIMATE.start_main_~#data~1.base|) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (not (= ULTIMATE.start_ldv_assert_~expression 0)) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0) (= |ULTIMATE.start_my_drv_probe_#in~data.base| |ULTIMATE.start_main_~#data~1.base|)), Black: 260#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem51| 1) 0)), Black: 323#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), 84#L1735true, Black: 317#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 227#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem50| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0))), Black: 319#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 256#(and (= (+ |ULTIMATE.start_main_#t~mem51| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0))), Black: 325#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 321#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 258#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem51| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0))), Black: 327#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (<= my_callbackThread1of1ForFork0_~data~0.offset 0) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (< 0 (+ my_callbackThread1of1ForFork0_~data~0.offset 1)) (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 219#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem50| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#data~1.base|) (+ 28 |ULTIMATE.start_main_~#data~1.offset|) (- 1)) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1) 0)), 315#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), 21#L1714true, 22#L1711-1true, 280#(and (= ULTIMATE.start_main_~probe_ret~0 0) (= |ULTIMATE.start_my_drv_probe_#res| 0))]) [2021-10-13 22:45:37,361 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2021-10-13 22:45:37,361 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-10-13 22:45:37,361 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-10-13 22:45:37,362 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2021-10-13 22:45:37,371 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([367] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= |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)))) (= |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))) (= (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$.base_17|))) 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][113], [369#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= ULTIMATE.start_my_drv_probe_~d~0.offset (+ ULTIMATE.start_my_drv_probe_~data.offset 24)) (= |ULTIMATE.start_main_~#data~1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork1_~dev~0.base |ULTIMATE.start_main_~#data~1.base|) (<= (+ ULTIMATE.start_my_drv_probe_~data.offset 24) ULTIMATE.start_my_drv_probe_~d~0.offset) (= |ULTIMATE.start_main_~#data~1.base| ULTIMATE.start_my_drv_probe_~d~0.base) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork1_~arg.base |ULTIMATE.start_main_~#data~1.base|) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~data.base |ULTIMATE.start_main_~#data~1.base|) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (not (= ULTIMATE.start_ldv_assert_~expression 0)) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0) (= |ULTIMATE.start_my_drv_probe_#in~data.base| |ULTIMATE.start_main_~#data~1.base|)), 83#L1735-2true, Black: 260#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem51| 1) 0)), Black: 323#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 317#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 227#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem50| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0))), Black: 319#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 325#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 256#(and (= (+ |ULTIMATE.start_main_#t~mem51| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0))), Black: 321#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 258#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem51| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0))), Black: 327#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (<= my_callbackThread1of1ForFork0_~data~0.offset 0) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (< 0 (+ my_callbackThread1of1ForFork0_~data~0.offset 1)) (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 219#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem50| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#data~1.base|) (+ 28 |ULTIMATE.start_main_~#data~1.offset|) (- 1)) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1) 0)), 315#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), 22#L1711-1true, 280#(and (= ULTIMATE.start_main_~probe_ret~0 0) (= |ULTIMATE.start_my_drv_probe_#res| 0))]) [2021-10-13 22:45:37,371 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2021-10-13 22:45:37,371 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-10-13 22:45:37,371 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-10-13 22:45:37,372 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2021-10-13 22:45:37,375 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([367] L1711-->L1711-1: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= |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)))) (= |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))) (= (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$.base_17|))) 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][113], [369#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= ULTIMATE.start_my_drv_probe_~d~0.offset (+ ULTIMATE.start_my_drv_probe_~data.offset 24)) (= |ULTIMATE.start_main_~#data~1.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork1_~dev~0.base |ULTIMATE.start_main_~#data~1.base|) (<= (+ ULTIMATE.start_my_drv_probe_~data.offset 24) ULTIMATE.start_my_drv_probe_~d~0.offset) (= |ULTIMATE.start_main_~#data~1.base| ULTIMATE.start_my_drv_probe_~d~0.base) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= my_callbackThread1of1ForFork1_~arg.base |ULTIMATE.start_main_~#data~1.base|) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~data.base |ULTIMATE.start_main_~#data~1.base|) (= (select |#valid| |ULTIMATE.start_main_~#data~1.base|) 1) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (= |ULTIMATE.start_main_~#data~1.base| my_callbackThread1of1ForFork1_~__mptr~0.base) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (not (= ULTIMATE.start_ldv_assert_~expression 0)) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0) (= |ULTIMATE.start_my_drv_probe_#in~data.base| |ULTIMATE.start_main_~#data~1.base|)), 42#L1736-1true, Black: 260#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem51| 1) 0)), Black: 323#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 317#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 227#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem50| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0))), Black: 319#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 325#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 256#(and (= (+ |ULTIMATE.start_main_#t~mem51| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0))), Black: 321#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 258#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem51| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0))), Black: 327#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= my_callbackThread1of1ForFork0_~dev~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 |my_callbackThread1of1ForFork0_#in~arg.offset|) (<= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork0_~arg.offset 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= my_callbackThread1of1ForFork0_~arg.base my_callbackThread1of1ForFork1_~data~0.base) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= my_callbackThread1of1ForFork0_~dev~0.offset 24) (<= my_callbackThread1of1ForFork0_~data~0.offset 0) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (< 0 (+ my_callbackThread1of1ForFork0_~data~0.offset 1)) (= my_callbackThread1of1ForFork0_~__mptr~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork0_~__mptr~0.offset) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 my_callbackThread1of1ForFork0_~arg.offset) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= my_callbackThread1of1ForFork1_~data~0.base my_callbackThread1of1ForFork0_~data~0.base) (<= my_callbackThread1of1ForFork0_~__mptr~0.offset 24) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (<= 24 my_callbackThread1of1ForFork0_~dev~0.offset) (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) my_callbackThread1of1ForFork1_~data~0.offset) 1) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), Black: 219#(and (not (= |ULTIMATE.start_ldv_assert_#in~expression| 0)) (= (+ |ULTIMATE.start_main_#t~mem50| 1) 0) (not (= ULTIMATE.start_ldv_assert_~expression 0)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~#data~1.base|) (+ 28 |ULTIMATE.start_main_~#data~1.offset|) (- 1)) (+ |ULTIMATE.start_main_~#data~1.offset| 24)) 1) 0)), 315#(and (= |ULTIMATE.start_main_~#data~1.offset| 0) (<= my_callbackThread1of1ForFork1_~__mptr~0.offset 24) (<= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (<= my_callbackThread1of1ForFork1_~dev~0.offset 24) (<= 24 |my_callbackThread1of1ForFork1_#in~arg.offset|) (= ULTIMATE.start_my_drv_probe_~d~0.base my_callbackThread1of1ForFork1_~data~0.base) (<= ULTIMATE.start_my_drv_probe_~d~0.offset 24) (<= 24 my_callbackThread1of1ForFork1_~arg.offset) (= my_callbackThread1of1ForFork1_~__mptr~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= my_callbackThread1of1ForFork1_~arg.base ULTIMATE.start_my_drv_probe_~d~0.base) (<= 24 my_callbackThread1of1ForFork1_~dev~0.offset) (= ULTIMATE.start_my_drv_probe_~d~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (<= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~data~0.offset 0) (<= 24 ULTIMATE.start_my_drv_probe_~d~0.offset) (<= 24 my_callbackThread1of1ForFork1_~__mptr~0.offset) (= my_callbackThread1of1ForFork1_~dev~0.base ULTIMATE.start_my_drv_probe_~d~0.base) (= ULTIMATE.start_my_drv_probe_~data.offset 0) (= |ULTIMATE.start_my_drv_probe_#in~data.offset| 0)), 22#L1711-1true, 280#(and (= ULTIMATE.start_main_~probe_ret~0 0) (= |ULTIMATE.start_my_drv_probe_#res| 0))]) [2021-10-13 22:45:37,375 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-10-13 22:45:37,375 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-10-13 22:45:37,375 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-10-13 22:45:37,375 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-10-13 22:45:37,676 INFO L129 PetriNetUnfolder]: 553/1588 cut-off events. [2021-10-13 22:45:37,676 INFO L130 PetriNetUnfolder]: For 384/411 co-relation queries the response was YES. [2021-10-13 22:45:37,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3433 conditions, 1588 events. 553/1588 cut-off events. For 384/411 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11464 event pairs, 77 based on Foata normal form. 9/1578 useless extension candidates. Maximal degree in co-relation 3419. Up to 319 conditions per place. [2021-10-13 22:45:37,684 INFO L132 encePairwiseOnDemand]: 141/169 looper letters, 128 selfloop transitions, 30 changer transitions 0/219 dead transitions. [2021-10-13 22:45:37,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 219 transitions, 934 flow [2021-10-13 22:45:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-13 22:45:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-13 22:45:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1579 transitions. [2021-10-13 22:45:37,688 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4671597633136095 [2021-10-13 22:45:37,688 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1579 transitions. [2021-10-13 22:45:37,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1579 transitions. [2021-10-13 22:45:37,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:37,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1579 transitions. [2021-10-13 22:45:37,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 78.95) internal successors, (1579), 20 states have internal predecessors, (1579), 0 states have call successors, (0), 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-10-13 22:45:37,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 169.0) internal successors, (3549), 21 states have internal predecessors, (3549), 0 states have call successors, (0), 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-10-13 22:45:37,694 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 169.0) internal successors, (3549), 21 states have internal predecessors, (3549), 0 states have call successors, (0), 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-10-13 22:45:37,695 INFO L186 Difference]: Start difference. First operand has 153 places, 134 transitions, 360 flow. Second operand 20 states and 1579 transitions. [2021-10-13 22:45:37,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 219 transitions, 934 flow [2021-10-13 22:45:37,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 219 transitions, 917 flow, removed 0 selfloop flow, removed 9 redundant places. [2021-10-13 22:45:37,698 INFO L242 Difference]: Finished difference. Result has 171 places, 149 transitions, 498 flow [2021-10-13 22:45:37,699 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=498, PETRI_PLACES=171, PETRI_TRANSITIONS=149} [2021-10-13 22:45:37,699 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 14 predicate places. [2021-10-13 22:45:37,699 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 149 transitions, 498 flow [2021-10-13 22:45:37,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:37,699 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:37,700 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] [2021-10-13 22:45:37,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 22:45:37,700 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-10-13 22:45:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1268382172, now seen corresponding path program 3 times [2021-10-13 22:45:37,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:37,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194185054] [2021-10-13 22:45:37,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:37,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:38,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:38,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194185054] [2021-10-13 22:45:38,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194185054] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:38,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:38,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-13 22:45:38,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912325543] [2021-10-13 22:45:38,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-13 22:45:38,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:38,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-13 22:45:38,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2021-10-13 22:45:38,264 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2021-10-13 22:45:38,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 149 transitions, 498 flow. Second operand has 22 states, 22 states have (on average 77.63636363636364) internal successors, (1708), 22 states have internal predecessors, (1708), 0 states have call successors, (0), 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-10-13 22:45:38,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:38,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2021-10-13 22:45:38,266 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:40,186 INFO L129 PetriNetUnfolder]: 1746/4006 cut-off events. [2021-10-13 22:45:40,186 INFO L130 PetriNetUnfolder]: For 2502/2517 co-relation queries the response was YES. [2021-10-13 22:45:40,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10036 conditions, 4006 events. 1746/4006 cut-off events. For 2502/2517 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 32885 event pairs, 150 based on Foata normal form. 19/3834 useless extension candidates. Maximal degree in co-relation 10015. Up to 1217 conditions per place. [2021-10-13 22:45:40,216 INFO L132 encePairwiseOnDemand]: 143/169 looper letters, 212 selfloop transitions, 33 changer transitions 0/307 dead transitions. [2021-10-13 22:45:40,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 307 transitions, 1637 flow [2021-10-13 22:45:40,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-13 22:45:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-10-13 22:45:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1929 transitions. [2021-10-13 22:45:40,220 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4962696166709545 [2021-10-13 22:45:40,220 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1929 transitions. [2021-10-13 22:45:40,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1929 transitions. [2021-10-13 22:45:40,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:40,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1929 transitions. [2021-10-13 22:45:40,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 83.8695652173913) internal successors, (1929), 23 states have internal predecessors, (1929), 0 states have call successors, (0), 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-10-13 22:45:40,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 169.0) internal successors, (4056), 24 states have internal predecessors, (4056), 0 states have call successors, (0), 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-10-13 22:45:40,228 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 169.0) internal successors, (4056), 24 states have internal predecessors, (4056), 0 states have call successors, (0), 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-10-13 22:45:40,228 INFO L186 Difference]: Start difference. First operand has 171 places, 149 transitions, 498 flow. Second operand 23 states and 1929 transitions. [2021-10-13 22:45:40,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 307 transitions, 1637 flow [2021-10-13 22:45:40,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 307 transitions, 1596 flow, removed 0 selfloop flow, removed 9 redundant places. [2021-10-13 22:45:40,241 INFO L242 Difference]: Finished difference. Result has 193 places, 162 transitions, 661 flow [2021-10-13 22:45:40,241 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=661, PETRI_PLACES=193, PETRI_TRANSITIONS=162} [2021-10-13 22:45:40,241 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 36 predicate places. [2021-10-13 22:45:40,241 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 162 transitions, 661 flow [2021-10-13 22:45:40,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 77.63636363636364) internal successors, (1708), 22 states have internal predecessors, (1708), 0 states have call successors, (0), 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-10-13 22:45:40,242 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:40,242 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] [2021-10-13 22:45:40,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 22:45:40,242 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-10-13 22:45:40,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1666451822, now seen corresponding path program 4 times [2021-10-13 22:45:40,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:40,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716506728] [2021-10-13 22:45:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:40,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:40,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:40,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716506728] [2021-10-13 22:45:40,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716506728] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:40,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:40,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:45:40,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039106082] [2021-10-13 22:45:40,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:45:40,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:40,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:45:40,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:45:40,703 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:45:40,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 162 transitions, 661 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:40,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:40,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:45:40,704 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:42,064 INFO L129 PetriNetUnfolder]: 1230/3486 cut-off events. [2021-10-13 22:45:42,064 INFO L130 PetriNetUnfolder]: For 3811/3892 co-relation queries the response was YES. [2021-10-13 22:45:42,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9287 conditions, 3486 events. 1230/3486 cut-off events. For 3811/3892 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 29622 event pairs, 497 based on Foata normal form. 11/3446 useless extension candidates. Maximal degree in co-relation 9256. Up to 1095 conditions per place. [2021-10-13 22:45:42,087 INFO L132 encePairwiseOnDemand]: 143/169 looper letters, 155 selfloop transitions, 38 changer transitions 0/263 dead transitions. [2021-10-13 22:45:42,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 263 transitions, 1484 flow [2021-10-13 22:45:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 22:45:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-13 22:45:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1738 transitions. [2021-10-13 22:45:42,090 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.46745562130177515 [2021-10-13 22:45:42,090 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1738 transitions. [2021-10-13 22:45:42,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1738 transitions. [2021-10-13 22:45:42,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:42,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1738 transitions. [2021-10-13 22:45:42,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 79.0) internal successors, (1738), 22 states have internal predecessors, (1738), 0 states have call successors, (0), 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-10-13 22:45:42,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:45:42,099 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:45:42,099 INFO L186 Difference]: Start difference. First operand has 193 places, 162 transitions, 661 flow. Second operand 22 states and 1738 transitions. [2021-10-13 22:45:42,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 263 transitions, 1484 flow [2021-10-13 22:45:42,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 263 transitions, 1440 flow, removed 7 selfloop flow, removed 13 redundant places. [2021-10-13 22:45:42,110 INFO L242 Difference]: Finished difference. Result has 212 places, 184 transitions, 881 flow [2021-10-13 22:45:42,111 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=881, PETRI_PLACES=212, PETRI_TRANSITIONS=184} [2021-10-13 22:45:42,111 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 55 predicate places. [2021-10-13 22:45:42,111 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 184 transitions, 881 flow [2021-10-13 22:45:42,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:42,112 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:42,112 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] [2021-10-13 22:45:42,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 22:45:42,112 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-10-13 22:45:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1626127120, now seen corresponding path program 5 times [2021-10-13 22:45:42,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:42,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556287914] [2021-10-13 22:45:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:42,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:42,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:42,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556287914] [2021-10-13 22:45:42,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556287914] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:42,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:42,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:45:42,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25311233] [2021-10-13 22:45:42,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:45:42,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:45:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:45:42,674 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:45:42,675 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 184 transitions, 881 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:42,675 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:42,675 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:45:42,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:44,288 INFO L129 PetriNetUnfolder]: 2191/5567 cut-off events. [2021-10-13 22:45:44,288 INFO L130 PetriNetUnfolder]: For 9947/10111 co-relation queries the response was YES. [2021-10-13 22:45:44,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16593 conditions, 5567 events. 2191/5567 cut-off events. For 9947/10111 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 50179 event pairs, 252 based on Foata normal form. 36/5484 useless extension candidates. Maximal degree in co-relation 16551. Up to 1061 conditions per place. [2021-10-13 22:45:44,324 INFO L132 encePairwiseOnDemand]: 141/169 looper letters, 173 selfloop transitions, 54 changer transitions 0/295 dead transitions. [2021-10-13 22:45:44,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 295 transitions, 1992 flow [2021-10-13 22:45:44,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-13 22:45:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-13 22:45:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1582 transitions. [2021-10-13 22:45:44,327 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4680473372781065 [2021-10-13 22:45:44,327 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1582 transitions. [2021-10-13 22:45:44,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1582 transitions. [2021-10-13 22:45:44,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:44,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1582 transitions. [2021-10-13 22:45:44,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 79.1) internal successors, (1582), 20 states have internal predecessors, (1582), 0 states have call successors, (0), 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-10-13 22:45:44,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 169.0) internal successors, (3549), 21 states have internal predecessors, (3549), 0 states have call successors, (0), 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-10-13 22:45:44,333 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 169.0) internal successors, (3549), 21 states have internal predecessors, (3549), 0 states have call successors, (0), 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-10-13 22:45:44,333 INFO L186 Difference]: Start difference. First operand has 212 places, 184 transitions, 881 flow. Second operand 20 states and 1582 transitions. [2021-10-13 22:45:44,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 295 transitions, 1992 flow [2021-10-13 22:45:44,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 295 transitions, 1958 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-10-13 22:45:44,389 INFO L242 Difference]: Finished difference. Result has 233 places, 202 transitions, 1156 flow [2021-10-13 22:45:44,389 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1156, PETRI_PLACES=233, PETRI_TRANSITIONS=202} [2021-10-13 22:45:44,389 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 76 predicate places. [2021-10-13 22:45:44,389 INFO L470 AbstractCegarLoop]: Abstraction has has 233 places, 202 transitions, 1156 flow [2021-10-13 22:45:44,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:44,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:44,390 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] [2021-10-13 22:45:44,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 22:45:44,390 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-10-13 22:45:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:44,392 INFO L82 PathProgramCache]: Analyzing trace with hash -284021070, now seen corresponding path program 6 times [2021-10-13 22:45:44,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:44,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954275505] [2021-10-13 22:45:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:44,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:44,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:44,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954275505] [2021-10-13 22:45:44,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954275505] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:44,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:44,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:45:44,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544036142] [2021-10-13 22:45:44,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:45:44,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:44,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:45:44,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:45:44,849 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:45:44,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 202 transitions, 1156 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:44,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:44,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:45:44,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:47,128 INFO L129 PetriNetUnfolder]: 3668/10012 cut-off events. [2021-10-13 22:45:47,129 INFO L130 PetriNetUnfolder]: For 24972/25480 co-relation queries the response was YES. [2021-10-13 22:45:47,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32247 conditions, 10012 events. 3668/10012 cut-off events. For 24972/25480 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 104464 event pairs, 669 based on Foata normal form. 81/9841 useless extension candidates. Maximal degree in co-relation 32197. Up to 2751 conditions per place. [2021-10-13 22:45:47,211 INFO L132 encePairwiseOnDemand]: 143/169 looper letters, 228 selfloop transitions, 78 changer transitions 0/374 dead transitions. [2021-10-13 22:45:47,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 374 transitions, 3046 flow [2021-10-13 22:45:47,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 22:45:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-13 22:45:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1745 transitions. [2021-10-13 22:45:47,214 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4693383539537386 [2021-10-13 22:45:47,215 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1745 transitions. [2021-10-13 22:45:47,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1745 transitions. [2021-10-13 22:45:47,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:47,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1745 transitions. [2021-10-13 22:45:47,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 79.31818181818181) internal successors, (1745), 22 states have internal predecessors, (1745), 0 states have call successors, (0), 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-10-13 22:45:47,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:45:47,222 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:45:47,222 INFO L186 Difference]: Start difference. First operand has 233 places, 202 transitions, 1156 flow. Second operand 22 states and 1745 transitions. [2021-10-13 22:45:47,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 374 transitions, 3046 flow [2021-10-13 22:45:47,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 374 transitions, 2976 flow, removed 9 selfloop flow, removed 9 redundant places. [2021-10-13 22:45:47,322 INFO L242 Difference]: Finished difference. Result has 255 places, 246 transitions, 1788 flow [2021-10-13 22:45:47,322 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1788, PETRI_PLACES=255, PETRI_TRANSITIONS=246} [2021-10-13 22:45:47,323 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 98 predicate places. [2021-10-13 22:45:47,323 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 246 transitions, 1788 flow [2021-10-13 22:45:47,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:47,328 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:47,328 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] [2021-10-13 22:45:47,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 22:45:47,329 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-10-13 22:45:47,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:47,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1042299640, now seen corresponding path program 7 times [2021-10-13 22:45:47,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:47,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983970497] [2021-10-13 22:45:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:47,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:47,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:47,800 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983970497] [2021-10-13 22:45:47,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983970497] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:47,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:47,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:45:47,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054441712] [2021-10-13 22:45:47,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:45:47,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:47,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:45:47,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:45:47,805 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:45:47,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 246 transitions, 1788 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:47,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:47,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:45:47,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:50,519 INFO L129 PetriNetUnfolder]: 4609/13113 cut-off events. [2021-10-13 22:45:50,520 INFO L130 PetriNetUnfolder]: For 39135/39759 co-relation queries the response was YES. [2021-10-13 22:45:50,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43090 conditions, 13113 events. 4609/13113 cut-off events. For 39135/39759 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 144688 event pairs, 2301 based on Foata normal form. 95/12831 useless extension candidates. Maximal degree in co-relation 43029. Up to 5530 conditions per place. [2021-10-13 22:45:50,653 INFO L132 encePairwiseOnDemand]: 144/169 looper letters, 216 selfloop transitions, 96 changer transitions 0/380 dead transitions. [2021-10-13 22:45:50,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 380 transitions, 3487 flow [2021-10-13 22:45:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-13 22:45:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-10-13 22:45:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1654 transitions. [2021-10-13 22:45:50,657 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.46604677373908143 [2021-10-13 22:45:50,657 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1654 transitions. [2021-10-13 22:45:50,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1654 transitions. [2021-10-13 22:45:50,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:50,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1654 transitions. [2021-10-13 22:45:50,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 78.76190476190476) internal successors, (1654), 21 states have internal predecessors, (1654), 0 states have call successors, (0), 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-10-13 22:45:50,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 169.0) internal successors, (3718), 22 states have internal predecessors, (3718), 0 states have call successors, (0), 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-10-13 22:45:50,664 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 169.0) internal successors, (3718), 22 states have internal predecessors, (3718), 0 states have call successors, (0), 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-10-13 22:45:50,664 INFO L186 Difference]: Start difference. First operand has 255 places, 246 transitions, 1788 flow. Second operand 21 states and 1654 transitions. [2021-10-13 22:45:50,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 380 transitions, 3487 flow [2021-10-13 22:45:50,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 380 transitions, 3397 flow, removed 25 selfloop flow, removed 7 redundant places. [2021-10-13 22:45:50,881 INFO L242 Difference]: Finished difference. Result has 280 places, 278 transitions, 2377 flow [2021-10-13 22:45:50,882 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2377, PETRI_PLACES=280, PETRI_TRANSITIONS=278} [2021-10-13 22:45:50,882 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 123 predicate places. [2021-10-13 22:45:50,882 INFO L470 AbstractCegarLoop]: Abstraction has has 280 places, 278 transitions, 2377 flow [2021-10-13 22:45:50,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:50,883 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:50,883 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] [2021-10-13 22:45:50,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 22:45:50,883 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-10-13 22:45:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:50,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1475537132, now seen corresponding path program 8 times [2021-10-13 22:45:50,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:50,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012289147] [2021-10-13 22:45:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:50,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:51,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:51,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012289147] [2021-10-13 22:45:51,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012289147] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:51,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:51,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:45:51,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189990746] [2021-10-13 22:45:51,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:45:51,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:51,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:45:51,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:45:51,379 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:45:51,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 278 transitions, 2377 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:51,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:51,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:45:51,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:54,717 INFO L129 PetriNetUnfolder]: 5141/14575 cut-off events. [2021-10-13 22:45:54,718 INFO L130 PetriNetUnfolder]: For 52675/53400 co-relation queries the response was YES. [2021-10-13 22:45:54,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50591 conditions, 14575 events. 5141/14575 cut-off events. For 52675/53400 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 165572 event pairs, 572 based on Foata normal form. 153/14426 useless extension candidates. Maximal degree in co-relation 50517. Up to 2880 conditions per place. [2021-10-13 22:45:54,844 INFO L132 encePairwiseOnDemand]: 141/169 looper letters, 242 selfloop transitions, 129 changer transitions 0/439 dead transitions. [2021-10-13 22:45:54,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 439 transitions, 4520 flow [2021-10-13 22:45:54,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 22:45:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-13 22:45:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1752 transitions. [2021-10-13 22:45:54,846 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.471221086605702 [2021-10-13 22:45:54,846 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1752 transitions. [2021-10-13 22:45:54,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1752 transitions. [2021-10-13 22:45:54,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:54,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1752 transitions. [2021-10-13 22:45:54,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 79.63636363636364) internal successors, (1752), 22 states have internal predecessors, (1752), 0 states have call successors, (0), 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-10-13 22:45:54,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:45:54,852 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:45:54,853 INFO L186 Difference]: Start difference. First operand has 280 places, 278 transitions, 2377 flow. Second operand 22 states and 1752 transitions. [2021-10-13 22:45:54,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 439 transitions, 4520 flow [2021-10-13 22:45:55,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 439 transitions, 4447 flow, removed 28 selfloop flow, removed 6 redundant places. [2021-10-13 22:45:55,178 INFO L242 Difference]: Finished difference. Result has 302 places, 315 transitions, 3232 flow [2021-10-13 22:45:55,179 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=2304, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3232, PETRI_PLACES=302, PETRI_TRANSITIONS=315} [2021-10-13 22:45:55,179 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 145 predicate places. [2021-10-13 22:45:55,179 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 315 transitions, 3232 flow [2021-10-13 22:45:55,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:55,179 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:55,180 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] [2021-10-13 22:45:55,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 22:45:55,180 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-10-13 22:45:55,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:55,180 INFO L82 PathProgramCache]: Analyzing trace with hash 765082732, now seen corresponding path program 9 times [2021-10-13 22:45:55,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:55,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45022095] [2021-10-13 22:45:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:55,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:45:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:45:55,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:45:55,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45022095] [2021-10-13 22:45:55,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45022095] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:45:55,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:45:55,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:45:55,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658494024] [2021-10-13 22:45:55,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:45:55,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:45:55,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:45:55,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:45:55,601 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:45:55,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 315 transitions, 3232 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:55,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:45:55,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:45:55,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:45:59,019 INFO L129 PetriNetUnfolder]: 5156/15080 cut-off events. [2021-10-13 22:45:59,019 INFO L130 PetriNetUnfolder]: For 73068/73909 co-relation queries the response was YES. [2021-10-13 22:45:59,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54850 conditions, 15080 events. 5156/15080 cut-off events. For 73068/73909 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 172063 event pairs, 2162 based on Foata normal form. 128/14758 useless extension candidates. Maximal degree in co-relation 54769. Up to 4885 conditions per place. [2021-10-13 22:45:59,175 INFO L132 encePairwiseOnDemand]: 143/169 looper letters, 271 selfloop transitions, 137 changer transitions 0/476 dead transitions. [2021-10-13 22:45:59,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 476 transitions, 5580 flow [2021-10-13 22:45:59,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 22:45:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-13 22:45:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1745 transitions. [2021-10-13 22:45:59,178 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4693383539537386 [2021-10-13 22:45:59,178 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1745 transitions. [2021-10-13 22:45:59,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1745 transitions. [2021-10-13 22:45:59,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:45:59,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1745 transitions. [2021-10-13 22:45:59,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 79.31818181818181) internal successors, (1745), 22 states have internal predecessors, (1745), 0 states have call successors, (0), 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-10-13 22:45:59,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:45:59,184 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:45:59,184 INFO L186 Difference]: Start difference. First operand has 302 places, 315 transitions, 3232 flow. Second operand 22 states and 1745 transitions. [2021-10-13 22:45:59,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 476 transitions, 5580 flow [2021-10-13 22:45:59,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 476 transitions, 5418 flow, removed 37 selfloop flow, removed 9 redundant places. [2021-10-13 22:45:59,651 INFO L242 Difference]: Finished difference. Result has 325 places, 354 transitions, 4178 flow [2021-10-13 22:45:59,651 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=3106, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4178, PETRI_PLACES=325, PETRI_TRANSITIONS=354} [2021-10-13 22:45:59,651 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 168 predicate places. [2021-10-13 22:45:59,652 INFO L470 AbstractCegarLoop]: Abstraction has has 325 places, 354 transitions, 4178 flow [2021-10-13 22:45:59,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:45:59,652 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:45:59,652 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] [2021-10-13 22:45:59,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 22:45:59,652 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-10-13 22:45:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:45:59,653 INFO L82 PathProgramCache]: Analyzing trace with hash 530631740, now seen corresponding path program 10 times [2021-10-13 22:45:59,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:45:59,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628617081] [2021-10-13 22:45:59,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:45:59,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:45:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:46:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:46:00,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:46:00,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628617081] [2021-10-13 22:46:00,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628617081] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:46:00,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:46:00,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:46:00,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138389292] [2021-10-13 22:46:00,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:46:00,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:46:00,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:46:00,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:46:00,119 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:46:00,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 354 transitions, 4178 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:46:00,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:46:00,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:46:00,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:46:03,781 INFO L129 PetriNetUnfolder]: 5170/14959 cut-off events. [2021-10-13 22:46:03,781 INFO L130 PetriNetUnfolder]: For 81319/82174 co-relation queries the response was YES. [2021-10-13 22:46:03,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56356 conditions, 14959 events. 5170/14959 cut-off events. For 81319/82174 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 170095 event pairs, 1068 based on Foata normal form. 180/14739 useless extension candidates. Maximal degree in co-relation 56263. Up to 5034 conditions per place. [2021-10-13 22:46:03,931 INFO L132 encePairwiseOnDemand]: 143/169 looper letters, 278 selfloop transitions, 157 changer transitions 0/503 dead transitions. [2021-10-13 22:46:03,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 503 transitions, 6508 flow [2021-10-13 22:46:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 22:46:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-13 22:46:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1745 transitions. [2021-10-13 22:46:03,933 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4693383539537386 [2021-10-13 22:46:03,934 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1745 transitions. [2021-10-13 22:46:03,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1745 transitions. [2021-10-13 22:46:03,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:46:03,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1745 transitions. [2021-10-13 22:46:03,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 79.31818181818181) internal successors, (1745), 22 states have internal predecessors, (1745), 0 states have call successors, (0), 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-10-13 22:46:03,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:46:03,939 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:46:03,939 INFO L186 Difference]: Start difference. First operand has 325 places, 354 transitions, 4178 flow. Second operand 22 states and 1745 transitions. [2021-10-13 22:46:03,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 503 transitions, 6508 flow [2021-10-13 22:46:04,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 503 transitions, 6393 flow, removed 45 selfloop flow, removed 6 redundant places. [2021-10-13 22:46:04,467 INFO L242 Difference]: Finished difference. Result has 349 places, 387 transitions, 5182 flow [2021-10-13 22:46:04,467 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=4063, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5182, PETRI_PLACES=349, PETRI_TRANSITIONS=387} [2021-10-13 22:46:04,467 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 192 predicate places. [2021-10-13 22:46:04,467 INFO L470 AbstractCegarLoop]: Abstraction has has 349 places, 387 transitions, 5182 flow [2021-10-13 22:46:04,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:46:04,468 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:46:04,468 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] [2021-10-13 22:46:04,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 22:46:04,468 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-10-13 22:46:04,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:46:04,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1456312582, now seen corresponding path program 11 times [2021-10-13 22:46:04,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:46:04,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346136579] [2021-10-13 22:46:04,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:46:04,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:46:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:46:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:46:04,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:46:04,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346136579] [2021-10-13 22:46:04,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346136579] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:46:04,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:46:04,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:46:04,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465470398] [2021-10-13 22:46:04,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:46:04,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:46:04,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:46:04,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:46:04,863 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:46:04,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 387 transitions, 5182 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:46:04,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:46:04,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:46:04,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:46:09,522 INFO L129 PetriNetUnfolder]: 5749/18813 cut-off events. [2021-10-13 22:46:09,522 INFO L130 PetriNetUnfolder]: For 114443/115866 co-relation queries the response was YES. [2021-10-13 22:46:09,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70043 conditions, 18813 events. 5749/18813 cut-off events. For 114443/115866 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 232733 event pairs, 1823 based on Foata normal form. 278/18661 useless extension candidates. Maximal degree in co-relation 69940. Up to 4625 conditions per place. [2021-10-13 22:46:09,717 INFO L132 encePairwiseOnDemand]: 143/169 looper letters, 346 selfloop transitions, 193 changer transitions 0/639 dead transitions. [2021-10-13 22:46:09,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 639 transitions, 9787 flow [2021-10-13 22:46:09,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 22:46:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-13 22:46:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1740 transitions. [2021-10-13 22:46:09,720 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4679935449166218 [2021-10-13 22:46:09,720 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1740 transitions. [2021-10-13 22:46:09,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1740 transitions. [2021-10-13 22:46:09,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:46:09,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1740 transitions. [2021-10-13 22:46:09,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 79.0909090909091) internal successors, (1740), 22 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 22:46:09,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:46:09,725 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:46:09,725 INFO L186 Difference]: Start difference. First operand has 349 places, 387 transitions, 5182 flow. Second operand 22 states and 1740 transitions. [2021-10-13 22:46:09,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 639 transitions, 9787 flow [2021-10-13 22:46:10,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 639 transitions, 9484 flow, removed 107 selfloop flow, removed 9 redundant places. [2021-10-13 22:46:10,276 INFO L242 Difference]: Finished difference. Result has 371 places, 470 transitions, 7386 flow [2021-10-13 22:46:10,276 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=5014, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7386, PETRI_PLACES=371, PETRI_TRANSITIONS=470} [2021-10-13 22:46:10,276 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 214 predicate places. [2021-10-13 22:46:10,276 INFO L470 AbstractCegarLoop]: Abstraction has has 371 places, 470 transitions, 7386 flow [2021-10-13 22:46:10,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:46:10,277 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:46:10,277 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] [2021-10-13 22:46:10,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 22:46:10,277 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-10-13 22:46:10,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:46:10,277 INFO L82 PathProgramCache]: Analyzing trace with hash 839179824, now seen corresponding path program 12 times [2021-10-13 22:46:10,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:46:10,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154691291] [2021-10-13 22:46:10,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:46:10,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:46:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:46:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:46:10,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:46:10,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154691291] [2021-10-13 22:46:10,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154691291] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:46:10,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:46:10,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-10-13 22:46:10,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49670931] [2021-10-13 22:46:10,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-10-13 22:46:10,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:46:10,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-10-13 22:46:10,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2021-10-13 22:46:10,749 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2021-10-13 22:46:10,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 470 transitions, 7386 flow. Second operand has 22 states, 22 states have (on average 77.63636363636364) internal successors, (1708), 22 states have internal predecessors, (1708), 0 states have call successors, (0), 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-10-13 22:46:10,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:46:10,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2021-10-13 22:46:10,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:46:18,113 INFO L129 PetriNetUnfolder]: 11437/29916 cut-off events. [2021-10-13 22:46:18,113 INFO L130 PetriNetUnfolder]: For 165582/165806 co-relation queries the response was YES. [2021-10-13 22:46:18,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115395 conditions, 29916 events. 11437/29916 cut-off events. For 165582/165806 co-relation queries the response was YES. Maximal size of possible extension queue 1295. Compared 351248 event pairs, 1466 based on Foata normal form. 119/29710 useless extension candidates. Maximal degree in co-relation 115282. Up to 8802 conditions per place. [2021-10-13 22:46:18,492 INFO L132 encePairwiseOnDemand]: 143/169 looper letters, 431 selfloop transitions, 81 changer transitions 0/669 dead transitions. [2021-10-13 22:46:18,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 669 transitions, 10248 flow [2021-10-13 22:46:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-13 22:46:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-10-13 22:46:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1902 transitions. [2021-10-13 22:46:18,494 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4893233856444559 [2021-10-13 22:46:18,494 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1902 transitions. [2021-10-13 22:46:18,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1902 transitions. [2021-10-13 22:46:18,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:46:18,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1902 transitions. [2021-10-13 22:46:18,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 82.69565217391305) internal successors, (1902), 23 states have internal predecessors, (1902), 0 states have call successors, (0), 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-10-13 22:46:18,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 169.0) internal successors, (4056), 24 states have internal predecessors, (4056), 0 states have call successors, (0), 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-10-13 22:46:18,499 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 169.0) internal successors, (4056), 24 states have internal predecessors, (4056), 0 states have call successors, (0), 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-10-13 22:46:18,499 INFO L186 Difference]: Start difference. First operand has 371 places, 470 transitions, 7386 flow. Second operand 23 states and 1902 transitions. [2021-10-13 22:46:18,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 669 transitions, 10248 flow [2021-10-13 22:46:20,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 669 transitions, 10074 flow, removed 65 selfloop flow, removed 7 redundant places. [2021-10-13 22:46:20,210 INFO L242 Difference]: Finished difference. Result has 391 places, 485 transitions, 7631 flow [2021-10-13 22:46:20,210 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=7277, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7631, PETRI_PLACES=391, PETRI_TRANSITIONS=485} [2021-10-13 22:46:20,211 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 234 predicate places. [2021-10-13 22:46:20,211 INFO L470 AbstractCegarLoop]: Abstraction has has 391 places, 485 transitions, 7631 flow [2021-10-13 22:46:20,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 77.63636363636364) internal successors, (1708), 22 states have internal predecessors, (1708), 0 states have call successors, (0), 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-10-13 22:46:20,211 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:46:20,211 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] [2021-10-13 22:46:20,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 22:46:20,211 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-10-13 22:46:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:46:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1705119580, now seen corresponding path program 13 times [2021-10-13 22:46:20,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:46:20,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595179381] [2021-10-13 22:46:20,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:46:20,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:46:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:46:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:46:20,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:46:20,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595179381] [2021-10-13 22:46:20,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595179381] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:46:20,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:46:20,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-10-13 22:46:20,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479766074] [2021-10-13 22:46:20,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-13 22:46:20,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:46:20,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-13 22:46:20,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-10-13 22:46:20,628 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 169 [2021-10-13 22:46:20,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 485 transitions, 7631 flow. Second operand has 18 states, 18 states have (on average 117.94444444444444) internal successors, (2123), 18 states have internal predecessors, (2123), 0 states have call successors, (0), 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-10-13 22:46:20,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:46:20,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 169 [2021-10-13 22:46:20,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:46:24,987 INFO L129 PetriNetUnfolder]: 4397/17690 cut-off events. [2021-10-13 22:46:24,987 INFO L130 PetriNetUnfolder]: For 143649/144276 co-relation queries the response was YES. [2021-10-13 22:46:25,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77055 conditions, 17690 events. 4397/17690 cut-off events. For 143649/144276 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 233678 event pairs, 909 based on Foata normal form. 187/17628 useless extension candidates. Maximal degree in co-relation 76936. Up to 5927 conditions per place. [2021-10-13 22:46:25,610 INFO L132 encePairwiseOnDemand]: 151/169 looper letters, 353 selfloop transitions, 51 changer transitions 0/747 dead transitions. [2021-10-13 22:46:25,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 747 transitions, 11748 flow [2021-10-13 22:46:25,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 22:46:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-13 22:46:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2114 transitions. [2021-10-13 22:46:25,612 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.735816219979116 [2021-10-13 22:46:25,612 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2114 transitions. [2021-10-13 22:46:25,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2114 transitions. [2021-10-13 22:46:25,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:46:25,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2114 transitions. [2021-10-13 22:46:25,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 124.3529411764706) internal successors, (2114), 17 states have internal predecessors, (2114), 0 states have call successors, (0), 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-10-13 22:46:25,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 169.0) internal successors, (3042), 18 states have internal predecessors, (3042), 0 states have call successors, (0), 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-10-13 22:46:25,616 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 169.0) internal successors, (3042), 18 states have internal predecessors, (3042), 0 states have call successors, (0), 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-10-13 22:46:25,616 INFO L186 Difference]: Start difference. First operand has 391 places, 485 transitions, 7631 flow. Second operand 17 states and 2114 transitions. [2021-10-13 22:46:25,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 747 transitions, 11748 flow [2021-10-13 22:46:26,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 747 transitions, 11394 flow, removed 22 selfloop flow, removed 16 redundant places. [2021-10-13 22:46:26,652 INFO L242 Difference]: Finished difference. Result has 398 places, 508 transitions, 7987 flow [2021-10-13 22:46:26,652 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=7486, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7987, PETRI_PLACES=398, PETRI_TRANSITIONS=508} [2021-10-13 22:46:26,652 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 241 predicate places. [2021-10-13 22:46:26,652 INFO L470 AbstractCegarLoop]: Abstraction has has 398 places, 508 transitions, 7987 flow [2021-10-13 22:46:26,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 117.94444444444444) internal successors, (2123), 18 states have internal predecessors, (2123), 0 states have call successors, (0), 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-10-13 22:46:26,653 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:46:26,653 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] [2021-10-13 22:46:26,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 22:46:26,653 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-10-13 22:46:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:46:26,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1165492366, now seen corresponding path program 14 times [2021-10-13 22:46:26,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:46:26,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076501788] [2021-10-13 22:46:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:46:26,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:46:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:46:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:46:27,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:46:27,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076501788] [2021-10-13 22:46:27,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076501788] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:46:27,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:46:27,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:46:27,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774287415] [2021-10-13 22:46:27,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:46:27,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:46:27,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:46:27,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:46:27,109 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:46:27,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 508 transitions, 7987 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:46:27,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:46:27,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:46:27,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:46:34,461 INFO L129 PetriNetUnfolder]: 7965/25670 cut-off events. [2021-10-13 22:46:34,461 INFO L130 PetriNetUnfolder]: For 198461/200606 co-relation queries the response was YES. [2021-10-13 22:46:34,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106492 conditions, 25670 events. 7965/25670 cut-off events. For 198461/200606 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 329536 event pairs, 4461 based on Foata normal form. 411/25462 useless extension candidates. Maximal degree in co-relation 106366. Up to 11976 conditions per place. [2021-10-13 22:46:34,803 INFO L132 encePairwiseOnDemand]: 144/169 looper letters, 290 selfloop transitions, 241 changer transitions 0/651 dead transitions. [2021-10-13 22:46:34,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 651 transitions, 10867 flow [2021-10-13 22:46:34,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-13 22:46:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-10-13 22:46:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1645 transitions. [2021-10-13 22:46:34,805 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4635108481262327 [2021-10-13 22:46:34,805 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1645 transitions. [2021-10-13 22:46:34,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1645 transitions. [2021-10-13 22:46:34,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:46:34,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1645 transitions. [2021-10-13 22:46:34,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 78.33333333333333) internal successors, (1645), 21 states have internal predecessors, (1645), 0 states have call successors, (0), 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-10-13 22:46:34,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 169.0) internal successors, (3718), 22 states have internal predecessors, (3718), 0 states have call successors, (0), 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-10-13 22:46:34,809 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 169.0) internal successors, (3718), 22 states have internal predecessors, (3718), 0 states have call successors, (0), 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-10-13 22:46:34,809 INFO L186 Difference]: Start difference. First operand has 398 places, 508 transitions, 7987 flow. Second operand 21 states and 1645 transitions. [2021-10-13 22:46:34,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 651 transitions, 10867 flow [2021-10-13 22:46:35,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 651 transitions, 10740 flow, removed 32 selfloop flow, removed 9 redundant places. [2021-10-13 22:46:35,809 INFO L242 Difference]: Finished difference. Result has 421 places, 544 transitions, 9349 flow [2021-10-13 22:46:35,809 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=7895, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=508, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=9349, PETRI_PLACES=421, PETRI_TRANSITIONS=544} [2021-10-13 22:46:35,809 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 264 predicate places. [2021-10-13 22:46:35,809 INFO L470 AbstractCegarLoop]: Abstraction has has 421 places, 544 transitions, 9349 flow [2021-10-13 22:46:35,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:46:35,810 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:46:35,810 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] [2021-10-13 22:46:35,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 22:46:35,810 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-10-13 22:46:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:46:35,810 INFO L82 PathProgramCache]: Analyzing trace with hash 611535982, now seen corresponding path program 15 times [2021-10-13 22:46:35,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:46:35,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690865599] [2021-10-13 22:46:35,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:46:35,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:46:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:46:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:46:36,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:46:36,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690865599] [2021-10-13 22:46:36,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690865599] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:46:36,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:46:36,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-10-13 22:46:36,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346013416] [2021-10-13 22:46:36,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-13 22:46:36,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:46:36,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-13 22:46:36,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-10-13 22:46:36,194 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 169 [2021-10-13 22:46:36,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 544 transitions, 9349 flow. Second operand has 18 states, 18 states have (on average 117.94444444444444) internal successors, (2123), 18 states have internal predecessors, (2123), 0 states have call successors, (0), 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-10-13 22:46:36,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:46:36,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 169 [2021-10-13 22:46:36,195 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:46:44,417 INFO L129 PetriNetUnfolder]: 6945/30161 cut-off events. [2021-10-13 22:46:44,417 INFO L130 PetriNetUnfolder]: For 281084/282039 co-relation queries the response was YES. [2021-10-13 22:46:44,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133487 conditions, 30161 events. 6945/30161 cut-off events. For 281084/282039 co-relation queries the response was YES. Maximal size of possible extension queue 1614. Compared 440409 event pairs, 3526 based on Foata normal form. 207/29980 useless extension candidates. Maximal degree in co-relation 133349. Up to 5122 conditions per place. [2021-10-13 22:46:44,984 INFO L132 encePairwiseOnDemand]: 151/169 looper letters, 487 selfloop transitions, 41 changer transitions 0/895 dead transitions. [2021-10-13 22:46:44,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 895 transitions, 14288 flow [2021-10-13 22:46:44,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-13 22:46:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-13 22:46:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2137 transitions. [2021-10-13 22:46:44,986 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7438217890706579 [2021-10-13 22:46:44,986 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2137 transitions. [2021-10-13 22:46:44,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2137 transitions. [2021-10-13 22:46:44,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:46:44,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2137 transitions. [2021-10-13 22:46:44,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 125.70588235294117) internal successors, (2137), 17 states have internal predecessors, (2137), 0 states have call successors, (0), 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-10-13 22:46:44,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 169.0) internal successors, (3042), 18 states have internal predecessors, (3042), 0 states have call successors, (0), 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-10-13 22:46:44,990 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 169.0) internal successors, (3042), 18 states have internal predecessors, (3042), 0 states have call successors, (0), 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-10-13 22:46:44,990 INFO L186 Difference]: Start difference. First operand has 421 places, 544 transitions, 9349 flow. Second operand 17 states and 2137 transitions. [2021-10-13 22:46:44,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 895 transitions, 14288 flow [2021-10-13 22:46:47,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 895 transitions, 14157 flow, removed 58 selfloop flow, removed 6 redundant places. [2021-10-13 22:46:47,543 INFO L242 Difference]: Finished difference. Result has 441 places, 573 transitions, 9762 flow [2021-10-13 22:46:47,544 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=9218, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9762, PETRI_PLACES=441, PETRI_TRANSITIONS=573} [2021-10-13 22:46:47,544 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 284 predicate places. [2021-10-13 22:46:47,544 INFO L470 AbstractCegarLoop]: Abstraction has has 441 places, 573 transitions, 9762 flow [2021-10-13 22:46:47,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 117.94444444444444) internal successors, (2123), 18 states have internal predecessors, (2123), 0 states have call successors, (0), 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-10-13 22:46:47,544 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:46:47,545 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] [2021-10-13 22:46:47,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 22:46:47,545 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 22:46:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:46:47,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1079373466, now seen corresponding path program 16 times [2021-10-13 22:46:47,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:46:47,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956789590] [2021-10-13 22:46:47,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:46:47,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:46:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:46:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:46:47,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:46:47,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956789590] [2021-10-13 22:46:47,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956789590] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:46:47,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:46:47,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:46:47,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306413695] [2021-10-13 22:46:47,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:46:47,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:46:47,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:46:47,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:46:47,929 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:46:47,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 573 transitions, 9762 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:46:47,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:46:47,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:46:47,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-10-13 22:47:02,259 INFO L129 PetriNetUnfolder]: 15691/52518 cut-off events. [2021-10-13 22:47:02,259 INFO L130 PetriNetUnfolder]: For 472784/478062 co-relation queries the response was YES. [2021-10-13 22:47:03,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228712 conditions, 52518 events. 15691/52518 cut-off events. For 472784/478062 co-relation queries the response was YES. Maximal size of possible extension queue 2825. Compared 767963 event pairs, 2957 based on Foata normal form. 1027/52116 useless extension candidates. Maximal degree in co-relation 228564. Up to 9711 conditions per place. [2021-10-13 22:47:03,903 INFO L132 encePairwiseOnDemand]: 141/169 looper letters, 424 selfloop transitions, 296 changer transitions 0/857 dead transitions. [2021-10-13 22:47:03,903 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 857 transitions, 15594 flow [2021-10-13 22:47:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 22:47:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-13 22:47:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1749 transitions. [2021-10-13 22:47:03,905 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.47041420118343197 [2021-10-13 22:47:03,905 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1749 transitions. [2021-10-13 22:47:03,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1749 transitions. [2021-10-13 22:47:03,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-13 22:47:03,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1749 transitions. [2021-10-13 22:47:03,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 79.5) internal successors, (1749), 22 states have internal predecessors, (1749), 0 states have call successors, (0), 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-10-13 22:47:03,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:47:03,909 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 169.0) internal successors, (3887), 23 states have internal predecessors, (3887), 0 states have call successors, (0), 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-10-13 22:47:03,909 INFO L186 Difference]: Start difference. First operand has 441 places, 573 transitions, 9762 flow. Second operand 22 states and 1749 transitions. [2021-10-13 22:47:03,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 857 transitions, 15594 flow [2021-10-13 22:47:08,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 857 transitions, 15496 flow, removed 42 selfloop flow, removed 6 redundant places. [2021-10-13 22:47:08,199 INFO L242 Difference]: Finished difference. Result has 464 places, 655 transitions, 12757 flow [2021-10-13 22:47:08,199 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=9678, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12757, PETRI_PLACES=464, PETRI_TRANSITIONS=655} [2021-10-13 22:47:08,200 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 307 predicate places. [2021-10-13 22:47:08,200 INFO L470 AbstractCegarLoop]: Abstraction has has 464 places, 655 transitions, 12757 flow [2021-10-13 22:47:08,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:47:08,200 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-10-13 22:47:08,200 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] [2021-10-13 22:47:08,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 22:47:08,200 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2021-10-13 22:47:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 22:47:08,200 INFO L82 PathProgramCache]: Analyzing trace with hash -114635220, now seen corresponding path program 17 times [2021-10-13 22:47:08,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 22:47:08,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624919619] [2021-10-13 22:47:08,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 22:47:08,201 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 22:47:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 22:47:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 22:47:08,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 22:47:08,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624919619] [2021-10-13 22:47:08,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624919619] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 22:47:08,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 22:47:08,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-13 22:47:08,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120882842] [2021-10-13 22:47:08,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-13 22:47:08,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 22:47:08,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-13 22:47:08,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-10-13 22:47:08,595 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 169 [2021-10-13 22:47:08,595 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 655 transitions, 12757 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-13 22:47:08,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-10-13 22:47:08,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 169 [2021-10-13 22:47:08,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand