/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_78-equ_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 06:21:35,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:21:35,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:21:35,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:21:35,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:21:35,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:21:35,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:21:35,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:21:35,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:21:35,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:21:35,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:21:35,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:21:35,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:21:35,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:21:35,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:21:35,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:21:35,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:21:35,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:21:35,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:21:35,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:21:35,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:21:35,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:21:35,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:21:35,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:21:35,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:21:35,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:21:35,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:21:35,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:21:35,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:21:35,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:21:35,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:21:35,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:21:35,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:21:35,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:21:35,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:21:35,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:21:35,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:21:35,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:21:35,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:21:35,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:21:35,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:21:35,127 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-Before.epf [2022-01-19 06:21:35,161 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:21:35,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:21:35,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:21:35,163 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:21:35,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:21:35,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:21:35,164 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:21:35,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:21:35,164 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:21:35,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:21:35,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:21:35,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:21:35,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:21:35,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:21:35,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:21:35,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:21:35,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:21:35,166 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:21:35,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:21:35,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:21:35,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:21:35,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:21:35,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:21:35,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:21:35,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:21:35,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:21:35,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:21:35,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:21:35,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:21:35,168 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:21:35,168 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:21:35,168 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:21:35,168 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 [2022-01-19 06:21:35,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:21:35,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:21:35,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:21:35,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:21:35,387 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:21:35,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_78-equ_racing.i [2022-01-19 06:21:35,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8889a098/6a56df08b161465d973c537fad3b4b6f/FLAGae840e6b2 [2022-01-19 06:21:35,917 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:21:35,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_78-equ_racing.i [2022-01-19 06:21:35,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8889a098/6a56df08b161465d973c537fad3b4b6f/FLAGae840e6b2 [2022-01-19 06:21:36,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8889a098/6a56df08b161465d973c537fad3b4b6f [2022-01-19 06:21:36,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:21:36,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:21:36,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:21:36,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:21:36,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:21:36,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:36,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5809e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36, skipping insertion in model container [2022-01-19 06:21:36,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:36,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:21:36,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:21:36,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-01-19 06:21:36,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:21:36,848 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:21:36,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_78-equ_racing.i[47038,47051] [2022-01-19 06:21:36,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:21:36,922 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:21:36,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36 WrapperNode [2022-01-19 06:21:36,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:21:36,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:21:36,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:21:36,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:21:36,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:36,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:36,966 INFO L137 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 198 [2022-01-19 06:21:36,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:21:36,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:21:36,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:21:36,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:21:36,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:36,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:36,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:36,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:37,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:37,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:37,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:37,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:21:37,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:21:37,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:21:37,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:21:37,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (1/1) ... [2022-01-19 06:21:37,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:21:37,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:37,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 06:21:37,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 06:21:37,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:21:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:21:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:21:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:21:37,086 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 06:21:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:21:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-19 06:21:37,087 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-19 06:21:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:21:37,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:21:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:21:37,092 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 06:21:37,227 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:21:37,228 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:21:37,567 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:21:37,575 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:21:37,583 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2022-01-19 06:21:37,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:21:37 BoogieIcfgContainer [2022-01-19 06:21:37,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:21:37,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:21:37,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:21:37,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:21:37,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:21:36" (1/3) ... [2022-01-19 06:21:37,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e73bdd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:21:37, skipping insertion in model container [2022-01-19 06:21:37,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:36" (2/3) ... [2022-01-19 06:21:37,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e73bdd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:21:37, skipping insertion in model container [2022-01-19 06:21:37,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:21:37" (3/3) ... [2022-01-19 06:21:37,593 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing.i [2022-01-19 06:21:37,597 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:21:37,597 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 06:21:37,597 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:21:37,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,652 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,652 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,653 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,653 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,653 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,653 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,654 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,655 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,655 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,655 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,655 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,656 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,657 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,660 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,660 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,660 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,661 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,661 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,661 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,661 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,661 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,662 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,662 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,662 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,662 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,662 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,663 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,664 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,665 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,666 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,667 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,667 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,667 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,667 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,667 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,667 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,668 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,669 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,669 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,672 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,673 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,674 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:37,684 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-19 06:21:37,721 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:21:37,726 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:21:37,726 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 06:21:37,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 203 transitions, 414 flow [2022-01-19 06:21:37,809 INFO L129 PetriNetUnfolder]: 42/275 cut-off events. [2022-01-19 06:21:37,809 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:21:37,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 275 events. 42/275 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 887 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 135. Up to 8 conditions per place. [2022-01-19 06:21:37,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 203 transitions, 414 flow [2022-01-19 06:21:37,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 198 transitions, 401 flow [2022-01-19 06:21:37,847 INFO L129 PetriNetUnfolder]: 14/165 cut-off events. [2022-01-19 06:21:37,847 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:21:37,847 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:37,848 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] [2022-01-19 06:21:37,848 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:21:37,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:37,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1755706946, now seen corresponding path program 1 times [2022-01-19 06:21:37,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:37,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498254294] [2022-01-19 06:21:37,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:37,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:38,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:38,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:38,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498254294] [2022-01-19 06:21:38,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498254294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:38,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:38,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:21:38,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79094080] [2022-01-19 06:21:38,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:38,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:21:38,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:38,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:21:38,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:21:38,153 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2022-01-19 06:21:38,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 198 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:38,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:38,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2022-01-19 06:21:38,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:38,245 INFO L129 PetriNetUnfolder]: 3/176 cut-off events. [2022-01-19 06:21:38,245 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:21:38,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 176 events. 3/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 294 event pairs, 0 based on Foata normal form. 40/209 useless extension candidates. Maximal degree in co-relation 114. Up to 6 conditions per place. [2022-01-19 06:21:38,248 INFO L132 encePairwiseOnDemand]: 176/203 looper letters, 8 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2022-01-19 06:21:38,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 373 flow [2022-01-19 06:21:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:21:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:21:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2022-01-19 06:21:38,261 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2022-01-19 06:21:38,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 551 transitions. [2022-01-19 06:21:38,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 551 transitions. [2022-01-19 06:21:38,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:38,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 551 transitions. [2022-01-19 06:21:38,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:38,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:38,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:38,279 INFO L186 Difference]: Start difference. First operand has 174 places, 198 transitions, 401 flow. Second operand 3 states and 551 transitions. [2022-01-19 06:21:38,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 373 flow [2022-01-19 06:21:38,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 174 transitions, 373 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:21:38,287 INFO L242 Difference]: Finished difference. Result has 175 places, 172 transitions, 357 flow [2022-01-19 06:21:38,289 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=175, PETRI_TRANSITIONS=172} [2022-01-19 06:21:38,292 INFO L334 CegarLoopForPetriNet]: 174 programPoint places, 1 predicate places. [2022-01-19 06:21:38,292 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 172 transitions, 357 flow [2022-01-19 06:21:38,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:38,293 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:38,293 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] [2022-01-19 06:21:38,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:21:38,293 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:21:38,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:38,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1268382152, now seen corresponding path program 1 times [2022-01-19 06:21:38,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:38,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500591364] [2022-01-19 06:21:38,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:38,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:38,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:38,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500591364] [2022-01-19 06:21:38,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500591364] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:38,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:38,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 06:21:38,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637464182] [2022-01-19 06:21:38,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:38,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:21:38,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:38,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:21:38,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:21:38,536 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 203 [2022-01-19 06:21:38,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 172 transitions, 357 flow. Second operand has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:38,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:38,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 203 [2022-01-19 06:21:38,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:39,141 INFO L129 PetriNetUnfolder]: 148/935 cut-off events. [2022-01-19 06:21:39,141 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:21:39,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 935 events. 148/935 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6719 event pairs, 38 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1195. Up to 103 conditions per place. [2022-01-19 06:21:39,149 INFO L132 encePairwiseOnDemand]: 189/203 looper letters, 62 selfloop transitions, 11 changer transitions 81/270 dead transitions. [2022-01-19 06:21:39,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 270 transitions, 859 flow [2022-01-19 06:21:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 06:21:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 06:21:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3061 transitions. [2022-01-19 06:21:39,161 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6282840722495895 [2022-01-19 06:21:39,162 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3061 transitions. [2022-01-19 06:21:39,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3061 transitions. [2022-01-19 06:21:39,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:39,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3061 transitions. [2022-01-19 06:21:39,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 127.54166666666667) internal successors, (3061), 24 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:39,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 203.0) internal successors, (5075), 25 states have internal predecessors, (5075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:39,185 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 203.0) internal successors, (5075), 25 states have internal predecessors, (5075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:39,186 INFO L186 Difference]: Start difference. First operand has 175 places, 172 transitions, 357 flow. Second operand 24 states and 3061 transitions. [2022-01-19 06:21:39,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 270 transitions, 859 flow [2022-01-19 06:21:39,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 270 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:21:39,197 INFO L242 Difference]: Finished difference. Result has 213 places, 176 transitions, 458 flow [2022-01-19 06:21:39,197 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=458, PETRI_PLACES=213, PETRI_TRANSITIONS=176} [2022-01-19 06:21:39,198 INFO L334 CegarLoopForPetriNet]: 174 programPoint places, 39 predicate places. [2022-01-19 06:21:39,198 INFO L470 AbstractCegarLoop]: Abstraction has has 213 places, 176 transitions, 458 flow [2022-01-19 06:21:39,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 125.1) internal successors, (1251), 10 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:39,199 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:39,199 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] [2022-01-19 06:21:39,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 06:21:39,200 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:21:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash -213132658, now seen corresponding path program 1 times [2022-01-19 06:21:39,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:39,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160603130] [2022-01-19 06:21:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:39,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:39,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:39,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160603130] [2022-01-19 06:21:39,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160603130] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:39,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645972819] [2022-01-19 06:21:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:39,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:39,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:39,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:39,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 06:21:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:39,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:21:39,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:39,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:39,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645972819] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:39,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:39,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:21:39,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419420226] [2022-01-19 06:21:39,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:39,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:21:39,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:39,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:21:39,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:21:39,865 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 203 [2022-01-19 06:21:39,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 176 transitions, 458 flow. Second operand has 10 states, 10 states have (on average 169.3) internal successors, (1693), 10 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:39,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:39,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 203 [2022-01-19 06:21:39,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:39,900 INFO L129 PetriNetUnfolder]: 1/123 cut-off events. [2022-01-19 06:21:39,901 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-19 06:21:39,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 123 events. 1/123 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 155. Up to 4 conditions per place. [2022-01-19 06:21:39,901 INFO L132 encePairwiseOnDemand]: 198/203 looper letters, 0 selfloop transitions, 0 changer transitions 117/117 dead transitions. [2022-01-19 06:21:39,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 117 transitions, 298 flow [2022-01-19 06:21:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:21:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:21:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1013 transitions. [2022-01-19 06:21:39,904 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8316912972085386 [2022-01-19 06:21:39,905 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1013 transitions. [2022-01-19 06:21:39,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1013 transitions. [2022-01-19 06:21:39,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:39,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1013 transitions. [2022-01-19 06:21:39,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:39,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:39,910 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:39,910 INFO L186 Difference]: Start difference. First operand has 213 places, 176 transitions, 458 flow. Second operand 6 states and 1013 transitions. [2022-01-19 06:21:39,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 117 transitions, 298 flow [2022-01-19 06:21:39,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 117 transitions, 258 flow, removed 2 selfloop flow, removed 17 redundant places. [2022-01-19 06:21:39,914 INFO L242 Difference]: Finished difference. Result has 131 places, 0 transitions, 0 flow [2022-01-19 06:21:39,915 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=131, PETRI_TRANSITIONS=0} [2022-01-19 06:21:39,916 INFO L334 CegarLoopForPetriNet]: 174 programPoint places, -43 predicate places. [2022-01-19 06:21:39,917 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 0 transitions, 0 flow [2022-01-19 06:21:39,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 169.3) internal successors, (1693), 10 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:39,920 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 06:21:39,920 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-19 06:21:39,920 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-19 06:21:39,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:40,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:40,143 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-01-19 06:21:40,144 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2022-01-19 06:21:40,148 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:21:40,149 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:21:40,149 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:21:40,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 203 transitions, 414 flow [2022-01-19 06:21:40,178 INFO L129 PetriNetUnfolder]: 42/275 cut-off events. [2022-01-19 06:21:40,178 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:21:40,179 INFO L84 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 275 events. 42/275 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 887 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 135. Up to 8 conditions per place. [2022-01-19 06:21:40,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 203 transitions, 414 flow [2022-01-19 06:21:40,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 198 transitions, 401 flow [2022-01-19 06:21:40,195 INFO L129 PetriNetUnfolder]: 15/168 cut-off events. [2022-01-19 06:21:40,195 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:21:40,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:40,196 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:40,196 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:21:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1723602517, now seen corresponding path program 1 times [2022-01-19 06:21:40,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:40,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118712160] [2022-01-19 06:21:40,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:40,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:21:40,222 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 06:21:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:21:40,251 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 06:21:40,251 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 06:21:40,252 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:21:40,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 06:21:40,252 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 06:21:40,252 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 06:21:40,253 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 06:21:40,253 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-19 06:21:40,266 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,266 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,266 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,266 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,266 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,267 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,268 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,268 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,268 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,268 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,268 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,269 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,269 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,269 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,269 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,269 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,269 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,269 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,269 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,270 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,271 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,271 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,271 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,271 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,271 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,272 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,272 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,272 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,272 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,272 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,272 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,272 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,272 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,273 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,273 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,273 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,273 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,273 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,273 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,273 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,273 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,274 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,274 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,274 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,274 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,274 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,274 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,274 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,274 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,275 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,275 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,275 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,275 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,275 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,275 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,275 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,275 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,276 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,276 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,276 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,276 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,276 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,276 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,276 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,276 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,277 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,277 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,277 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,277 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,277 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,277 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,278 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,279 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,280 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,281 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,282 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,283 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,284 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,285 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,286 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,287 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,288 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,289 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,290 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,291 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:40,292 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 06:21:40,294 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:21:40,295 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:21:40,295 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 06:21:40,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 263 transitions, 544 flow [2022-01-19 06:21:40,346 INFO L129 PetriNetUnfolder]: 71/432 cut-off events. [2022-01-19 06:21:40,346 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 06:21:40,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 432 events. 71/432 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1657 event pairs, 0 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 277. Up to 12 conditions per place. [2022-01-19 06:21:40,350 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 263 transitions, 544 flow [2022-01-19 06:21:40,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 263 transitions, 544 flow [2022-01-19 06:21:40,368 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2022-01-19 06:21:40,368 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:21:40,368 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:40,368 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] [2022-01-19 06:21:40,368 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash 420502284, now seen corresponding path program 1 times [2022-01-19 06:21:40,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:40,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991261787] [2022-01-19 06:21:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:40,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:40,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:40,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991261787] [2022-01-19 06:21:40,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991261787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:40,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:40,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:21:40,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678868098] [2022-01-19 06:21:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:40,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:21:40,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:21:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:21:40,395 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 263 [2022-01-19 06:21:40,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 263 transitions, 544 flow. Second operand has 2 states, 2 states have (on average 221.5) internal successors, (443), 2 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:40,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 263 [2022-01-19 06:21:40,396 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:40,446 INFO L129 PetriNetUnfolder]: 9/365 cut-off events. [2022-01-19 06:21:40,447 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-01-19 06:21:40,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 365 events. 9/365 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1354 event pairs, 0 based on Foata normal form. 88/435 useless extension candidates. Maximal degree in co-relation 239. Up to 7 conditions per place. [2022-01-19 06:21:40,451 INFO L132 encePairwiseOnDemand]: 228/263 looper letters, 4 selfloop transitions, 0 changer transitions 0/225 dead transitions. [2022-01-19 06:21:40,451 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 225 transitions, 476 flow [2022-01-19 06:21:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:21:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:21:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 481 transitions. [2022-01-19 06:21:40,453 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9144486692015209 [2022-01-19 06:21:40,453 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 481 transitions. [2022-01-19 06:21:40,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 481 transitions. [2022-01-19 06:21:40,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:40,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 481 transitions. [2022-01-19 06:21:40,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 240.5) internal successors, (481), 2 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,456 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,456 INFO L186 Difference]: Start difference. First operand has 227 places, 263 transitions, 544 flow. Second operand 2 states and 481 transitions. [2022-01-19 06:21:40,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 225 transitions, 476 flow [2022-01-19 06:21:40,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 225 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:21:40,460 INFO L242 Difference]: Finished difference. Result has 225 places, 225 transitions, 468 flow [2022-01-19 06:21:40,461 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=468, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2022-01-19 06:21:40,461 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -2 predicate places. [2022-01-19 06:21:40,462 INFO L470 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 468 flow [2022-01-19 06:21:40,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 221.5) internal successors, (443), 2 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,462 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:40,462 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] [2022-01-19 06:21:40,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 06:21:40,463 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:40,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash -985271127, now seen corresponding path program 1 times [2022-01-19 06:21:40,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:40,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577879757] [2022-01-19 06:21:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:40,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:40,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:40,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577879757] [2022-01-19 06:21:40,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577879757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:40,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:40,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:21:40,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834869218] [2022-01-19 06:21:40,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:40,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:21:40,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:40,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:21:40,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:21:40,492 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 263 [2022-01-19 06:21:40,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:40,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 263 [2022-01-19 06:21:40,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:40,549 INFO L129 PetriNetUnfolder]: 7/320 cut-off events. [2022-01-19 06:21:40,550 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-01-19 06:21:40,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 320 events. 7/320 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1018 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 351. Up to 16 conditions per place. [2022-01-19 06:21:40,554 INFO L132 encePairwiseOnDemand]: 260/263 looper letters, 13 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2022-01-19 06:21:40,554 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 229 transitions, 506 flow [2022-01-19 06:21:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:21:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:21:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2022-01-19 06:21:40,556 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8339670468948035 [2022-01-19 06:21:40,556 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2022-01-19 06:21:40,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2022-01-19 06:21:40,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:40,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2022-01-19 06:21:40,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 263.0) internal successors, (1052), 4 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,560 INFO L186 Difference]: Start difference. First operand has 225 places, 225 transitions, 468 flow. Second operand 3 states and 658 transitions. [2022-01-19 06:21:40,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 229 transitions, 506 flow [2022-01-19 06:21:40,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 229 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:21:40,564 INFO L242 Difference]: Finished difference. Result has 228 places, 226 transitions, 480 flow [2022-01-19 06:21:40,565 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2022-01-19 06:21:40,565 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 1 predicate places. [2022-01-19 06:21:40,565 INFO L470 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 480 flow [2022-01-19 06:21:40,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,566 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:40,566 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] [2022-01-19 06:21:40,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 06:21:40,566 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash 699851186, now seen corresponding path program 1 times [2022-01-19 06:21:40,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:40,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725612579] [2022-01-19 06:21:40,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:40,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:40,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:40,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725612579] [2022-01-19 06:21:40,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725612579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:40,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:40,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 06:21:40,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348436143] [2022-01-19 06:21:40,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:40,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:21:40,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:21:40,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:21:40,680 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 263 [2022-01-19 06:21:40,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 480 flow. Second operand has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:40,682 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:40,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 263 [2022-01-19 06:21:40,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:42,262 INFO L129 PetriNetUnfolder]: 2243/8613 cut-off events. [2022-01-19 06:21:42,262 INFO L130 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2022-01-19 06:21:42,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12502 conditions, 8613 events. 2243/8613 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 98951 event pairs, 600 based on Foata normal form. 0/8227 useless extension candidates. Maximal degree in co-relation 12495. Up to 1371 conditions per place. [2022-01-19 06:21:42,313 INFO L132 encePairwiseOnDemand]: 248/263 looper letters, 183 selfloop transitions, 44 changer transitions 62/452 dead transitions. [2022-01-19 06:21:42,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 452 transitions, 1574 flow [2022-01-19 06:21:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 06:21:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 06:21:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4181 transitions. [2022-01-19 06:21:42,322 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6623891001267427 [2022-01-19 06:21:42,322 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4181 transitions. [2022-01-19 06:21:42,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4181 transitions. [2022-01-19 06:21:42,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:42,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4181 transitions. [2022-01-19 06:21:42,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 174.20833333333334) internal successors, (4181), 24 states have internal predecessors, (4181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:42,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 263.0) internal successors, (6575), 25 states have internal predecessors, (6575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:42,347 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 263.0) internal successors, (6575), 25 states have internal predecessors, (6575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:42,347 INFO L186 Difference]: Start difference. First operand has 228 places, 226 transitions, 480 flow. Second operand 24 states and 4181 transitions. [2022-01-19 06:21:42,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 452 transitions, 1574 flow [2022-01-19 06:21:42,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 452 transitions, 1572 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:21:42,357 INFO L242 Difference]: Finished difference. Result has 261 places, 276 transitions, 783 flow [2022-01-19 06:21:42,358 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=783, PETRI_PLACES=261, PETRI_TRANSITIONS=276} [2022-01-19 06:21:42,359 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 34 predicate places. [2022-01-19 06:21:42,359 INFO L470 AbstractCegarLoop]: Abstraction has has 261 places, 276 transitions, 783 flow [2022-01-19 06:21:42,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:42,360 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:42,360 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] [2022-01-19 06:21:42,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 06:21:42,361 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:42,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1416299563, now seen corresponding path program 1 times [2022-01-19 06:21:42,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:42,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918986075] [2022-01-19 06:21:42,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:42,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:42,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918986075] [2022-01-19 06:21:42,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918986075] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:42,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591832708] [2022-01-19 06:21:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:42,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:42,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:42,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:42,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 06:21:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:42,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:21:42,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:42,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:42,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591832708] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:42,784 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:42,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:21:42,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016049963] [2022-01-19 06:21:42,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:42,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:21:42,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:42,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:21:42,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:21:42,787 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 263 [2022-01-19 06:21:42,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 276 transitions, 783 flow. Second operand has 10 states, 10 states have (on average 215.3) internal successors, (2153), 10 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:42,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:42,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 263 [2022-01-19 06:21:42,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:42,859 INFO L129 PetriNetUnfolder]: 5/299 cut-off events. [2022-01-19 06:21:42,859 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-01-19 06:21:42,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 299 events. 5/299 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 932 event pairs, 0 based on Foata normal form. 2/297 useless extension candidates. Maximal degree in co-relation 372. Up to 7 conditions per place. [2022-01-19 06:21:42,861 INFO L132 encePairwiseOnDemand]: 258/263 looper letters, 9 selfloop transitions, 7 changer transitions 16/186 dead transitions. [2022-01-19 06:21:42,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 186 transitions, 513 flow [2022-01-19 06:21:42,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:21:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:21:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1935 transitions. [2022-01-19 06:21:42,866 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8174904942965779 [2022-01-19 06:21:42,866 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1935 transitions. [2022-01-19 06:21:42,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1935 transitions. [2022-01-19 06:21:42,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:42,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1935 transitions. [2022-01-19 06:21:42,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 215.0) internal successors, (1935), 9 states have internal predecessors, (1935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:42,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:42,876 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 263.0) internal successors, (2630), 10 states have internal predecessors, (2630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:42,877 INFO L186 Difference]: Start difference. First operand has 261 places, 276 transitions, 783 flow. Second operand 9 states and 1935 transitions. [2022-01-19 06:21:42,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 186 transitions, 513 flow [2022-01-19 06:21:42,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 186 transitions, 484 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-01-19 06:21:42,882 INFO L242 Difference]: Finished difference. Result has 193 places, 166 transitions, 399 flow [2022-01-19 06:21:42,883 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=399, PETRI_PLACES=193, PETRI_TRANSITIONS=166} [2022-01-19 06:21:42,884 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -34 predicate places. [2022-01-19 06:21:42,884 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 166 transitions, 399 flow [2022-01-19 06:21:42,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 215.3) internal successors, (2153), 10 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:42,885 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:42,885 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:42,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:43,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-01-19 06:21:43,099 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:43,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1994897719, now seen corresponding path program 1 times [2022-01-19 06:21:43,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:43,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743791847] [2022-01-19 06:21:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:43,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:21:43,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:43,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743791847] [2022-01-19 06:21:43,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743791847] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:43,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584576841] [2022-01-19 06:21:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:43,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:43,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:43,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:43,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 06:21:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:43,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 06:21:43,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:43,591 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:43,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:43,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:43,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:43,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:21:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:21:43,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:43,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_142 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_142) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:21:44,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:21:44,320 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:21:44,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:21:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-01-19 06:21:44,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584576841] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:44,347 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:44,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-01-19 06:21:44,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594345327] [2022-01-19 06:21:44,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:44,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-19 06:21:44,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:44,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-19 06:21:44,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2022-01-19 06:21:44,351 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 263 [2022-01-19 06:21:44,353 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 166 transitions, 399 flow. Second operand has 16 states, 16 states have (on average 165.9375) internal successors, (2655), 16 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:44,354 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:44,354 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 263 [2022-01-19 06:21:44,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:44,658 INFO L129 PetriNetUnfolder]: 144/820 cut-off events. [2022-01-19 06:21:44,658 INFO L130 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-01-19 06:21:44,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 820 events. 144/820 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5543 event pairs, 37 based on Foata normal form. 12/823 useless extension candidates. Maximal degree in co-relation 1281. Up to 139 conditions per place. [2022-01-19 06:21:44,663 INFO L132 encePairwiseOnDemand]: 253/263 looper letters, 47 selfloop transitions, 6 changer transitions 38/198 dead transitions. [2022-01-19 06:21:44,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 198 transitions, 657 flow [2022-01-19 06:21:44,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 06:21:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 06:21:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2030 transitions. [2022-01-19 06:21:44,668 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6432192648922687 [2022-01-19 06:21:44,668 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2030 transitions. [2022-01-19 06:21:44,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2030 transitions. [2022-01-19 06:21:44,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:44,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2030 transitions. [2022-01-19 06:21:44,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 169.16666666666666) internal successors, (2030), 12 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:44,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 263.0) internal successors, (3419), 13 states have internal predecessors, (3419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:44,691 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 263.0) internal successors, (3419), 13 states have internal predecessors, (3419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:44,691 INFO L186 Difference]: Start difference. First operand has 193 places, 166 transitions, 399 flow. Second operand 12 states and 2030 transitions. [2022-01-19 06:21:44,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 198 transitions, 657 flow [2022-01-19 06:21:44,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 198 transitions, 638 flow, removed 2 selfloop flow, removed 7 redundant places. [2022-01-19 06:21:44,696 INFO L242 Difference]: Finished difference. Result has 195 places, 158 transitions, 382 flow [2022-01-19 06:21:44,696 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=382, PETRI_PLACES=195, PETRI_TRANSITIONS=158} [2022-01-19 06:21:44,698 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -32 predicate places. [2022-01-19 06:21:44,698 INFO L470 AbstractCegarLoop]: Abstraction has has 195 places, 158 transitions, 382 flow [2022-01-19 06:21:44,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 165.9375) internal successors, (2655), 16 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:44,699 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:44,699 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:44,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-19 06:21:44,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:44,916 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2125697090, now seen corresponding path program 1 times [2022-01-19 06:21:44,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:44,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138519392] [2022-01-19 06:21:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:44,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:45,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:45,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138519392] [2022-01-19 06:21:45,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138519392] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:45,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:45,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:21:45,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650090826] [2022-01-19 06:21:45,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:45,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:21:45,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:45,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:21:45,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:21:45,015 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 263 [2022-01-19 06:21:45,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 158 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:45,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:45,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 263 [2022-01-19 06:21:45,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:45,098 INFO L129 PetriNetUnfolder]: 8/236 cut-off events. [2022-01-19 06:21:45,098 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-01-19 06:21:45,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 236 events. 8/236 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 547 event pairs, 1 based on Foata normal form. 12/240 useless extension candidates. Maximal degree in co-relation 350. Up to 30 conditions per place. [2022-01-19 06:21:45,099 INFO L132 encePairwiseOnDemand]: 257/263 looper letters, 29 selfloop transitions, 6 changer transitions 0/159 dead transitions. [2022-01-19 06:21:45,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 159 transitions, 459 flow [2022-01-19 06:21:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 06:21:45,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 06:21:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 932 transitions. [2022-01-19 06:21:45,102 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.708745247148289 [2022-01-19 06:21:45,102 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 932 transitions. [2022-01-19 06:21:45,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 932 transitions. [2022-01-19 06:21:45,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:45,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 932 transitions. [2022-01-19 06:21:45,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.4) internal successors, (932), 5 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:45,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:45,106 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 263.0) internal successors, (1578), 6 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:45,107 INFO L186 Difference]: Start difference. First operand has 195 places, 158 transitions, 382 flow. Second operand 5 states and 932 transitions. [2022-01-19 06:21:45,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 159 transitions, 459 flow [2022-01-19 06:21:45,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 159 transitions, 421 flow, removed 9 selfloop flow, removed 14 redundant places. [2022-01-19 06:21:45,139 INFO L242 Difference]: Finished difference. Result has 172 places, 158 transitions, 356 flow [2022-01-19 06:21:45,139 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=172, PETRI_TRANSITIONS=158} [2022-01-19 06:21:45,140 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -55 predicate places. [2022-01-19 06:21:45,140 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 158 transitions, 356 flow [2022-01-19 06:21:45,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:45,140 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:45,141 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:45,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 06:21:45,141 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash -580275093, now seen corresponding path program 1 times [2022-01-19 06:21:45,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:45,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136651426] [2022-01-19 06:21:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:45,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:21:45,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:45,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136651426] [2022-01-19 06:21:45,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136651426] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:45,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491004914] [2022-01-19 06:21:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:45,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:45,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:45,377 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:45,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 06:21:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:45,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:21:45,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:45,678 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:45,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:45,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:45,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:45,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:21:46,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:21:46,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:21:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:21:46,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:46,289 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_224 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_224) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:21:46,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:21:46,581 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:21:46,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:21:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-01-19 06:21:46,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491004914] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:46,606 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:46,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 27 [2022-01-19 06:21:46,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32492890] [2022-01-19 06:21:46,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:46,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 06:21:46,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:46,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 06:21:46,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=566, Unknown=1, NotChecked=48, Total=702 [2022-01-19 06:21:46,612 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 263 [2022-01-19 06:21:46,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 158 transitions, 356 flow. Second operand has 27 states, 27 states have (on average 159.22222222222223) internal successors, (4299), 27 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:46,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:46,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 263 [2022-01-19 06:21:46,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:47,085 INFO L129 PetriNetUnfolder]: 35/509 cut-off events. [2022-01-19 06:21:47,086 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-01-19 06:21:47,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 509 events. 35/509 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2577 event pairs, 3 based on Foata normal form. 2/499 useless extension candidates. Maximal degree in co-relation 764. Up to 77 conditions per place. [2022-01-19 06:21:47,088 INFO L132 encePairwiseOnDemand]: 243/263 looper letters, 69 selfloop transitions, 34 changer transitions 7/211 dead transitions. [2022-01-19 06:21:47,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 211 transitions, 701 flow [2022-01-19 06:21:47,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 06:21:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 06:21:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3231 transitions. [2022-01-19 06:21:47,094 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6142585551330798 [2022-01-19 06:21:47,094 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3231 transitions. [2022-01-19 06:21:47,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3231 transitions. [2022-01-19 06:21:47,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:47,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3231 transitions. [2022-01-19 06:21:47,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 161.55) internal successors, (3231), 20 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:47,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 263.0) internal successors, (5523), 21 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:47,108 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 263.0) internal successors, (5523), 21 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:47,108 INFO L186 Difference]: Start difference. First operand has 172 places, 158 transitions, 356 flow. Second operand 20 states and 3231 transitions. [2022-01-19 06:21:47,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 211 transitions, 701 flow [2022-01-19 06:21:47,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 211 transitions, 694 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 06:21:47,112 INFO L242 Difference]: Finished difference. Result has 200 places, 186 transitions, 541 flow [2022-01-19 06:21:47,113 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=541, PETRI_PLACES=200, PETRI_TRANSITIONS=186} [2022-01-19 06:21:47,113 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -27 predicate places. [2022-01-19 06:21:47,114 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 186 transitions, 541 flow [2022-01-19 06:21:47,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 159.22222222222223) internal successors, (4299), 27 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:47,115 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:47,115 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:47,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:47,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:47,349 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:47,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:47,349 INFO L85 PathProgramCache]: Analyzing trace with hash 136309515, now seen corresponding path program 1 times [2022-01-19 06:21:47,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:47,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424637433] [2022-01-19 06:21:47,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:47,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:47,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:47,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424637433] [2022-01-19 06:21:47,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424637433] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:47,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710835966] [2022-01-19 06:21:47,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:47,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:47,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:47,540 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:47,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 06:21:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:47,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-19 06:21:47,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:47,847 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:47,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:47,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:47,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:21:48,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 06:21:48,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:21:48,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:21:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:48,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:48,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_289 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_289) |c_~#B~0.base|) |c_~#B~0.offset|))) is different from false [2022-01-19 06:21:48,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:21:48,703 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:21:48,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:21:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-19 06:21:48,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710835966] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:48,726 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:48,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 27 [2022-01-19 06:21:48,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465698023] [2022-01-19 06:21:48,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:48,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 06:21:48,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:48,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 06:21:48,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=570, Unknown=1, NotChecked=48, Total=702 [2022-01-19 06:21:48,733 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 263 [2022-01-19 06:21:48,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 186 transitions, 541 flow. Second operand has 27 states, 27 states have (on average 159.14814814814815) internal successors, (4297), 27 states have internal predecessors, (4297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:48,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:48,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 263 [2022-01-19 06:21:48,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:49,336 INFO L129 PetriNetUnfolder]: 104/893 cut-off events. [2022-01-19 06:21:49,336 INFO L130 PetriNetUnfolder]: For 249/255 co-relation queries the response was YES. [2022-01-19 06:21:49,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1623 conditions, 893 events. 104/893 cut-off events. For 249/255 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6187 event pairs, 24 based on Foata normal form. 8/880 useless extension candidates. Maximal degree in co-relation 1603. Up to 157 conditions per place. [2022-01-19 06:21:49,341 INFO L132 encePairwiseOnDemand]: 244/263 looper letters, 102 selfloop transitions, 36 changer transitions 15/262 dead transitions. [2022-01-19 06:21:49,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 262 transitions, 1132 flow [2022-01-19 06:21:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 06:21:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 06:21:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4340 transitions. [2022-01-19 06:21:49,346 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6111815237290522 [2022-01-19 06:21:49,346 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4340 transitions. [2022-01-19 06:21:49,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4340 transitions. [2022-01-19 06:21:49,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:49,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4340 transitions. [2022-01-19 06:21:49,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 160.74074074074073) internal successors, (4340), 27 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:49,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 263.0) internal successors, (7364), 28 states have internal predecessors, (7364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:49,362 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 263.0) internal successors, (7364), 28 states have internal predecessors, (7364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:49,363 INFO L186 Difference]: Start difference. First operand has 200 places, 186 transitions, 541 flow. Second operand 27 states and 4340 transitions. [2022-01-19 06:21:49,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 262 transitions, 1132 flow [2022-01-19 06:21:49,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 262 transitions, 1120 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-01-19 06:21:49,368 INFO L242 Difference]: Finished difference. Result has 241 places, 217 transitions, 805 flow [2022-01-19 06:21:49,369 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=805, PETRI_PLACES=241, PETRI_TRANSITIONS=217} [2022-01-19 06:21:49,370 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 14 predicate places. [2022-01-19 06:21:49,370 INFO L470 AbstractCegarLoop]: Abstraction has has 241 places, 217 transitions, 805 flow [2022-01-19 06:21:49,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 159.14814814814815) internal successors, (4297), 27 states have internal predecessors, (4297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:49,371 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:49,371 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:49,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:49,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 06:21:49,588 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:49,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1348288533, now seen corresponding path program 2 times [2022-01-19 06:21:49,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:49,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984871943] [2022-01-19 06:21:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:49,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:21:49,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:49,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984871943] [2022-01-19 06:21:49,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984871943] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:49,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740192876] [2022-01-19 06:21:49,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:21:49,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:49,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:49,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:49,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 06:21:49,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:21:49,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:21:49,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:21:49,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:50,122 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:50,123 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:50,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:50,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:50,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:21:50,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-19 06:21:50,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:21:50,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:21:50,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:50,642 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_355 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_355) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:21:50,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:21:50,909 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:21:50,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:21:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-01-19 06:21:50,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740192876] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:50,931 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:50,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 27 [2022-01-19 06:21:50,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506952447] [2022-01-19 06:21:50,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:50,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 06:21:50,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:50,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 06:21:50,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=566, Unknown=1, NotChecked=48, Total=702 [2022-01-19 06:21:50,936 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 263 [2022-01-19 06:21:50,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 217 transitions, 805 flow. Second operand has 27 states, 27 states have (on average 159.22222222222223) internal successors, (4299), 27 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:50,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:50,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 263 [2022-01-19 06:21:50,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:51,635 INFO L129 PetriNetUnfolder]: 115/1046 cut-off events. [2022-01-19 06:21:51,635 INFO L130 PetriNetUnfolder]: For 1137/1193 co-relation queries the response was YES. [2022-01-19 06:21:51,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2424 conditions, 1046 events. 115/1046 cut-off events. For 1137/1193 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7822 event pairs, 8 based on Foata normal form. 20/1036 useless extension candidates. Maximal degree in co-relation 2385. Up to 213 conditions per place. [2022-01-19 06:21:51,643 INFO L132 encePairwiseOnDemand]: 243/263 looper letters, 102 selfloop transitions, 62 changer transitions 21/294 dead transitions. [2022-01-19 06:21:51,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 294 transitions, 1690 flow [2022-01-19 06:21:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 06:21:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 06:21:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4487 transitions. [2022-01-19 06:21:51,651 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6093155893536122 [2022-01-19 06:21:51,651 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4487 transitions. [2022-01-19 06:21:51,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4487 transitions. [2022-01-19 06:21:51,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:51,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4487 transitions. [2022-01-19 06:21:51,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 160.25) internal successors, (4487), 28 states have internal predecessors, (4487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:51,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 263.0) internal successors, (7627), 29 states have internal predecessors, (7627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:51,672 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 263.0) internal successors, (7627), 29 states have internal predecessors, (7627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:51,672 INFO L186 Difference]: Start difference. First operand has 241 places, 217 transitions, 805 flow. Second operand 28 states and 4487 transitions. [2022-01-19 06:21:51,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 294 transitions, 1690 flow [2022-01-19 06:21:51,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 294 transitions, 1658 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-01-19 06:21:51,683 INFO L242 Difference]: Finished difference. Result has 274 places, 255 transitions, 1297 flow [2022-01-19 06:21:51,684 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1297, PETRI_PLACES=274, PETRI_TRANSITIONS=255} [2022-01-19 06:21:51,684 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 47 predicate places. [2022-01-19 06:21:51,684 INFO L470 AbstractCegarLoop]: Abstraction has has 274 places, 255 transitions, 1297 flow [2022-01-19 06:21:51,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 159.22222222222223) internal successors, (4299), 27 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:51,685 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:51,686 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:51,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:51,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:51,912 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:51,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1251080619, now seen corresponding path program 3 times [2022-01-19 06:21:51,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:51,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994036799] [2022-01-19 06:21:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:51,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:52,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:52,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994036799] [2022-01-19 06:21:52,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994036799] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:52,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749603999] [2022-01-19 06:21:52,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:21:52,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:52,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:52,124 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:52,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 06:21:52,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 06:21:52,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:21:52,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-19 06:21:52,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:52,435 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:52,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:52,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:52,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:21:52,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 06:21:52,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:21:52,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:21:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:52,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:52,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_420) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:21:53,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:21:53,242 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:21:53,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:21:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-19 06:21:53,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749603999] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:53,268 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:53,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 27 [2022-01-19 06:21:53,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864769026] [2022-01-19 06:21:53,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:53,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 06:21:53,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:53,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 06:21:53,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=570, Unknown=1, NotChecked=48, Total=702 [2022-01-19 06:21:53,274 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 263 [2022-01-19 06:21:53,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 255 transitions, 1297 flow. Second operand has 27 states, 27 states have (on average 159.14814814814815) internal successors, (4297), 27 states have internal predecessors, (4297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:53,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:53,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 263 [2022-01-19 06:21:53,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:53,895 INFO L129 PetriNetUnfolder]: 105/991 cut-off events. [2022-01-19 06:21:53,895 INFO L130 PetriNetUnfolder]: For 1923/1996 co-relation queries the response was YES. [2022-01-19 06:21:53,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 991 events. 105/991 cut-off events. For 1923/1996 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7226 event pairs, 15 based on Foata normal form. 29/996 useless extension candidates. Maximal degree in co-relation 2586. Up to 111 conditions per place. [2022-01-19 06:21:53,905 INFO L132 encePairwiseOnDemand]: 243/263 looper letters, 87 selfloop transitions, 89 changer transitions 20/305 dead transitions. [2022-01-19 06:21:53,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 305 transitions, 2101 flow [2022-01-19 06:21:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-19 06:21:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-19 06:21:53,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4168 transitions. [2022-01-19 06:21:53,911 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6095349517402749 [2022-01-19 06:21:53,911 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4168 transitions. [2022-01-19 06:21:53,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4168 transitions. [2022-01-19 06:21:53,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:53,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4168 transitions. [2022-01-19 06:21:53,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 160.30769230769232) internal successors, (4168), 26 states have internal predecessors, (4168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:53,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 263.0) internal successors, (7101), 27 states have internal predecessors, (7101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:53,924 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 263.0) internal successors, (7101), 27 states have internal predecessors, (7101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:53,924 INFO L186 Difference]: Start difference. First operand has 274 places, 255 transitions, 1297 flow. Second operand 26 states and 4168 transitions. [2022-01-19 06:21:53,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 305 transitions, 2101 flow [2022-01-19 06:21:53,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 305 transitions, 2006 flow, removed 42 selfloop flow, removed 12 redundant places. [2022-01-19 06:21:53,941 INFO L242 Difference]: Finished difference. Result has 293 places, 267 transitions, 1580 flow [2022-01-19 06:21:53,941 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1580, PETRI_PLACES=293, PETRI_TRANSITIONS=267} [2022-01-19 06:21:53,941 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 66 predicate places. [2022-01-19 06:21:53,941 INFO L470 AbstractCegarLoop]: Abstraction has has 293 places, 267 transitions, 1580 flow [2022-01-19 06:21:53,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 159.14814814814815) internal successors, (4297), 27 states have internal predecessors, (4297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:53,942 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:53,943 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:53,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:54,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:54,159 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash -630158235, now seen corresponding path program 4 times [2022-01-19 06:21:54,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:54,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636686282] [2022-01-19 06:21:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:54,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:54,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:54,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636686282] [2022-01-19 06:21:54,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636686282] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:54,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152851574] [2022-01-19 06:21:54,388 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 06:21:54,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:54,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:54,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:54,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 06:21:54,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 06:21:54,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:21:54,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:21:54,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:54,736 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:54,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:54,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:54,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:21:54,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-19 06:21:55,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-19 06:21:55,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:21:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:55,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:55,302 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_488) |c_~#B~0.base|) |c_~#B~0.offset|) 1)) (forall ((v_ArrVal_488 (Array Int Int))) (<= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_488) |c_~#B~0.base|) |c_~#B~0.offset|)))) is different from false [2022-01-19 06:21:55,363 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_488 (Array Int Int))) (<= 1 (select (select (store (store |c_#memory_int| |c_~#B~0.base| (store (select |c_#memory_int| |c_~#B~0.base|) |c_~#B~0.offset| (+ |c_t_funThread1of2ForFork0_#t~post7#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_488) |c_~#B~0.base|) |c_~#B~0.offset|))) (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_~#B~0.base| (store (select |c_#memory_int| |c_~#B~0.base|) |c_~#B~0.offset| (+ |c_t_funThread1of2ForFork0_#t~post7#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_488) |c_~#B~0.base|) |c_~#B~0.offset|) 1))) is different from false [2022-01-19 06:21:55,371 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_~#B~0.base| (store (select |c_#memory_int| |c_~#B~0.base|) |c_~#B~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_488) |c_~#B~0.base|) |c_~#B~0.offset|) 1)) (forall ((v_ArrVal_488 (Array Int Int))) (<= 1 (select (select (store (store |c_#memory_int| |c_~#B~0.base| (store (select |c_#memory_int| |c_~#B~0.base|) |c_~#B~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_488) |c_~#B~0.base|) |c_~#B~0.offset|)))) is different from false [2022-01-19 06:21:55,380 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_488 (Array Int Int))) (<= (select (select (store (store |c_#memory_int| |c_~#B~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#B~0.base|))) (store .cse0 |c_~#B~0.offset| (+ (select .cse0 |c_~#B~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_488) |c_~#B~0.base|) |c_~#B~0.offset|) 1)) (forall ((v_ArrVal_488 (Array Int Int))) (<= 1 (select (select (store (store |c_#memory_int| |c_~#B~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#B~0.base|))) (store .cse1 |c_~#B~0.offset| (+ (select .cse1 |c_~#B~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_488) |c_~#B~0.base|) |c_~#B~0.offset|)))) is different from false [2022-01-19 06:21:55,441 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_485 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (<= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_485))) (store .cse0 |c_~#B~0.base| (let ((.cse1 (select .cse0 |c_~#B~0.base|))) (store .cse1 |c_~#B~0.offset| (+ (select .cse1 |c_~#B~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_488) |c_~#B~0.base|) |c_~#B~0.offset|) 1)) (forall ((v_ArrVal_485 (Array Int Int)) (v_ArrVal_488 (Array Int Int))) (<= 1 (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_485))) (store .cse2 |c_~#B~0.base| (let ((.cse3 (select .cse2 |c_~#B~0.base|))) (store .cse3 |c_~#B~0.offset| (+ (select .cse3 |c_~#B~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_488) |c_~#B~0.base|) |c_~#B~0.offset|)))) is different from false [2022-01-19 06:21:56,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2022-01-19 06:21:56,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-01-19 06:21:56,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2022-01-19 06:21:56,106 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:21:56,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:21:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-19 06:21:56,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152851574] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:56,130 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:56,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 33 [2022-01-19 06:21:56,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932762604] [2022-01-19 06:21:56,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:56,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-19 06:21:56,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-19 06:21:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=663, Unknown=5, NotChecked=280, Total=1056 [2022-01-19 06:21:56,134 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 263 [2022-01-19 06:21:56,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 267 transitions, 1580 flow. Second operand has 33 states, 33 states have (on average 158.78787878787878) internal successors, (5240), 33 states have internal predecessors, (5240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:56,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:56,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 263 [2022-01-19 06:21:56,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:56,738 INFO L129 PetriNetUnfolder]: 99/919 cut-off events. [2022-01-19 06:21:56,738 INFO L130 PetriNetUnfolder]: For 2120/2227 co-relation queries the response was YES. [2022-01-19 06:21:56,744 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 919 events. 99/919 cut-off events. For 2120/2227 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6468 event pairs, 4 based on Foata normal form. 21/922 useless extension candidates. Maximal degree in co-relation 2625. Up to 127 conditions per place. [2022-01-19 06:21:56,746 INFO L132 encePairwiseOnDemand]: 244/263 looper letters, 114 selfloop transitions, 17 changer transitions 73/313 dead transitions. [2022-01-19 06:21:56,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 313 transitions, 2516 flow [2022-01-19 06:21:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 06:21:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 06:21:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2747 transitions. [2022-01-19 06:21:56,750 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6144039364795347 [2022-01-19 06:21:56,750 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2747 transitions. [2022-01-19 06:21:56,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2747 transitions. [2022-01-19 06:21:56,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:56,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2747 transitions. [2022-01-19 06:21:56,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 161.58823529411765) internal successors, (2747), 17 states have internal predecessors, (2747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:56,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 263.0) internal successors, (4734), 18 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:56,758 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 263.0) internal successors, (4734), 18 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:56,758 INFO L186 Difference]: Start difference. First operand has 293 places, 267 transitions, 1580 flow. Second operand 17 states and 2747 transitions. [2022-01-19 06:21:56,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 313 transitions, 2516 flow [2022-01-19 06:21:56,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 313 transitions, 2372 flow, removed 45 selfloop flow, removed 14 redundant places. [2022-01-19 06:21:56,777 INFO L242 Difference]: Finished difference. Result has 299 places, 239 transitions, 1236 flow [2022-01-19 06:21:56,777 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1236, PETRI_PLACES=299, PETRI_TRANSITIONS=239} [2022-01-19 06:21:56,777 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 72 predicate places. [2022-01-19 06:21:56,777 INFO L470 AbstractCegarLoop]: Abstraction has has 299 places, 239 transitions, 1236 flow [2022-01-19 06:21:56,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 158.78787878787878) internal successors, (5240), 33 states have internal predecessors, (5240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:56,778 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:56,779 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:56,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-19 06:21:56,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 06:21:56,994 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:56,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:56,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1315694355, now seen corresponding path program 2 times [2022-01-19 06:21:56,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:56,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336491179] [2022-01-19 06:21:56,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:56,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:21:57,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:57,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336491179] [2022-01-19 06:21:57,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336491179] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:57,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259959638] [2022-01-19 06:21:57,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:21:57,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:57,176 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:57,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 06:21:57,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:21:57,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:21:57,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:21:57,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:57,507 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:57,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:57,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:57,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:57,700 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:21:57,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 06:21:57,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:21:57,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:21:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:21:57,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:58,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_556) |c_~#B~0.base|) |c_~#B~0.offset|))) is different from false [2022-01-19 06:21:58,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:21:58,356 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:21:58,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:21:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 14 not checked. [2022-01-19 06:21:58,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259959638] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:58,385 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:58,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 27 [2022-01-19 06:21:58,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627603442] [2022-01-19 06:21:58,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:58,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 06:21:58,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:58,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 06:21:58,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=570, Unknown=1, NotChecked=48, Total=702 [2022-01-19 06:21:58,389 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 263 [2022-01-19 06:21:58,392 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 239 transitions, 1236 flow. Second operand has 27 states, 27 states have (on average 159.2962962962963) internal successors, (4301), 27 states have internal predecessors, (4301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:58,392 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:58,392 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 263 [2022-01-19 06:21:58,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:58,960 INFO L129 PetriNetUnfolder]: 34/560 cut-off events. [2022-01-19 06:21:58,960 INFO L130 PetriNetUnfolder]: For 684/726 co-relation queries the response was YES. [2022-01-19 06:21:58,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 560 events. 34/560 cut-off events. For 684/726 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2963 event pairs, 1 based on Foata normal form. 12/559 useless extension candidates. Maximal degree in co-relation 1314. Up to 60 conditions per place. [2022-01-19 06:21:58,964 INFO L132 encePairwiseOnDemand]: 243/263 looper letters, 77 selfloop transitions, 27 changer transitions 28/258 dead transitions. [2022-01-19 06:21:58,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 258 transitions, 1579 flow [2022-01-19 06:21:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 06:21:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 06:21:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4304 transitions. [2022-01-19 06:21:58,971 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6061118152372905 [2022-01-19 06:21:58,971 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4304 transitions. [2022-01-19 06:21:58,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4304 transitions. [2022-01-19 06:21:58,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:58,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4304 transitions. [2022-01-19 06:21:58,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 159.40740740740742) internal successors, (4304), 27 states have internal predecessors, (4304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:58,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 263.0) internal successors, (7364), 28 states have internal predecessors, (7364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:58,984 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 263.0) internal successors, (7364), 28 states have internal predecessors, (7364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:58,984 INFO L186 Difference]: Start difference. First operand has 299 places, 239 transitions, 1236 flow. Second operand 27 states and 4304 transitions. [2022-01-19 06:21:58,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 258 transitions, 1579 flow [2022-01-19 06:21:58,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 258 transitions, 1366 flow, removed 62 selfloop flow, removed 31 redundant places. [2022-01-19 06:21:58,995 INFO L242 Difference]: Finished difference. Result has 298 places, 229 transitions, 1076 flow [2022-01-19 06:21:58,995 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1076, PETRI_PLACES=298, PETRI_TRANSITIONS=229} [2022-01-19 06:21:58,995 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 71 predicate places. [2022-01-19 06:21:58,995 INFO L470 AbstractCegarLoop]: Abstraction has has 298 places, 229 transitions, 1076 flow [2022-01-19 06:21:58,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 159.2962962962963) internal successors, (4301), 27 states have internal predecessors, (4301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:58,996 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:58,997 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:59,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:59,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-19 06:21:59,211 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash 27292891, now seen corresponding path program 3 times [2022-01-19 06:21:59,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:59,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107943385] [2022-01-19 06:21:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:59,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-19 06:21:59,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:59,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107943385] [2022-01-19 06:21:59,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107943385] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:59,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602239547] [2022-01-19 06:21:59,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:21:59,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:59,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:59,456 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:59,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 06:21:59,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-19 06:21:59,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:21:59,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-19 06:21:59,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:59,778 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:59,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:59,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:21:59,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:22:00,079 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:22:00,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:22:00,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:22:00,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:22:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-19 06:22:00,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:00,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_629) |c_~#B~0.base|) |c_~#B~0.offset|)) 0)) is different from false [2022-01-19 06:22:00,413 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#B~0.base| (store (select |c_#memory_int| |c_~#B~0.base|) |c_~#B~0.offset| (+ |c_t_funThread2of2ForFork0_#t~post7#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_629) |c_~#B~0.base|) |c_~#B~0.offset|)) 0)) is different from false [2022-01-19 06:22:00,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#B~0.base| (store (select |c_#memory_int| |c_~#B~0.base|) |c_~#B~0.offset| (+ |c_t_funThread2of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_629) |c_~#B~0.base|) |c_~#B~0.offset|)) 0)) is different from false [2022-01-19 06:22:00,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#B~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#B~0.base|))) (store .cse0 |c_~#B~0.offset| (+ (select .cse0 |c_~#B~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_629) |c_~#B~0.base|) |c_~#B~0.offset|)) 0)) is different from false [2022-01-19 06:22:00,489 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_629 (Array Int Int))) (= (+ (- 1) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_626))) (store .cse0 |c_~#B~0.base| (let ((.cse1 (select .cse0 |c_~#B~0.base|))) (store .cse1 |c_~#B~0.offset| (+ (select .cse1 |c_~#B~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_629) |c_~#B~0.base|) |c_~#B~0.offset|)) 0)) is different from false [2022-01-19 06:22:00,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2022-01-19 06:22:00,794 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:00,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:22:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 14 not checked. [2022-01-19 06:22:00,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602239547] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:00,816 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:00,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 33 [2022-01-19 06:22:00,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110576695] [2022-01-19 06:22:00,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:00,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-19 06:22:00,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:00,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-19 06:22:00,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=661, Unknown=5, NotChecked=280, Total=1056 [2022-01-19 06:22:00,822 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 263 [2022-01-19 06:22:00,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 229 transitions, 1076 flow. Second operand has 33 states, 33 states have (on average 158.72727272727272) internal successors, (5238), 33 states have internal predecessors, (5238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:00,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:00,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 263 [2022-01-19 06:22:00,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:01,348 INFO L129 PetriNetUnfolder]: 28/475 cut-off events. [2022-01-19 06:22:01,348 INFO L130 PetriNetUnfolder]: For 463/497 co-relation queries the response was YES. [2022-01-19 06:22:01,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 475 events. 28/475 cut-off events. For 463/497 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2236 event pairs, 1 based on Foata normal form. 12/476 useless extension candidates. Maximal degree in co-relation 1057. Up to 45 conditions per place. [2022-01-19 06:22:01,351 INFO L132 encePairwiseOnDemand]: 243/263 looper letters, 48 selfloop transitions, 26 changer transitions 49/232 dead transitions. [2022-01-19 06:22:01,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 232 transitions, 1315 flow [2022-01-19 06:22:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 06:22:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 06:22:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4449 transitions. [2022-01-19 06:22:01,356 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.604155350353069 [2022-01-19 06:22:01,357 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4449 transitions. [2022-01-19 06:22:01,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4449 transitions. [2022-01-19 06:22:01,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:01,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4449 transitions. [2022-01-19 06:22:01,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 158.89285714285714) internal successors, (4449), 28 states have internal predecessors, (4449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:01,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 263.0) internal successors, (7627), 29 states have internal predecessors, (7627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:01,368 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 263.0) internal successors, (7627), 29 states have internal predecessors, (7627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:01,368 INFO L186 Difference]: Start difference. First operand has 298 places, 229 transitions, 1076 flow. Second operand 28 states and 4449 transitions. [2022-01-19 06:22:01,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 232 transitions, 1315 flow [2022-01-19 06:22:01,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 232 transitions, 1185 flow, removed 26 selfloop flow, removed 35 redundant places. [2022-01-19 06:22:01,377 INFO L242 Difference]: Finished difference. Result has 278 places, 182 transitions, 842 flow [2022-01-19 06:22:01,378 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=842, PETRI_PLACES=278, PETRI_TRANSITIONS=182} [2022-01-19 06:22:01,378 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 51 predicate places. [2022-01-19 06:22:01,378 INFO L470 AbstractCegarLoop]: Abstraction has has 278 places, 182 transitions, 842 flow [2022-01-19 06:22:01,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 158.72727272727272) internal successors, (5238), 33 states have internal predecessors, (5238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:01,379 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:01,379 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:22:01,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 06:22:01,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-19 06:22:01,607 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:22:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:01,607 INFO L85 PathProgramCache]: Analyzing trace with hash 460286623, now seen corresponding path program 5 times [2022-01-19 06:22:01,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:01,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394330509] [2022-01-19 06:22:01,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:01,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-19 06:22:01,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:01,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394330509] [2022-01-19 06:22:01,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394330509] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:01,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280112014] [2022-01-19 06:22:01,829 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 06:22:01,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:01,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:01,830 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:22:01,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 06:22:01,940 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-19 06:22:01,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:22:01,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-19 06:22:01,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:02,131 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:02,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:22:02,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:22:02,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:22:02,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:22:02,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:22:02,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:22:02,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:22:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-19 06:22:02,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:22:02,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280112014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:22:02,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:22:02,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 24 [2022-01-19 06:22:02,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988218859] [2022-01-19 06:22:02,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:22:02,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 06:22:02,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:02,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 06:22:02,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-01-19 06:22:02,628 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 263 [2022-01-19 06:22:02,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 182 transitions, 842 flow. Second operand has 15 states, 15 states have (on average 159.46666666666667) internal successors, (2392), 15 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:02,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:02,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 263 [2022-01-19 06:22:02,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:02,889 INFO L129 PetriNetUnfolder]: 35/414 cut-off events. [2022-01-19 06:22:02,889 INFO L130 PetriNetUnfolder]: For 557/659 co-relation queries the response was YES. [2022-01-19 06:22:02,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 414 events. 35/414 cut-off events. For 557/659 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1591 event pairs, 4 based on Foata normal form. 14/421 useless extension candidates. Maximal degree in co-relation 989. Up to 47 conditions per place. [2022-01-19 06:22:02,891 INFO L132 encePairwiseOnDemand]: 249/263 looper letters, 0 selfloop transitions, 0 changer transitions 185/185 dead transitions. [2022-01-19 06:22:02,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 185 transitions, 1107 flow [2022-01-19 06:22:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 06:22:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 06:22:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2244 transitions. [2022-01-19 06:22:02,894 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6094513851167843 [2022-01-19 06:22:02,894 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2244 transitions. [2022-01-19 06:22:02,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2244 transitions. [2022-01-19 06:22:02,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:02,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2244 transitions. [2022-01-19 06:22:02,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 160.28571428571428) internal successors, (2244), 14 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:02,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 263.0) internal successors, (3945), 15 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:02,903 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 263.0) internal successors, (3945), 15 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:02,904 INFO L186 Difference]: Start difference. First operand has 278 places, 182 transitions, 842 flow. Second operand 14 states and 2244 transitions. [2022-01-19 06:22:02,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 185 transitions, 1107 flow [2022-01-19 06:22:02,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 185 transitions, 1048 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 06:22:02,909 INFO L242 Difference]: Finished difference. Result has 220 places, 0 transitions, 0 flow [2022-01-19 06:22:02,909 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=220, PETRI_TRANSITIONS=0} [2022-01-19 06:22:02,910 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -7 predicate places. [2022-01-19 06:22:02,910 INFO L470 AbstractCegarLoop]: Abstraction has has 220 places, 0 transitions, 0 flow [2022-01-19 06:22:02,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 159.46666666666667) internal successors, (2392), 15 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:02,910 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 06:22:02,910 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-19 06:22:02,910 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-19 06:22:02,910 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-19 06:22:02,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-19 06:22:03,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-19 06:22:03,111 INFO L732 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1] [2022-01-19 06:22:03,111 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2022-01-19 06:22:03,112 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:22:03,115 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:22:03,115 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:22:03,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 263 transitions, 544 flow [2022-01-19 06:22:03,139 INFO L129 PetriNetUnfolder]: 71/432 cut-off events. [2022-01-19 06:22:03,139 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 06:22:03,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 432 events. 71/432 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1657 event pairs, 0 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 277. Up to 12 conditions per place. [2022-01-19 06:22:03,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 263 transitions, 544 flow [2022-01-19 06:22:03,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 263 transitions, 544 flow [2022-01-19 06:22:03,157 INFO L129 PetriNetUnfolder]: 43/311 cut-off events. [2022-01-19 06:22:03,157 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 06:22:03,157 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:03,157 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:22:03,157 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:22:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2052762263, now seen corresponding path program 1 times [2022-01-19 06:22:03,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:03,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612608325] [2022-01-19 06:22:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:03,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:22:03,167 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 06:22:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:22:03,182 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 06:22:03,183 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 06:22:03,183 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:22:03,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 06:22:03,183 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 06:22:03,183 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 06:22:03,183 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 06:22:03,183 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-01-19 06:22:03,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,197 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,198 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,199 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,200 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,201 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,202 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,203 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,204 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,205 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,206 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,207 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,208 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,209 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,210 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,211 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,212 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,213 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,214 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,215 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,216 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,217 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,218 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,219 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:03,221 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 06:22:03,225 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:22:03,225 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:22:03,225 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 06:22:03,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 276 places, 323 transitions, 676 flow [2022-01-19 06:22:03,271 INFO L129 PetriNetUnfolder]: 105/622 cut-off events. [2022-01-19 06:22:03,272 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-01-19 06:22:03,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 622 events. 105/622 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2631 event pairs, 1 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 440. Up to 16 conditions per place. [2022-01-19 06:22:03,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 323 transitions, 676 flow [2022-01-19 06:22:03,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 323 transitions, 676 flow [2022-01-19 06:22:03,284 INFO L129 PetriNetUnfolder]: 15/163 cut-off events. [2022-01-19 06:22:03,285 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:22:03,285 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:03,285 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] [2022-01-19 06:22:03,285 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:22:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:03,285 INFO L85 PathProgramCache]: Analyzing trace with hash 645618892, now seen corresponding path program 1 times [2022-01-19 06:22:03,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:03,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384529622] [2022-01-19 06:22:03,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:03,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:22:03,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:03,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384529622] [2022-01-19 06:22:03,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384529622] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:22:03,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:22:03,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:22:03,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625080638] [2022-01-19 06:22:03,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:22:03,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:22:03,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:03,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:22:03,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:22:03,306 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 323 [2022-01-19 06:22:03,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 323 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:03,307 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:03,307 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 323 [2022-01-19 06:22:03,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:03,375 INFO L129 PetriNetUnfolder]: 14/481 cut-off events. [2022-01-19 06:22:03,375 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-01-19 06:22:03,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 481 events. 14/481 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1927 event pairs, 1 based on Foata normal form. 335/792 useless extension candidates. Maximal degree in co-relation 348. Up to 30 conditions per place. [2022-01-19 06:22:03,381 INFO L132 encePairwiseOnDemand]: 274/323 looper letters, 15 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2022-01-19 06:22:03,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 277 transitions, 618 flow [2022-01-19 06:22:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:22:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:22:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2022-01-19 06:22:03,383 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8833849329205367 [2022-01-19 06:22:03,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 856 transitions. [2022-01-19 06:22:03,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 856 transitions. [2022-01-19 06:22:03,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:03,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 856 transitions. [2022-01-19 06:22:03,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 285.3333333333333) internal successors, (856), 3 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:03,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:03,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:03,386 INFO L186 Difference]: Start difference. First operand has 276 places, 323 transitions, 676 flow. Second operand 3 states and 856 transitions. [2022-01-19 06:22:03,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 277 transitions, 618 flow [2022-01-19 06:22:03,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 277 transitions, 618 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:22:03,390 INFO L242 Difference]: Finished difference. Result has 275 places, 274 transitions, 588 flow [2022-01-19 06:22:03,391 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=275, PETRI_TRANSITIONS=274} [2022-01-19 06:22:03,391 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, -1 predicate places. [2022-01-19 06:22:03,391 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 588 flow [2022-01-19 06:22:03,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:03,391 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:03,391 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] [2022-01-19 06:22:03,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 06:22:03,392 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:22:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash -245225620, now seen corresponding path program 1 times [2022-01-19 06:22:03,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:03,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15355653] [2022-01-19 06:22:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:03,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:22:03,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:03,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15355653] [2022-01-19 06:22:03,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15355653] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:22:03,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:22:03,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 06:22:03,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178663013] [2022-01-19 06:22:03,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:22:03,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:22:03,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:03,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:22:03,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:22:03,486 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 323 [2022-01-19 06:22:03,487 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 588 flow. Second operand has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:03,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:03,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 323 [2022-01-19 06:22:03,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:10,831 INFO L129 PetriNetUnfolder]: 23971/72143 cut-off events. [2022-01-19 06:22:10,831 INFO L130 PetriNetUnfolder]: For 2761/2761 co-relation queries the response was YES. [2022-01-19 06:22:11,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107751 conditions, 72143 events. 23971/72143 cut-off events. For 2761/2761 co-relation queries the response was YES. Maximal size of possible extension queue 2960. Compared 1040615 event pairs, 5334 based on Foata normal form. 0/70062 useless extension candidates. Maximal degree in co-relation 107633. Up to 13661 conditions per place. [2022-01-19 06:22:11,351 INFO L132 encePairwiseOnDemand]: 307/323 looper letters, 343 selfloop transitions, 58 changer transitions 0/605 dead transitions. [2022-01-19 06:22:11,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 605 transitions, 2216 flow [2022-01-19 06:22:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 06:22:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 06:22:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5277 transitions. [2022-01-19 06:22:11,358 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6807275541795665 [2022-01-19 06:22:11,358 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5277 transitions. [2022-01-19 06:22:11,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5277 transitions. [2022-01-19 06:22:11,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:11,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5277 transitions. [2022-01-19 06:22:11,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 219.875) internal successors, (5277), 24 states have internal predecessors, (5277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:11,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:11,507 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:11,507 INFO L186 Difference]: Start difference. First operand has 275 places, 274 transitions, 588 flow. Second operand 24 states and 5277 transitions. [2022-01-19 06:22:11,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 605 transitions, 2216 flow [2022-01-19 06:22:11,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 605 transitions, 2214 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:22:11,517 INFO L242 Difference]: Finished difference. Result has 311 places, 335 transitions, 1008 flow [2022-01-19 06:22:11,518 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1008, PETRI_PLACES=311, PETRI_TRANSITIONS=335} [2022-01-19 06:22:11,519 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 35 predicate places. [2022-01-19 06:22:11,519 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 335 transitions, 1008 flow [2022-01-19 06:22:11,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:11,519 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:11,519 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] [2022-01-19 06:22:11,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 06:22:11,520 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:22:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash -367962712, now seen corresponding path program 1 times [2022-01-19 06:22:11,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:11,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252480664] [2022-01-19 06:22:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:11,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:22:11,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:11,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252480664] [2022-01-19 06:22:11,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252480664] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:11,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615485034] [2022-01-19 06:22:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:11,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:11,551 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:22:11,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-19 06:22:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:11,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:22:11,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:22:11,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:22:11,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615485034] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:11,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:11,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:22:11,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119520693] [2022-01-19 06:22:11,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:11,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:22:11,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:11,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:22:11,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:22:11,854 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 323 [2022-01-19 06:22:11,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 335 transitions, 1008 flow. Second operand has 10 states, 10 states have (on average 261.3) internal successors, (2613), 10 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:11,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:11,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 323 [2022-01-19 06:22:11,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:12,302 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_21| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_21|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_21|} AuxVars[] AssignedVars[][304], [166#L1013-30true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 81#L1037-5true, Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 305#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 347#true, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-01-19 06:22:12,302 INFO L384 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2022-01-19 06:22:12,302 INFO L387 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-01-19 06:22:12,302 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-01-19 06:22:12,302 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-01-19 06:22:12,310 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_21| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_21|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_21|} AuxVars[] AssignedVars[][304], [162#L1013-32true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 81#L1037-5true, Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 307#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5))]) [2022-01-19 06:22:12,310 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2022-01-19 06:22:12,311 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-01-19 06:22:12,311 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-01-19 06:22:12,311 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-01-19 06:22:12,314 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_21| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_21|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_21|} AuxVars[] AssignedVars[][304], [Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 81#L1037-5true, Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 4#L1013-8true, t_funThread1of3ForFork0InUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 347#true, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-01-19 06:22:12,314 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-01-19 06:22:12,314 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-01-19 06:22:12,314 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-01-19 06:22:12,314 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-01-19 06:22:12,316 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] t_funEXIT-->L1037-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_23| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_23|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_23|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [166#L1013-30true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 305#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), 81#L1037-5true, Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-01-19 06:22:12,316 INFO L384 tUnfolder$Statistics]: this new event has 178 ancestors and is not cut-off event [2022-01-19 06:22:12,316 INFO L387 tUnfolder$Statistics]: existing Event has 186 ancestors and is not cut-off event [2022-01-19 06:22:12,316 INFO L387 tUnfolder$Statistics]: existing Event has 186 ancestors and is not cut-off event [2022-01-19 06:22:12,316 INFO L387 tUnfolder$Statistics]: existing Event has 178 ancestors and is not cut-off event [2022-01-19 06:22:12,319 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1281] t_funEXIT-->L1037-5: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_21| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_21|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_21|} AuxVars[] AssignedVars[][304], [Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 81#L1037-5true, Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread1of3ForFork0InUse, Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), t_funThread2of3ForFork0NotInUse, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 236#L999-1true, Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-01-19 06:22:12,319 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2022-01-19 06:22:12,319 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-01-19 06:22:12,319 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-01-19 06:22:12,319 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-01-19 06:22:12,323 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] t_funEXIT-->L1037-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_23| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_23|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_23|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [162#L1013-32true, Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 81#L1037-5true, Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), 347#true, Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 307#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5))]) [2022-01-19 06:22:12,323 INFO L384 tUnfolder$Statistics]: this new event has 180 ancestors and is not cut-off event [2022-01-19 06:22:12,323 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is not cut-off event [2022-01-19 06:22:12,323 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is not cut-off event [2022-01-19 06:22:12,323 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is not cut-off event [2022-01-19 06:22:12,325 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] t_funEXIT-->L1037-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_23| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_23|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_23|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 81#L1037-5true, Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, 4#L1013-8true, t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, t_funThread3of3ForFork0NotInUse, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5))]) [2022-01-19 06:22:12,325 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is not cut-off event [2022-01-19 06:22:12,325 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is not cut-off event [2022-01-19 06:22:12,325 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is not cut-off event [2022-01-19 06:22:12,325 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is not cut-off event [2022-01-19 06:22:12,330 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1282] t_funEXIT-->L1037-5: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_23| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_23|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_23|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [Black: 323#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), 81#L1037-5true, Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), Black: 288#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 286#(= |~#B~0.base| 5), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 295#(and (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 329#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 297#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 347#true, Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), t_funThread3of3ForFork0NotInUse, Black: 303#(and (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 236#L999-1true, Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#B~0.base|))), 309#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#B~0.base| 5)), Black: 313#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| |~#B~0.base|) |~#B~0.offset|) 0) (= |~#B~0.base| 5)), Black: 287#(and (= 1 (select |#valid| 5)) (= |~#B~0.base| 5)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0)]) [2022-01-19 06:22:12,330 INFO L384 tUnfolder$Statistics]: this new event has 182 ancestors and is not cut-off event [2022-01-19 06:22:12,330 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is not cut-off event [2022-01-19 06:22:12,330 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is not cut-off event [2022-01-19 06:22:12,330 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is not cut-off event [2022-01-19 06:22:12,356 INFO L129 PetriNetUnfolder]: 583/4425 cut-off events. [2022-01-19 06:22:12,357 INFO L130 PetriNetUnfolder]: For 7316/8075 co-relation queries the response was YES. [2022-01-19 06:22:12,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8859 conditions, 4425 events. 583/4425 cut-off events. For 7316/8075 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 44844 event pairs, 149 based on Foata normal form. 37/4209 useless extension candidates. Maximal degree in co-relation 8694. Up to 512 conditions per place. [2022-01-19 06:22:12,413 INFO L132 encePairwiseOnDemand]: 317/323 looper letters, 16 selfloop transitions, 9 changer transitions 0/345 dead transitions. [2022-01-19 06:22:12,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 345 transitions, 1080 flow [2022-01-19 06:22:12,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:22:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:22:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2358 transitions. [2022-01-19 06:22:12,416 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8111455108359134 [2022-01-19 06:22:12,416 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2358 transitions. [2022-01-19 06:22:12,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2358 transitions. [2022-01-19 06:22:12,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:12,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2358 transitions. [2022-01-19 06:22:12,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 262.0) internal successors, (2358), 9 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:12,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:12,421 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:12,421 INFO L186 Difference]: Start difference. First operand has 311 places, 335 transitions, 1008 flow. Second operand 9 states and 2358 transitions. [2022-01-19 06:22:12,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 345 transitions, 1080 flow [2022-01-19 06:22:12,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 345 transitions, 1079 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:22:12,444 INFO L242 Difference]: Finished difference. Result has 321 places, 341 transitions, 1057 flow [2022-01-19 06:22:12,444 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1057, PETRI_PLACES=321, PETRI_TRANSITIONS=341} [2022-01-19 06:22:12,445 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 45 predicate places. [2022-01-19 06:22:12,445 INFO L470 AbstractCegarLoop]: Abstraction has has 321 places, 341 transitions, 1057 flow [2022-01-19 06:22:12,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 261.3) internal successors, (2613), 10 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:12,445 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:12,446 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:22:12,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-19 06:22:12,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-19 06:22:12,659 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:22:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash -550974725, now seen corresponding path program 1 times [2022-01-19 06:22:12,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:12,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043142831] [2022-01-19 06:22:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:12,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:22:12,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:12,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043142831] [2022-01-19 06:22:12,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043142831] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:12,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8076976] [2022-01-19 06:22:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:12,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:12,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:12,772 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:22:12,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-19 06:22:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:12,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 06:22:12,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:13,077 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:13,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:22:13,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:22:13,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:22:13,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:22:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:22:13,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:13,321 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_790 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_790) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:22:13,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:22:13,583 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:13,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:22:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-01-19 06:22:13,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8076976] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:13,609 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:13,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-01-19 06:22:13,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142006253] [2022-01-19 06:22:13,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:13,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-19 06:22:13,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:13,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-19 06:22:13,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2022-01-19 06:22:13,613 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 323 [2022-01-19 06:22:13,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 341 transitions, 1057 flow. Second operand has 16 states, 16 states have (on average 206.9375) internal successors, (3311), 16 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:13,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:13,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 323 [2022-01-19 06:22:13,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:28,915 INFO L129 PetriNetUnfolder]: 37136/117097 cut-off events. [2022-01-19 06:22:28,916 INFO L130 PetriNetUnfolder]: For 214073/215845 co-relation queries the response was YES. [2022-01-19 06:22:29,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 245950 conditions, 117097 events. 37136/117097 cut-off events. For 214073/215845 co-relation queries the response was YES. Maximal size of possible extension queue 5194. Compared 1832579 event pairs, 8545 based on Foata normal form. 234/112869 useless extension candidates. Maximal degree in co-relation 229430. Up to 19624 conditions per place. [2022-01-19 06:22:30,188 INFO L132 encePairwiseOnDemand]: 307/323 looper letters, 355 selfloop transitions, 160 changer transitions 20/762 dead transitions. [2022-01-19 06:22:30,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 762 transitions, 4069 flow [2022-01-19 06:22:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 06:22:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 06:22:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5273 transitions. [2022-01-19 06:22:30,196 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6802115583075335 [2022-01-19 06:22:30,196 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5273 transitions. [2022-01-19 06:22:30,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5273 transitions. [2022-01-19 06:22:30,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:30,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5273 transitions. [2022-01-19 06:22:30,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 219.70833333333334) internal successors, (5273), 24 states have internal predecessors, (5273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:30,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:30,208 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 323.0) internal successors, (8075), 25 states have internal predecessors, (8075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:30,208 INFO L186 Difference]: Start difference. First operand has 321 places, 341 transitions, 1057 flow. Second operand 24 states and 5273 transitions. [2022-01-19 06:22:30,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 762 transitions, 4069 flow [2022-01-19 06:22:31,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 762 transitions, 4063 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 06:22:31,500 INFO L242 Difference]: Finished difference. Result has 351 places, 462 transitions, 2128 flow [2022-01-19 06:22:31,501 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2128, PETRI_PLACES=351, PETRI_TRANSITIONS=462} [2022-01-19 06:22:31,502 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 75 predicate places. [2022-01-19 06:22:31,502 INFO L470 AbstractCegarLoop]: Abstraction has has 351 places, 462 transitions, 2128 flow [2022-01-19 06:22:31,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 206.9375) internal successors, (3311), 16 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:31,502 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:31,502 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:22:31,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-01-19 06:22:31,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-19 06:22:31,726 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:22:31,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash -772348649, now seen corresponding path program 1 times [2022-01-19 06:22:31,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:31,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919209406] [2022-01-19 06:22:31,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:31,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:22:31,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:31,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919209406] [2022-01-19 06:22:31,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919209406] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:31,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117117101] [2022-01-19 06:22:31,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:31,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:31,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:31,872 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:22:31,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-19 06:22:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:31,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:22:31,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:32,149 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:32,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:22:32,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:22:32,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:22:32,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:22:32,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:22:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:22:32,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:32,385 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_825 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_825) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:22:32,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:22:32,646 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:32,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:22:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2022-01-19 06:22:32,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117117101] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:32,668 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:32,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-01-19 06:22:32,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139387972] [2022-01-19 06:22:32,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:32,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-19 06:22:32,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:32,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-19 06:22:32,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2022-01-19 06:22:32,670 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 323 [2022-01-19 06:22:32,671 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 462 transitions, 2128 flow. Second operand has 16 states, 16 states have (on average 207.0625) internal successors, (3313), 16 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:32,671 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:32,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 323 [2022-01-19 06:22:32,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:23:07,819 INFO L129 PetriNetUnfolder]: 72480/245025 cut-off events. [2022-01-19 06:23:07,819 INFO L130 PetriNetUnfolder]: For 485467/494529 co-relation queries the response was YES. [2022-01-19 06:23:10,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537964 conditions, 245025 events. 72480/245025 cut-off events. For 485467/494529 co-relation queries the response was YES. Maximal size of possible extension queue 10846. Compared 4298630 event pairs, 29366 based on Foata normal form. 241/233638 useless extension candidates. Maximal degree in co-relation 533583. Up to 42905 conditions per place. [2022-01-19 06:23:11,559 INFO L132 encePairwiseOnDemand]: 307/323 looper letters, 439 selfloop transitions, 225 changer transitions 325/1233 dead transitions. [2022-01-19 06:23:11,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 1233 transitions, 9289 flow [2022-01-19 06:23:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-19 06:23:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-01-19 06:23:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5051 transitions. [2022-01-19 06:23:11,564 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6799030825144703 [2022-01-19 06:23:11,564 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 5051 transitions. [2022-01-19 06:23:11,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 5051 transitions. [2022-01-19 06:23:11,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:23:11,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 5051 transitions. [2022-01-19 06:23:11,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 219.6086956521739) internal successors, (5051), 23 states have internal predecessors, (5051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:23:11,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 323.0) internal successors, (7752), 24 states have internal predecessors, (7752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:23:11,576 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 323.0) internal successors, (7752), 24 states have internal predecessors, (7752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:23:11,576 INFO L186 Difference]: Start difference. First operand has 351 places, 462 transitions, 2128 flow. Second operand 23 states and 5051 transitions. [2022-01-19 06:23:11,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 1233 transitions, 9289 flow [2022-01-19 06:23:16,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 1233 transitions, 9288 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:23:16,766 INFO L242 Difference]: Finished difference. Result has 385 places, 580 transitions, 3887 flow [2022-01-19 06:23:16,767 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=2127, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3887, PETRI_PLACES=385, PETRI_TRANSITIONS=580} [2022-01-19 06:23:16,768 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 109 predicate places. [2022-01-19 06:23:16,768 INFO L470 AbstractCegarLoop]: Abstraction has has 385 places, 580 transitions, 3887 flow [2022-01-19 06:23:16,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 207.0625) internal successors, (3313), 16 states have internal predecessors, (3313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:23:16,768 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:23:16,768 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:23:16,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-19 06:23:16,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:23:16,989 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:23:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:23:16,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1978067094, now seen corresponding path program 1 times [2022-01-19 06:23:16,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:23:16,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783536432] [2022-01-19 06:23:16,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:23:16,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:23:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:23:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:23:17,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:23:17,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783536432] [2022-01-19 06:23:17,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783536432] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:23:17,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426678167] [2022-01-19 06:23:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:23:17,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:23:17,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:23:17,050 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:23:17,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-19 06:23:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:23:17,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 06:23:17,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:23:17,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 06:23:17,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:23:17,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:23:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:23:17,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:23:17,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426678167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:23:17,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:23:17,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-01-19 06:23:17,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112641628] [2022-01-19 06:23:17,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:23:17,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:23:17,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:23:17,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:23:17,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 06:23:17,501 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 323 [2022-01-19 06:23:17,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 580 transitions, 3887 flow. Second operand has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:23:17,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:23:17,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 323 [2022-01-19 06:23:17,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:24:05,586 INFO L129 PetriNetUnfolder]: 50100/269171 cut-off events. [2022-01-19 06:24:05,586 INFO L130 PetriNetUnfolder]: For 314592/330519 co-relation queries the response was YES. [2022-01-19 06:24:09,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 501443 conditions, 269171 events. 50100/269171 cut-off events. For 314592/330519 co-relation queries the response was YES. Maximal size of possible extension queue 7497. Compared 5208697 event pairs, 24325 based on Foata normal form. 12438/272316 useless extension candidates. Maximal degree in co-relation 495193. Up to 42581 conditions per place. [2022-01-19 06:24:10,045 INFO L132 encePairwiseOnDemand]: 296/323 looper letters, 51 selfloop transitions, 27 changer transitions 0/502 dead transitions. [2022-01-19 06:24:10,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 502 transitions, 2932 flow [2022-01-19 06:24:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 06:24:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 06:24:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1175 transitions. [2022-01-19 06:24:10,046 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7275541795665634 [2022-01-19 06:24:10,047 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1175 transitions. [2022-01-19 06:24:10,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1175 transitions. [2022-01-19 06:24:10,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:24:10,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1175 transitions. [2022-01-19 06:24:10,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:10,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:10,050 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:10,050 INFO L186 Difference]: Start difference. First operand has 385 places, 580 transitions, 3887 flow. Second operand 5 states and 1175 transitions. [2022-01-19 06:24:10,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 502 transitions, 2932 flow [2022-01-19 06:24:21,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 502 transitions, 2922 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-01-19 06:24:21,730 INFO L242 Difference]: Finished difference. Result has 388 places, 490 transitions, 2820 flow [2022-01-19 06:24:21,730 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=2701, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2820, PETRI_PLACES=388, PETRI_TRANSITIONS=490} [2022-01-19 06:24:21,731 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 112 predicate places. [2022-01-19 06:24:21,731 INFO L470 AbstractCegarLoop]: Abstraction has has 388 places, 490 transitions, 2820 flow [2022-01-19 06:24:21,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:21,731 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:24:21,731 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:24:21,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-19 06:24:21,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:21,932 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:24:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:24:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash -812478045, now seen corresponding path program 1 times [2022-01-19 06:24:21,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:24:21,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813751143] [2022-01-19 06:24:21,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:21,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:24:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:24:21,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:24:21,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813751143] [2022-01-19 06:24:21,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813751143] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:24:21,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201392661] [2022-01-19 06:24:21,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:21,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:21,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:24:21,990 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:24:21,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-19 06:24:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:22,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:24:22,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:24:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:24:22,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:24:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:24:22,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201392661] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:24:22,442 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:24:22,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-19 06:24:22,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680065713] [2022-01-19 06:24:22,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:24:22,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 06:24:22,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:24:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 06:24:22,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-19 06:24:22,446 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 323 [2022-01-19 06:24:22,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 490 transitions, 2820 flow. Second operand has 18 states, 18 states have (on average 261.6111111111111) internal successors, (4709), 18 states have internal predecessors, (4709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:22,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:24:22,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 323 [2022-01-19 06:24:22,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:24:23,214 INFO L129 PetriNetUnfolder]: 310/7103 cut-off events. [2022-01-19 06:24:23,215 INFO L130 PetriNetUnfolder]: For 6748/7092 co-relation queries the response was YES. [2022-01-19 06:24:23,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12722 conditions, 7103 events. 310/7103 cut-off events. For 6748/7092 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 93245 event pairs, 218 based on Foata normal form. 236/7305 useless extension candidates. Maximal degree in co-relation 12570. Up to 596 conditions per place. [2022-01-19 06:24:23,283 INFO L132 encePairwiseOnDemand]: 318/323 looper letters, 24 selfloop transitions, 10 changer transitions 3/267 dead transitions. [2022-01-19 06:24:23,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 267 transitions, 1126 flow [2022-01-19 06:24:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 06:24:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 06:24:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3131 transitions. [2022-01-19 06:24:23,285 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8077915376676986 [2022-01-19 06:24:23,285 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3131 transitions. [2022-01-19 06:24:23,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3131 transitions. [2022-01-19 06:24:23,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:24:23,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3131 transitions. [2022-01-19 06:24:23,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 260.9166666666667) internal successors, (3131), 12 states have internal predecessors, (3131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:23,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 323.0) internal successors, (4199), 13 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:23,291 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 323.0) internal successors, (4199), 13 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:23,291 INFO L186 Difference]: Start difference. First operand has 388 places, 490 transitions, 2820 flow. Second operand 12 states and 3131 transitions. [2022-01-19 06:24:23,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 267 transitions, 1126 flow [2022-01-19 06:24:23,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 267 transitions, 982 flow, removed 39 selfloop flow, removed 33 redundant places. [2022-01-19 06:24:23,350 INFO L242 Difference]: Finished difference. Result has 277 places, 257 transitions, 870 flow [2022-01-19 06:24:23,350 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=870, PETRI_PLACES=277, PETRI_TRANSITIONS=257} [2022-01-19 06:24:23,350 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 1 predicate places. [2022-01-19 06:24:23,350 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 257 transitions, 870 flow [2022-01-19 06:24:23,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 261.6111111111111) internal successors, (4709), 18 states have internal predecessors, (4709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:23,351 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:24:23,351 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:24:23,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-19 06:24:23,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-01-19 06:24:23,567 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:24:23,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:24:23,567 INFO L85 PathProgramCache]: Analyzing trace with hash -565521944, now seen corresponding path program 1 times [2022-01-19 06:24:23,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:24:23,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579805189] [2022-01-19 06:24:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:23,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:24:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:24:23,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:24:23,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579805189] [2022-01-19 06:24:23,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579805189] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:24:23,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471055] [2022-01-19 06:24:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:23,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:23,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:24:23,633 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:24:23,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-19 06:24:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:23,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 06:24:23,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:24:23,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-19 06:24:24,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:24:24,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-19 06:24:24,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:24:24,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-19 06:24:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:24:24,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:24:24,228 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_948) |c_~#A~0.base|) (+ |c_~#A~0.offset| 12)) 0))) is different from false [2022-01-19 06:24:24,284 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:24:24,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-01-19 06:24:24,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-01-19 06:24:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-19 06:24:24,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471055] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:24:24,380 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:24:24,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-01-19 06:24:24,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012803777] [2022-01-19 06:24:24,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:24:24,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 06:24:24,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:24:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 06:24:24,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=59, Unknown=1, NotChecked=16, Total=110 [2022-01-19 06:24:24,383 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 323 [2022-01-19 06:24:24,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 257 transitions, 870 flow. Second operand has 11 states, 11 states have (on average 221.36363636363637) internal successors, (2435), 11 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:24,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:24:24,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 323 [2022-01-19 06:24:24,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:24:24,854 INFO L129 PetriNetUnfolder]: 216/5096 cut-off events. [2022-01-19 06:24:24,854 INFO L130 PetriNetUnfolder]: For 1211/1218 co-relation queries the response was YES. [2022-01-19 06:24:24,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8257 conditions, 5096 events. 216/5096 cut-off events. For 1211/1218 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 55971 event pairs, 68 based on Foata normal form. 331/5294 useless extension candidates. Maximal degree in co-relation 7701. Up to 767 conditions per place. [2022-01-19 06:24:24,874 INFO L132 encePairwiseOnDemand]: 315/323 looper letters, 39 selfloop transitions, 8 changer transitions 0/259 dead transitions. [2022-01-19 06:24:24,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 259 transitions, 978 flow [2022-01-19 06:24:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 06:24:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 06:24:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1135 transitions. [2022-01-19 06:24:24,876 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7027863777089783 [2022-01-19 06:24:24,876 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1135 transitions. [2022-01-19 06:24:24,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1135 transitions. [2022-01-19 06:24:24,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:24:24,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1135 transitions. [2022-01-19 06:24:24,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:24,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:24,879 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:24,879 INFO L186 Difference]: Start difference. First operand has 277 places, 257 transitions, 870 flow. Second operand 5 states and 1135 transitions. [2022-01-19 06:24:24,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 259 transitions, 978 flow [2022-01-19 06:24:24,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 259 transitions, 927 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-01-19 06:24:24,889 INFO L242 Difference]: Finished difference. Result has 270 places, 257 transitions, 835 flow [2022-01-19 06:24:24,889 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=835, PETRI_PLACES=270, PETRI_TRANSITIONS=257} [2022-01-19 06:24:24,889 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, -6 predicate places. [2022-01-19 06:24:24,889 INFO L470 AbstractCegarLoop]: Abstraction has has 270 places, 257 transitions, 835 flow [2022-01-19 06:24:24,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 221.36363636363637) internal successors, (2435), 11 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:24,890 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:24:24,890 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:24:24,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-19 06:24:25,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-01-19 06:24:25,112 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:24:25,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:24:25,112 INFO L85 PathProgramCache]: Analyzing trace with hash 281926950, now seen corresponding path program 2 times [2022-01-19 06:24:25,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:24:25,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675225157] [2022-01-19 06:24:25,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:25,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:24:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 06:24:25,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:24:25,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675225157] [2022-01-19 06:24:25,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675225157] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:24:25,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260587593] [2022-01-19 06:24:25,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:24:25,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:25,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:24:25,241 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:24:25,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-19 06:24:25,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:24:25,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:24:25,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:24:25,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:24:25,597 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:24:25,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:24:25,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:24:25,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:24:25,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:24:25,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:24:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:24:25,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:24:25,858 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_987 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_987) |c_~#B~0.base|) |c_~#B~0.offset|))) is different from false [2022-01-19 06:24:26,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:24:26,109 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:24:26,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:24:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 24 not checked. [2022-01-19 06:24:26,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260587593] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:24:26,130 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:24:26,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 16 [2022-01-19 06:24:26,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543081524] [2022-01-19 06:24:26,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:24:26,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-19 06:24:26,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:24:26,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-19 06:24:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=168, Unknown=1, NotChecked=26, Total=240 [2022-01-19 06:24:26,133 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 323 [2022-01-19 06:24:26,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 257 transitions, 835 flow. Second operand has 16 states, 16 states have (on average 207.25) internal successors, (3316), 16 states have internal predecessors, (3316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:26,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:24:26,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 323 [2022-01-19 06:24:26,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:24:26,824 INFO L129 PetriNetUnfolder]: 479/6231 cut-off events. [2022-01-19 06:24:26,824 INFO L130 PetriNetUnfolder]: For 1989/2005 co-relation queries the response was YES. [2022-01-19 06:24:26,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10134 conditions, 6231 events. 479/6231 cut-off events. For 1989/2005 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 71684 event pairs, 245 based on Foata normal form. 14/6097 useless extension candidates. Maximal degree in co-relation 8438. Up to 876 conditions per place. [2022-01-19 06:24:26,849 INFO L132 encePairwiseOnDemand]: 310/323 looper letters, 84 selfloop transitions, 26 changer transitions 16/294 dead transitions. [2022-01-19 06:24:26,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 294 transitions, 1248 flow [2022-01-19 06:24:26,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 06:24:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 06:24:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2545 transitions. [2022-01-19 06:24:26,852 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6566047471620227 [2022-01-19 06:24:26,852 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2545 transitions. [2022-01-19 06:24:26,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2545 transitions. [2022-01-19 06:24:26,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:24:26,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2545 transitions. [2022-01-19 06:24:26,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 212.08333333333334) internal successors, (2545), 12 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:26,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 323.0) internal successors, (4199), 13 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:26,858 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 323.0) internal successors, (4199), 13 states have internal predecessors, (4199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:26,858 INFO L186 Difference]: Start difference. First operand has 270 places, 257 transitions, 835 flow. Second operand 12 states and 2545 transitions. [2022-01-19 06:24:26,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 294 transitions, 1248 flow [2022-01-19 06:24:26,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 294 transitions, 1239 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 06:24:26,868 INFO L242 Difference]: Finished difference. Result has 281 places, 262 transitions, 937 flow [2022-01-19 06:24:26,869 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=937, PETRI_PLACES=281, PETRI_TRANSITIONS=262} [2022-01-19 06:24:26,869 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 5 predicate places. [2022-01-19 06:24:26,869 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 262 transitions, 937 flow [2022-01-19 06:24:26,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 207.25) internal successors, (3316), 16 states have internal predecessors, (3316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:26,870 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:24:26,870 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:24:26,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-01-19 06:24:27,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-19 06:24:27,071 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:24:27,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:24:27,071 INFO L85 PathProgramCache]: Analyzing trace with hash 886272451, now seen corresponding path program 1 times [2022-01-19 06:24:27,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:24:27,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506082494] [2022-01-19 06:24:27,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:27,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:24:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:27,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:24:27,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:24:27,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506082494] [2022-01-19 06:24:27,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506082494] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:24:27,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988315115] [2022-01-19 06:24:27,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:27,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:27,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:24:27,247 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:24:27,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-19 06:24:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:27,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-19 06:24:27,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:24:27,550 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:24:27,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:24:27,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:24:27,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:24:27,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 06:24:27,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:24:27,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:24:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:24:27,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:24:28,057 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1048 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1048) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:28,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:24:28,280 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:24:28,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:24:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-19 06:24:28,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988315115] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:24:28,303 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:24:28,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 27 [2022-01-19 06:24:28,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051012858] [2022-01-19 06:24:28,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:24:28,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 06:24:28,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:24:28,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 06:24:28,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=570, Unknown=1, NotChecked=48, Total=702 [2022-01-19 06:24:28,307 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 323 [2022-01-19 06:24:28,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 262 transitions, 937 flow. Second operand has 27 states, 27 states have (on average 200.14814814814815) internal successors, (5404), 27 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:28,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:24:28,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 323 [2022-01-19 06:24:28,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:24:29,949 INFO L129 PetriNetUnfolder]: 1069/9699 cut-off events. [2022-01-19 06:24:29,950 INFO L130 PetriNetUnfolder]: For 4450/4474 co-relation queries the response was YES. [2022-01-19 06:24:29,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17238 conditions, 9699 events. 1069/9699 cut-off events. For 4450/4474 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 118970 event pairs, 451 based on Foata normal form. 26/9495 useless extension candidates. Maximal degree in co-relation 15346. Up to 1439 conditions per place. [2022-01-19 06:24:29,997 INFO L132 encePairwiseOnDemand]: 300/323 looper letters, 197 selfloop transitions, 60 changer transitions 33/457 dead transitions. [2022-01-19 06:24:29,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 457 transitions, 2432 flow [2022-01-19 06:24:29,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-19 06:24:29,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-01-19 06:24:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 6527 transitions. [2022-01-19 06:24:30,002 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6314821981424149 [2022-01-19 06:24:30,002 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 6527 transitions. [2022-01-19 06:24:30,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 6527 transitions. [2022-01-19 06:24:30,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:24:30,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 6527 transitions. [2022-01-19 06:24:30,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 203.96875) internal successors, (6527), 32 states have internal predecessors, (6527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:30,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 323.0) internal successors, (10659), 33 states have internal predecessors, (10659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:30,016 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 323.0) internal successors, (10659), 33 states have internal predecessors, (10659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:30,016 INFO L186 Difference]: Start difference. First operand has 281 places, 262 transitions, 937 flow. Second operand 32 states and 6527 transitions. [2022-01-19 06:24:30,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 457 transitions, 2432 flow [2022-01-19 06:24:30,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 457 transitions, 2419 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-01-19 06:24:30,040 INFO L242 Difference]: Finished difference. Result has 333 places, 321 transitions, 1526 flow [2022-01-19 06:24:30,040 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1526, PETRI_PLACES=333, PETRI_TRANSITIONS=321} [2022-01-19 06:24:30,040 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 57 predicate places. [2022-01-19 06:24:30,041 INFO L470 AbstractCegarLoop]: Abstraction has has 333 places, 321 transitions, 1526 flow [2022-01-19 06:24:30,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 200.14814814814815) internal successors, (5404), 27 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:30,041 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:24:30,042 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:24:30,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-01-19 06:24:30,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-01-19 06:24:30,255 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:24:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:24:30,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2012721145, now seen corresponding path program 2 times [2022-01-19 06:24:30,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:24:30,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779590978] [2022-01-19 06:24:30,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:30,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:24:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:24:30,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:24:30,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779590978] [2022-01-19 06:24:30,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779590978] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:24:30,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245500087] [2022-01-19 06:24:30,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:24:30,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:30,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:24:30,416 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:24:30,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-19 06:24:30,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:24:30,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:24:30,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-19 06:24:30,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:24:31,274 INFO L353 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-01-19 06:24:31,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-01-19 06:24:31,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:24:31,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:24:31,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:24:31,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-19 06:24:31,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:24:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:24:31,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:24:32,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1114 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1114) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:32,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:24:32,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 06:24:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-01-19 06:24:32,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245500087] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:24:32,397 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:24:32,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 15] total 35 [2022-01-19 06:24:32,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670045300] [2022-01-19 06:24:32,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:24:32,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-19 06:24:32,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:24:32,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-19 06:24:32,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=976, Unknown=1, NotChecked=64, Total=1190 [2022-01-19 06:24:32,402 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 323 [2022-01-19 06:24:32,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 321 transitions, 1526 flow. Second operand has 35 states, 35 states have (on average 199.45714285714286) internal successors, (6981), 35 states have internal predecessors, (6981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:32,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:24:32,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 323 [2022-01-19 06:24:32,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:24:35,516 INFO L129 PetriNetUnfolder]: 1403/13681 cut-off events. [2022-01-19 06:24:35,516 INFO L130 PetriNetUnfolder]: For 22853/23047 co-relation queries the response was YES. [2022-01-19 06:24:35,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30018 conditions, 13681 events. 1403/13681 cut-off events. For 22853/23047 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 181849 event pairs, 321 based on Foata normal form. 74/13449 useless extension candidates. Maximal degree in co-relation 27221. Up to 2212 conditions per place. [2022-01-19 06:24:35,629 INFO L132 encePairwiseOnDemand]: 296/323 looper letters, 258 selfloop transitions, 224 changer transitions 55/703 dead transitions. [2022-01-19 06:24:35,629 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 703 transitions, 5505 flow [2022-01-19 06:24:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-01-19 06:24:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2022-01-19 06:24:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 16042 transitions. [2022-01-19 06:24:35,640 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6208204334365325 [2022-01-19 06:24:35,640 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 16042 transitions. [2022-01-19 06:24:35,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 16042 transitions. [2022-01-19 06:24:35,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:24:35,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 16042 transitions. [2022-01-19 06:24:35,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 200.525) internal successors, (16042), 80 states have internal predecessors, (16042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:35,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 323.0) internal successors, (26163), 81 states have internal predecessors, (26163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:35,675 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 323.0) internal successors, (26163), 81 states have internal predecessors, (26163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:35,675 INFO L186 Difference]: Start difference. First operand has 333 places, 321 transitions, 1526 flow. Second operand 80 states and 16042 transitions. [2022-01-19 06:24:35,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 703 transitions, 5505 flow [2022-01-19 06:24:35,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 703 transitions, 5483 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-01-19 06:24:35,761 INFO L242 Difference]: Finished difference. Result has 443 places, 523 transitions, 4063 flow [2022-01-19 06:24:35,761 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=4063, PETRI_PLACES=443, PETRI_TRANSITIONS=523} [2022-01-19 06:24:35,761 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 167 predicate places. [2022-01-19 06:24:35,761 INFO L470 AbstractCegarLoop]: Abstraction has has 443 places, 523 transitions, 4063 flow [2022-01-19 06:24:35,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 199.45714285714286) internal successors, (6981), 35 states have internal predecessors, (6981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:35,762 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:24:35,762 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:24:35,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-01-19 06:24:35,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:35,966 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:24:35,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:24:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2022630227, now seen corresponding path program 3 times [2022-01-19 06:24:35,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:24:35,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286322973] [2022-01-19 06:24:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:35,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:24:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:24:36,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:24:36,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286322973] [2022-01-19 06:24:36,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286322973] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:24:36,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720660502] [2022-01-19 06:24:36,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:24:36,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:24:36,137 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:24:36,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-19 06:24:36,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 06:24:36,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:24:36,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-19 06:24:36,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:24:36,458 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:24:36,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:24:36,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:24:36,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:24:36,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 06:24:36,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:24:36,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:24:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:24:36,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:24:37,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1179 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1179) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:37,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 06:24:37,341 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:24:37,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:24:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-19 06:24:37,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720660502] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:24:37,364 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:24:37,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 27 [2022-01-19 06:24:37,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599466405] [2022-01-19 06:24:37,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:24:37,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 06:24:37,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:24:37,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 06:24:37,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=570, Unknown=1, NotChecked=48, Total=702 [2022-01-19 06:24:37,368 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 323 [2022-01-19 06:24:37,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 523 transitions, 4063 flow. Second operand has 27 states, 27 states have (on average 200.14814814814815) internal successors, (5404), 27 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:37,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:24:37,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 323 [2022-01-19 06:24:37,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:24:40,256 INFO L129 PetriNetUnfolder]: 1406/14140 cut-off events. [2022-01-19 06:24:40,256 INFO L130 PetriNetUnfolder]: For 69700/70282 co-relation queries the response was YES. [2022-01-19 06:24:40,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36790 conditions, 14140 events. 1406/14140 cut-off events. For 69700/70282 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 188315 event pairs, 457 based on Foata normal form. 92/13875 useless extension candidates. Maximal degree in co-relation 36488. Up to 2362 conditions per place. [2022-01-19 06:24:40,417 INFO L132 encePairwiseOnDemand]: 300/323 looper letters, 418 selfloop transitions, 101 changer transitions 24/710 dead transitions. [2022-01-19 06:24:40,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 710 transitions, 7229 flow [2022-01-19 06:24:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-19 06:24:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-19 06:24:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5312 transitions. [2022-01-19 06:24:40,423 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6325315551321743 [2022-01-19 06:24:40,423 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 5312 transitions. [2022-01-19 06:24:40,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 5312 transitions. [2022-01-19 06:24:40,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:24:40,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5312 transitions. [2022-01-19 06:24:40,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 204.30769230769232) internal successors, (5312), 26 states have internal predecessors, (5312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:40,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 323.0) internal successors, (8721), 27 states have internal predecessors, (8721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:40,433 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 323.0) internal successors, (8721), 27 states have internal predecessors, (8721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:40,434 INFO L186 Difference]: Start difference. First operand has 443 places, 523 transitions, 4063 flow. Second operand 26 states and 5312 transitions. [2022-01-19 06:24:40,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 710 transitions, 7229 flow [2022-01-19 06:24:40,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 710 transitions, 6566 flow, removed 323 selfloop flow, removed 9 redundant places. [2022-01-19 06:24:40,790 INFO L242 Difference]: Finished difference. Result has 476 places, 592 transitions, 5069 flow [2022-01-19 06:24:40,790 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=3522, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5069, PETRI_PLACES=476, PETRI_TRANSITIONS=592} [2022-01-19 06:24:40,790 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 200 predicate places. [2022-01-19 06:24:40,791 INFO L470 AbstractCegarLoop]: Abstraction has has 476 places, 592 transitions, 5069 flow [2022-01-19 06:24:40,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 200.14814814814815) internal successors, (5404), 27 states have internal predecessors, (5404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:40,791 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:24:40,792 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:24:40,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-01-19 06:24:40,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:40,993 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 06:24:40,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:24:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash 729272625, now seen corresponding path program 4 times [2022-01-19 06:24:40,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:24:40,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337365419] [2022-01-19 06:24:40,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:40,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:24:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:24:41,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:24:41,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337365419] [2022-01-19 06:24:41,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337365419] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:24:41,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045058360] [2022-01-19 06:24:41,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 06:24:41,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:41,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:24:41,189 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:24:41,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-19 06:24:41,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 06:24:41,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:24:41,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:24:41,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:24:41,532 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:24:41,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:24:41,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:24:41,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-19 06:24:41,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-19 06:24:41,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 06:24:41,994 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 06:24:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:24:42,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:24:42,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1249) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:42,103 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#B~0.base| (store (select |c_#memory_int| |c_~#B~0.base|) |c_~#B~0.offset| (+ (- 1) |c_t_funThread1of3ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1249) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:42,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#B~0.base| (store (select |c_#memory_int| |c_~#B~0.base|) |c_~#B~0.offset| (+ (- 1) |c_t_funThread1of3ForFork0_#t~mem9#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1249) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:42,111 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#B~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#B~0.base|))) (store .cse0 |c_~#B~0.offset| (+ (- 1) (select .cse0 |c_~#B~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1249) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:42,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#B~0.base| (store (select |c_#memory_int| |c_~#B~0.base|) |c_~#B~0.offset| |c_t_funThread1of3ForFork0_#t~post7#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1249) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:42,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#B~0.base| (store (select |c_#memory_int| |c_~#B~0.base|) |c_~#B~0.offset| |c_t_funThread1of3ForFork0_#t~mem6#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1249) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:42,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#B~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#B~0.base|))) (store .cse0 |c_~#B~0.offset| (select .cse0 |c_~#B~0.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1249) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:42,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1244 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1244))) (store .cse0 |c_~#B~0.base| (let ((.cse1 (select .cse0 |c_~#B~0.base|))) (store .cse1 |c_~#B~0.offset| (select .cse1 |c_~#B~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1249) |c_~#B~0.base|) |c_~#B~0.offset|) 0)) is different from false [2022-01-19 06:24:42,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-01-19 06:24:42,457 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:24:42,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:24:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-19 06:24:42,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045058360] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:24:42,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:24:42,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 34 [2022-01-19 06:24:42,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345263140] [2022-01-19 06:24:42,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:24:42,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 06:24:42,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:24:42,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 06:24:42,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=569, Unknown=8, NotChecked=440, Total=1122 [2022-01-19 06:24:42,487 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 323 [2022-01-19 06:24:42,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 592 transitions, 5069 flow. Second operand has 34 states, 34 states have (on average 199.7941176470588) internal successors, (6793), 34 states have internal predecessors, (6793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:24:42,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:24:42,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 323 [2022-01-19 06:24:42,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand