/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_79-equ_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 06:22:32,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:22:32,396 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:22:32,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:22:32,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:22:32,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:22:32,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:22:32,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:22:32,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:22:32,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:22:32,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:22:32,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:22:32,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:22:32,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:22:32,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:22:32,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:22:32,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:22:32,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:22:32,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:22:32,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:22:32,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:22:32,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:22:32,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:22:32,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:22:32,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:22:32,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:22:32,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:22:32,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:22:32,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:22:32,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:22:32,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:22:32,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:22:32,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:22:32,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:22:32,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:22:32,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:22:32,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:22:32,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:22:32,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:22:32,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:22:32,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:22:32,472 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:22:32,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:22:32,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:22:32,488 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:22:32,488 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:22:32,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:22:32,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:22:32,489 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:22:32,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:22:32,489 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:22:32,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:22:32,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:22:32,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:22:32,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:22:32,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:22:32,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:22:32,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:22:32,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:22:32,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:22:32,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:22:32,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:22:32,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:22:32,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:22:32,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:22:32,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:22:32,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:22:32,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:22:32,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:22:32,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:22:32,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:22:32,492 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:22:32,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:22:32,492 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:22:32,492 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:22:32,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:22:32,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:22:32,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:22:32,634 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:22:32,636 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:22:32,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_79-equ_racefree.i [2022-01-19 06:22:32,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c107024bf/6200a07eb209464db1b406aef17f86f8/FLAG50d7a4655 [2022-01-19 06:22:33,103 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:22:33,104 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_79-equ_racefree.i [2022-01-19 06:22:33,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c107024bf/6200a07eb209464db1b406aef17f86f8/FLAG50d7a4655 [2022-01-19 06:22:33,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c107024bf/6200a07eb209464db1b406aef17f86f8 [2022-01-19 06:22:33,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:22:33,462 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:22:33,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:22:33,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:22:33,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:22:33,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:22:33" (1/1) ... [2022-01-19 06:22:33,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9e5634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33, skipping insertion in model container [2022-01-19 06:22:33,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:22:33" (1/1) ... [2022-01-19 06:22:33,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:22:33,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:22:33,794 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_79-equ_racefree.i[47038,47051] [2022-01-19 06:22:33,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:22:33,828 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:22:33,857 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_79-equ_racefree.i[47038,47051] [2022-01-19 06:22:33,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:22:33,908 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:22:33,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33 WrapperNode [2022-01-19 06:22:33,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:22:33,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:22:33,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:22:33,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:22:33,914 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:22:33" (1/1) ... [2022-01-19 06:22:33,926 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:22:33" (1/1) ... [2022-01-19 06:22:33,951 INFO L137 Inliner]: procedures = 271, calls = 56, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 198 [2022-01-19 06:22:33,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:22:33,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:22:33,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:22:33,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:22:33,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33" (1/1) ... [2022-01-19 06:22:33,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33" (1/1) ... [2022-01-19 06:22:33,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33" (1/1) ... [2022-01-19 06:22:33,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33" (1/1) ... [2022-01-19 06:22:33,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33" (1/1) ... [2022-01-19 06:22:33,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33" (1/1) ... [2022-01-19 06:22:33,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33" (1/1) ... [2022-01-19 06:22:33,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:22:33,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:22:33,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:22:33,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:22:33,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33" (1/1) ... [2022-01-19 06:22:33,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:22:33,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:33,999 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:22:34,007 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:22:34,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:22:34,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:22:34,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:22:34,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:22:34,032 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 06:22:34,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:22:34,032 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-19 06:22:34,032 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-19 06:22:34,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:22:34,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:22:34,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:22:34,034 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:22:34,153 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:22:34,154 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:22:34,338 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:22:34,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:22:34,344 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2022-01-19 06:22:34,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:22:34 BoogieIcfgContainer [2022-01-19 06:22:34,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:22:34,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:22:34,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:22:34,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:22:34,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:22:33" (1/3) ... [2022-01-19 06:22:34,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eefd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:22:34, skipping insertion in model container [2022-01-19 06:22:34,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:22:33" (2/3) ... [2022-01-19 06:22:34,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eefd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:22:34, skipping insertion in model container [2022-01-19 06:22:34,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:22:34" (3/3) ... [2022-01-19 06:22:34,350 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_79-equ_racefree.i [2022-01-19 06:22:34,356 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:22:34,356 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 06:22:34,356 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:22:34,382 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:22:34,382 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:22:34,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,383 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:22:34,383 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:22:34,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,383 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,384 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,385 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,386 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,387 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,388 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,389 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:22:34,389 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,389 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:22:34,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,390 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:22:34,390 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:22:34,390 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,391 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:22:34,391 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:22:34,391 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:22:34,391 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:22:34,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,391 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,392 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:22:34,392 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:22:34,392 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:22:34,392 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:22:34,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,392 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,394 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 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:22:34,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,395 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:22:34,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,396 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:34,398 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-19 06:22:34,426 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:22:34,430 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:34,430 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 06:22:34,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 203 transitions, 414 flow [2022-01-19 06:22:34,490 INFO L129 PetriNetUnfolder]: 42/275 cut-off events. [2022-01-19 06:22:34,491 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:22:34,496 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:22:34,496 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 203 transitions, 414 flow [2022-01-19 06:22:34,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 198 transitions, 401 flow [2022-01-19 06:22:34,532 INFO L129 PetriNetUnfolder]: 14/165 cut-off events. [2022-01-19 06:22:34,532 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:22:34,532 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:34,533 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:34,533 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:22:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:34,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1755706946, now seen corresponding path program 1 times [2022-01-19 06:22:34,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:34,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037335383] [2022-01-19 06:22:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:34,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:34,684 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:34,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:34,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037335383] [2022-01-19 06:22:34,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037335383] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:22:34,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:22:34,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:22:34,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060705479] [2022-01-19 06:22:34,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:22:34,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:22:34,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:34,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:22:34,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:22:34,712 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 203 [2022-01-19 06:22:34,714 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:22:34,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:34,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 203 [2022-01-19 06:22:34,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:34,744 INFO L129 PetriNetUnfolder]: 3/176 cut-off events. [2022-01-19 06:22:34,744 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:22:34,745 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:22:34,746 INFO L132 encePairwiseOnDemand]: 176/203 looper letters, 8 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2022-01-19 06:22:34,747 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 174 transitions, 373 flow [2022-01-19 06:22:34,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:22:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:22:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2022-01-19 06:22:34,756 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2022-01-19 06:22:34,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 551 transitions. [2022-01-19 06:22:34,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 551 transitions. [2022-01-19 06:22:34,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:34,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 551 transitions. [2022-01-19 06:22:34,763 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:22:34,775 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:22:34,776 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:22:34,777 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:22:34,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 174 transitions, 373 flow [2022-01-19 06:22:34,780 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:22:34,782 INFO L242 Difference]: Finished difference. Result has 175 places, 172 transitions, 357 flow [2022-01-19 06:22:34,784 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:22:34,786 INFO L334 CegarLoopForPetriNet]: 174 programPoint places, 1 predicate places. [2022-01-19 06:22:34,786 INFO L470 AbstractCegarLoop]: Abstraction has has 175 places, 172 transitions, 357 flow [2022-01-19 06:22:34,786 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:22:34,786 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:34,787 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:34,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:22:34,787 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:22:34,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:34,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1268382152, now seen corresponding path program 1 times [2022-01-19 06:22:34,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:34,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399542166] [2022-01-19 06:22:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:34,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:35,222 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:35,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:35,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399542166] [2022-01-19 06:22:35,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399542166] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:22:35,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:22:35,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 06:22:35,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708093332] [2022-01-19 06:22:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:22:35,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 06:22:35,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:35,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 06:22:35,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-19 06:22:35,228 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 203 [2022-01-19 06:22:35,230 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 172 transitions, 357 flow. Second operand has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 0 states have call successors, (0), 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:35,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:35,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 203 [2022-01-19 06:22:35,230 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:35,870 INFO L129 PetriNetUnfolder]: 407/1723 cut-off events. [2022-01-19 06:22:35,870 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:22:35,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2631 conditions, 1723 events. 407/1723 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 14190 event pairs, 104 based on Foata normal form. 0/1643 useless extension candidates. Maximal degree in co-relation 2518. Up to 347 conditions per place. [2022-01-19 06:22:35,876 INFO L132 encePairwiseOnDemand]: 188/203 looper letters, 81 selfloop transitions, 12 changer transitions 131/324 dead transitions. [2022-01-19 06:22:35,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 324 transitions, 1105 flow [2022-01-19 06:22:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:22:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:22:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2876 transitions. [2022-01-19 06:22:35,882 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5666995073891625 [2022-01-19 06:22:35,882 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2876 transitions. [2022-01-19 06:22:35,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2876 transitions. [2022-01-19 06:22:35,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:35,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2876 transitions. [2022-01-19 06:22:35,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 115.04) internal successors, (2876), 25 states have internal predecessors, (2876), 0 states have call successors, (0), 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:35,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 203.0) internal successors, (5278), 26 states have internal predecessors, (5278), 0 states have call successors, (0), 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:35,898 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 203.0) internal successors, (5278), 26 states have internal predecessors, (5278), 0 states have call successors, (0), 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:35,898 INFO L186 Difference]: Start difference. First operand has 175 places, 172 transitions, 357 flow. Second operand 25 states and 2876 transitions. [2022-01-19 06:22:35,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 324 transitions, 1105 flow [2022-01-19 06:22:35,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 324 transitions, 1101 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:22:35,906 INFO L242 Difference]: Finished difference. Result has 214 places, 172 transitions, 438 flow [2022-01-19 06:22:35,906 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=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=438, PETRI_PLACES=214, PETRI_TRANSITIONS=172} [2022-01-19 06:22:35,907 INFO L334 CegarLoopForPetriNet]: 174 programPoint places, 40 predicate places. [2022-01-19 06:22:35,907 INFO L470 AbstractCegarLoop]: Abstraction has has 214 places, 172 transitions, 438 flow [2022-01-19 06:22:35,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 0 states have call successors, (0), 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:35,907 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:35,908 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:22:35,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 06:22:35,908 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:22:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash -213132658, now seen corresponding path program 1 times [2022-01-19 06:22:35,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:35,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562968469] [2022-01-19 06:22:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:35,910 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:35,977 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:35,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:35,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562968469] [2022-01-19 06:22:35,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562968469] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:35,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031261682] [2022-01-19 06:22:35,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:35,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:35,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:35,985 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:22:35,985 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:22:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:36,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:22:36,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:36,220 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:36,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:36,308 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:36,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031261682] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:36,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:36,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:22:36,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451735125] [2022-01-19 06:22:36,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:36,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:22:36,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:36,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:22:36,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:22:36,311 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 203 [2022-01-19 06:22:36,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 172 transitions, 438 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:22:36,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:36,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 203 [2022-01-19 06:22:36,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:36,337 INFO L129 PetriNetUnfolder]: 1/123 cut-off events. [2022-01-19 06:22:36,338 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-01-19 06:22:36,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 178 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 156. Up to 4 conditions per place. [2022-01-19 06:22:36,338 INFO L132 encePairwiseOnDemand]: 198/203 looper letters, 0 selfloop transitions, 0 changer transitions 117/117 dead transitions. [2022-01-19 06:22:36,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 117 transitions, 300 flow [2022-01-19 06:22:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:22:36,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:22:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1013 transitions. [2022-01-19 06:22:36,340 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8316912972085386 [2022-01-19 06:22:36,340 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1013 transitions. [2022-01-19 06:22:36,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1013 transitions. [2022-01-19 06:22:36,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:36,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1013 transitions. [2022-01-19 06:22:36,342 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:22:36,344 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:22:36,344 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:22:36,344 INFO L186 Difference]: Start difference. First operand has 214 places, 172 transitions, 438 flow. Second operand 6 states and 1013 transitions. [2022-01-19 06:22:36,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 117 transitions, 300 flow [2022-01-19 06:22:36,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 117 transitions, 258 flow, removed 2 selfloop flow, removed 18 redundant places. [2022-01-19 06:22:36,346 INFO L242 Difference]: Finished difference. Result has 131 places, 0 transitions, 0 flow [2022-01-19 06:22:36,346 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:22:36,347 INFO L334 CegarLoopForPetriNet]: 174 programPoint places, -43 predicate places. [2022-01-19 06:22:36,347 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 0 transitions, 0 flow [2022-01-19 06:22:36,347 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:22:36,349 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 06:22:36,349 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-19 06:22:36,350 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-19 06:22:36,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-19 06:22:36,568 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:22:36,571 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-01-19 06:22:36,572 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2022-01-19 06:22:36,574 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:22:36,575 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:36,575 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:22:36,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 203 transitions, 414 flow [2022-01-19 06:22:36,588 INFO L129 PetriNetUnfolder]: 42/275 cut-off events. [2022-01-19 06:22:36,588 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:22:36,589 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:22:36,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 203 transitions, 414 flow [2022-01-19 06:22:36,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 198 transitions, 401 flow [2022-01-19 06:22:36,596 INFO L129 PetriNetUnfolder]: 15/168 cut-off events. [2022-01-19 06:22:36,596 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:22:36,597 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:36,597 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:22:36,597 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:22:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1723602517, now seen corresponding path program 1 times [2022-01-19 06:22:36,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:36,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268308574] [2022-01-19 06:22:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:36,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:22:36,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 06:22:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:22:36,627 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 06:22:36,627 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 06:22:36,627 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:22:36,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 06:22:36,628 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 06:22:36,628 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 06:22:36,628 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 06:22:36,628 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-19 06:22:36,636 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:22:36,636 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:22:36,636 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,636 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,637 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:22:36,637 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:22:36,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,637 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,638 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 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:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,640 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:22:36,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,641 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:22:36,641 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:22:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,641 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:22:36,641 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:22:36,642 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:22:36,642 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:22:36,642 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,642 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,642 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,642 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,642 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:22:36,642 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:22:36,642 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:22:36,642 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:22:36,642 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,642 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,642 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,643 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:22:36,643 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:22:36,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,643 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:22:36,643 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:22:36,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,643 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,644 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,645 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,646 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,647 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:22:36,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,647 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:22:36,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,647 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,647 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:22:36,647 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:22:36,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,648 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:22:36,648 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:22:36,648 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:22:36,648 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:22:36,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,648 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,648 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:22:36,648 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:22:36,649 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:22:36,649 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:22:36,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,649 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,649 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:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 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:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,650 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 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:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,651 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:22:36,652 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:22:36,653 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 06:22:36,654 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:22:36,654 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:36,654 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 06:22:36,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 263 transitions, 544 flow [2022-01-19 06:22:36,680 INFO L129 PetriNetUnfolder]: 71/432 cut-off events. [2022-01-19 06:22:36,680 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 06:22:36,683 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:36,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 263 transitions, 544 flow [2022-01-19 06:22:36,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 263 transitions, 544 flow [2022-01-19 06:22:36,691 INFO L129 PetriNetUnfolder]: 14/163 cut-off events. [2022-01-19 06:22:36,691 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:22:36,692 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:36,692 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:36,692 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:22:36,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash 420502284, now seen corresponding path program 1 times [2022-01-19 06:22:36,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:36,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766741305] [2022-01-19 06:22:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:36,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:36,708 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:36,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:36,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766741305] [2022-01-19 06:22:36,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766741305] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:22:36,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:22:36,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:22:36,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040655381] [2022-01-19 06:22:36,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:22:36,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:22:36,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:22:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:22:36,710 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 263 [2022-01-19 06:22:36,710 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:22:36,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:36,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 263 [2022-01-19 06:22:36,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:36,738 INFO L129 PetriNetUnfolder]: 9/365 cut-off events. [2022-01-19 06:22:36,738 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-01-19 06:22:36,740 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:22:36,741 INFO L132 encePairwiseOnDemand]: 228/263 looper letters, 4 selfloop transitions, 0 changer transitions 0/225 dead transitions. [2022-01-19 06:22:36,741 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 225 transitions, 476 flow [2022-01-19 06:22:36,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:22:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:22:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 481 transitions. [2022-01-19 06:22:36,742 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9144486692015209 [2022-01-19 06:22:36,742 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 481 transitions. [2022-01-19 06:22:36,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 481 transitions. [2022-01-19 06:22:36,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:36,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 481 transitions. [2022-01-19 06:22:36,743 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:22:36,744 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:22:36,744 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:22:36,744 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:22:36,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 225 transitions, 476 flow [2022-01-19 06:22:36,745 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:22:36,747 INFO L242 Difference]: Finished difference. Result has 225 places, 225 transitions, 468 flow [2022-01-19 06:22:36,747 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:22:36,748 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -2 predicate places. [2022-01-19 06:22:36,748 INFO L470 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 468 flow [2022-01-19 06:22:36,748 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:22:36,748 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:36,748 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:36,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 06:22:36,749 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:22:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash -985271127, now seen corresponding path program 1 times [2022-01-19 06:22:36,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:36,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265666508] [2022-01-19 06:22:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:36,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:36,795 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:36,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:36,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265666508] [2022-01-19 06:22:36,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265666508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:22:36,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:22:36,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:22:36,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620836893] [2022-01-19 06:22:36,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:22:36,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:22:36,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:36,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:22:36,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:22:36,799 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 263 [2022-01-19 06:22:36,799 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:22:36,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:36,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 263 [2022-01-19 06:22:36,799 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:36,839 INFO L129 PetriNetUnfolder]: 7/320 cut-off events. [2022-01-19 06:22:36,840 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-01-19 06:22:36,842 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:22:36,842 INFO L132 encePairwiseOnDemand]: 260/263 looper letters, 13 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2022-01-19 06:22:36,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 229 transitions, 506 flow [2022-01-19 06:22:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:22:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:22:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2022-01-19 06:22:36,844 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8339670468948035 [2022-01-19 06:22:36,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2022-01-19 06:22:36,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2022-01-19 06:22:36,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:36,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2022-01-19 06:22:36,846 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:22:36,847 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:22:36,847 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:22:36,847 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:22:36,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 229 transitions, 506 flow [2022-01-19 06:22:36,849 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:22:36,850 INFO L242 Difference]: Finished difference. Result has 228 places, 226 transitions, 480 flow [2022-01-19 06:22:36,851 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:22:36,852 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 1 predicate places. [2022-01-19 06:22:36,852 INFO L470 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 480 flow [2022-01-19 06:22:36,853 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:22:36,854 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:36,854 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:36,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 06:22:36,854 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:22:36,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:36,854 INFO L85 PathProgramCache]: Analyzing trace with hash 699851186, now seen corresponding path program 1 times [2022-01-19 06:22:36,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:36,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424148197] [2022-01-19 06:22:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:36,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:37,085 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:37,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:37,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424148197] [2022-01-19 06:22:37,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424148197] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:22:37,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:22:37,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 06:22:37,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142543862] [2022-01-19 06:22:37,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:22:37,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 06:22:37,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:37,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 06:22:37,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-19 06:22:37,088 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 263 [2022-01-19 06:22:37,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 480 flow. Second operand has 12 states, 12 states have (on average 142.66666666666666) internal successors, (1712), 12 states have internal predecessors, (1712), 0 states have call successors, (0), 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:37,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:37,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 263 [2022-01-19 06:22:37,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:40,439 INFO L129 PetriNetUnfolder]: 13862/34838 cut-off events. [2022-01-19 06:22:40,440 INFO L130 PetriNetUnfolder]: For 310/310 co-relation queries the response was YES. [2022-01-19 06:22:40,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56601 conditions, 34838 events. 13862/34838 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 1337. Compared 423538 event pairs, 3273 based on Foata normal form. 0/33592 useless extension candidates. Maximal degree in co-relation 56594. Up to 9611 conditions per place. [2022-01-19 06:22:40,590 INFO L132 encePairwiseOnDemand]: 247/263 looper letters, 342 selfloop transitions, 45 changer transitions 132/659 dead transitions. [2022-01-19 06:22:40,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 659 transitions, 2448 flow [2022-01-19 06:22:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:22:40,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:22:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3998 transitions. [2022-01-19 06:22:40,602 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6080608365019011 [2022-01-19 06:22:40,602 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3998 transitions. [2022-01-19 06:22:40,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3998 transitions. [2022-01-19 06:22:40,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:40,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3998 transitions. [2022-01-19 06:22:40,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 159.92) internal successors, (3998), 25 states have internal predecessors, (3998), 0 states have call successors, (0), 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:40,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 263.0) internal successors, (6838), 26 states have internal predecessors, (6838), 0 states have call successors, (0), 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:40,619 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 263.0) internal successors, (6838), 26 states have internal predecessors, (6838), 0 states have call successors, (0), 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:40,619 INFO L186 Difference]: Start difference. First operand has 228 places, 226 transitions, 480 flow. Second operand 25 states and 3998 transitions. [2022-01-19 06:22:40,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 659 transitions, 2448 flow [2022-01-19 06:22:40,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 659 transitions, 2446 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:22:40,631 INFO L242 Difference]: Finished difference. Result has 262 places, 274 transitions, 777 flow [2022-01-19 06:22:40,632 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=777, PETRI_PLACES=262, PETRI_TRANSITIONS=274} [2022-01-19 06:22:40,633 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 35 predicate places. [2022-01-19 06:22:40,633 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 274 transitions, 777 flow [2022-01-19 06:22:40,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 142.66666666666666) internal successors, (1712), 12 states have internal predecessors, (1712), 0 states have call successors, (0), 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:40,633 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:40,634 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:40,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 06:22:40,705 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:22:40,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1416299563, now seen corresponding path program 1 times [2022-01-19 06:22:40,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:40,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117603227] [2022-01-19 06:22:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:40,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:40,737 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:40,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:40,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117603227] [2022-01-19 06:22:40,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117603227] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:40,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964645122] [2022-01-19 06:22:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:40,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:40,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:40,738 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:22:40,739 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:22:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:40,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:22:40,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:40,890 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:40,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:40,977 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:40,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964645122] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:40,977 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:40,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:22:40,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002163967] [2022-01-19 06:22:40,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:40,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:22:40,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:40,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:22:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:22:40,979 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 263 [2022-01-19 06:22:40,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 274 transitions, 777 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:22:40,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:40,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 263 [2022-01-19 06:22:40,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:41,031 INFO L129 PetriNetUnfolder]: 5/299 cut-off events. [2022-01-19 06:22:41,032 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2022-01-19 06:22:41,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 391 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 373. Up to 7 conditions per place. [2022-01-19 06:22:41,033 INFO L132 encePairwiseOnDemand]: 258/263 looper letters, 9 selfloop transitions, 7 changer transitions 16/186 dead transitions. [2022-01-19 06:22:41,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 186 transitions, 515 flow [2022-01-19 06:22:41,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:22:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:22:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1935 transitions. [2022-01-19 06:22:41,036 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8174904942965779 [2022-01-19 06:22:41,036 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1935 transitions. [2022-01-19 06:22:41,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1935 transitions. [2022-01-19 06:22:41,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:41,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1935 transitions. [2022-01-19 06:22:41,039 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:22:41,042 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:22:41,042 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:22:41,042 INFO L186 Difference]: Start difference. First operand has 262 places, 274 transitions, 777 flow. Second operand 9 states and 1935 transitions. [2022-01-19 06:22:41,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 186 transitions, 515 flow [2022-01-19 06:22:41,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 186 transitions, 484 flow, removed 6 selfloop flow, removed 11 redundant places. [2022-01-19 06:22:41,045 INFO L242 Difference]: Finished difference. Result has 193 places, 166 transitions, 399 flow [2022-01-19 06:22:41,045 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:22:41,046 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -34 predicate places. [2022-01-19 06:22:41,046 INFO L470 AbstractCegarLoop]: Abstraction has has 193 places, 166 transitions, 399 flow [2022-01-19 06:22:41,047 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:22:41,047 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:41,047 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:41,062 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:22:41,262 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:22:41,263 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:22:41,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1994897719, now seen corresponding path program 1 times [2022-01-19 06:22:41,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:41,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942827976] [2022-01-19 06:22:41,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:41,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:41,444 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:41,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:41,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942827976] [2022-01-19 06:22:41,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942827976] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:41,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634288040] [2022-01-19 06:22:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:41,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:41,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:41,446 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:22:41,447 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:22:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:41,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 06:22:41,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:41,772 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:41,773 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:41,812 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:41,867 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:41,908 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:41,928 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:41,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:41,967 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_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:22:42,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:22:42,333 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:42,333 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:42,345 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:42,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634288040] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:42,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:42,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-01-19 06:22:42,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503859098] [2022-01-19 06:22:42,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:42,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 06:22:42,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:42,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 06:22:42,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=343, Unknown=1, NotChecked=38, Total=462 [2022-01-19 06:22:42,348 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 263 [2022-01-19 06:22:42,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 166 transitions, 399 flow. Second operand has 22 states, 22 states have (on average 144.22727272727272) internal successors, (3173), 22 states have internal predecessors, (3173), 0 states have call successors, (0), 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:42,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:42,350 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 263 [2022-01-19 06:22:42,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:42,941 INFO L129 PetriNetUnfolder]: 578/1875 cut-off events. [2022-01-19 06:22:42,942 INFO L130 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2022-01-19 06:22:42,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 1875 events. 578/1875 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 15735 event pairs, 181 based on Foata normal form. 30/1844 useless extension candidates. Maximal degree in co-relation 3218. Up to 549 conditions per place. [2022-01-19 06:22:42,949 INFO L132 encePairwiseOnDemand]: 252/263 looper letters, 65 selfloop transitions, 7 changer transitions 68/232 dead transitions. [2022-01-19 06:22:42,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 232 transitions, 825 flow [2022-01-19 06:22:42,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 06:22:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 06:22:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1943 transitions. [2022-01-19 06:22:42,952 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5682948230476748 [2022-01-19 06:22:42,952 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1943 transitions. [2022-01-19 06:22:42,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1943 transitions. [2022-01-19 06:22:42,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:42,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1943 transitions. [2022-01-19 06:22:42,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 149.46153846153845) internal successors, (1943), 13 states have internal predecessors, (1943), 0 states have call successors, (0), 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:42,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 263.0) internal successors, (3682), 14 states have internal predecessors, (3682), 0 states have call successors, (0), 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:42,959 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 263.0) internal successors, (3682), 14 states have internal predecessors, (3682), 0 states have call successors, (0), 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:42,959 INFO L186 Difference]: Start difference. First operand has 193 places, 166 transitions, 399 flow. Second operand 13 states and 1943 transitions. [2022-01-19 06:22:42,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 232 transitions, 825 flow [2022-01-19 06:22:42,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 232 transitions, 806 flow, removed 2 selfloop flow, removed 7 redundant places. [2022-01-19 06:22:42,963 INFO L242 Difference]: Finished difference. Result has 196 places, 158 transitions, 384 flow [2022-01-19 06:22:42,963 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=384, PETRI_PLACES=196, PETRI_TRANSITIONS=158} [2022-01-19 06:22:42,964 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -31 predicate places. [2022-01-19 06:22:42,964 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 158 transitions, 384 flow [2022-01-19 06:22:42,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 144.22727272727272) internal successors, (3173), 22 states have internal predecessors, (3173), 0 states have call successors, (0), 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:42,965 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:42,965 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:22:42,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 06:22:43,180 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:22:43,180 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:22:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:43,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1884087702, now seen corresponding path program 1 times [2022-01-19 06:22:43,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:43,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729733491] [2022-01-19 06:22:43,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:43,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:43,235 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:43,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:43,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729733491] [2022-01-19 06:22:43,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729733491] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:43,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110297415] [2022-01-19 06:22:43,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:43,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:43,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:43,236 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:22:43,237 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:22:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:43,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 06:22:43,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:43,545 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:22:43,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:22:43,579 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:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 06:22:43,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:22:43,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110297415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:22:43,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:22:43,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2022-01-19 06:22:43,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126892637] [2022-01-19 06:22:43,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:22:43,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:22:43,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:43,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:22:43,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 06:22:43,624 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 263 [2022-01-19 06:22:43,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 158 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 173.5) internal successors, (1041), 6 states have internal predecessors, (1041), 0 states have call successors, (0), 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:43,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:43,625 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 263 [2022-01-19 06:22:43,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:43,708 INFO L129 PetriNetUnfolder]: 41/425 cut-off events. [2022-01-19 06:22:43,709 INFO L130 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-01-19 06:22:43,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 425 events. 41/425 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1898 event pairs, 14 based on Foata normal form. 30/436 useless extension candidates. Maximal degree in co-relation 670. Up to 88 conditions per place. [2022-01-19 06:22:43,710 INFO L132 encePairwiseOnDemand]: 251/263 looper letters, 37 selfloop transitions, 12 changer transitions 0/163 dead transitions. [2022-01-19 06:22:43,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 163 transitions, 497 flow [2022-01-19 06:22:43,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 06:22:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 06:22:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 900 transitions. [2022-01-19 06:22:43,712 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6844106463878327 [2022-01-19 06:22:43,712 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 900 transitions. [2022-01-19 06:22:43,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 900 transitions. [2022-01-19 06:22:43,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:43,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 900 transitions. [2022-01-19 06:22:43,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 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:43,716 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:22:43,716 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:22:43,716 INFO L186 Difference]: Start difference. First operand has 196 places, 158 transitions, 384 flow. Second operand 5 states and 900 transitions. [2022-01-19 06:22:43,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 163 transitions, 497 flow [2022-01-19 06:22:43,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 163 transitions, 457 flow, removed 9 selfloop flow, removed 15 redundant places. [2022-01-19 06:22:43,719 INFO L242 Difference]: Finished difference. Result has 172 places, 158 transitions, 368 flow [2022-01-19 06:22:43,719 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=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=172, PETRI_TRANSITIONS=158} [2022-01-19 06:22:43,719 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -55 predicate places. [2022-01-19 06:22:43,719 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 158 transitions, 368 flow [2022-01-19 06:22:43,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.5) internal successors, (1041), 6 states have internal predecessors, (1041), 0 states have call successors, (0), 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:43,720 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:43,720 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:22:43,738 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:22:43,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:43,923 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:22:43,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash -576779237, now seen corresponding path program 1 times [2022-01-19 06:22:43,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:43,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911097959] [2022-01-19 06:22:43,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:43,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:43,982 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:22:43,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:43,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911097959] [2022-01-19 06:22:43,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911097959] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:22:43,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:22:43,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:22:43,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020549492] [2022-01-19 06:22:43,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:22:43,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:22:43,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:43,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:22:43,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:22:43,984 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 263 [2022-01-19 06:22:43,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 158 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 173.66666666666666) internal successors, (1042), 6 states have internal predecessors, (1042), 0 states have call successors, (0), 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:43,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:43,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 263 [2022-01-19 06:22:43,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:44,051 INFO L129 PetriNetUnfolder]: 12/240 cut-off events. [2022-01-19 06:22:44,051 INFO L130 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-01-19 06:22:44,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 240 events. 12/240 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 618 event pairs, 1 based on Foata normal form. 20/252 useless extension candidates. Maximal degree in co-relation 386. Up to 50 conditions per place. [2022-01-19 06:22:44,052 INFO L132 encePairwiseOnDemand]: 257/263 looper letters, 39 selfloop transitions, 6 changer transitions 0/159 dead transitions. [2022-01-19 06:22:44,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 159 transitions, 465 flow [2022-01-19 06:22:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 06:22:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 06:22:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 892 transitions. [2022-01-19 06:22:44,054 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6783269961977186 [2022-01-19 06:22:44,054 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 892 transitions. [2022-01-19 06:22:44,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 892 transitions. [2022-01-19 06:22:44,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:44,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 892 transitions. [2022-01-19 06:22:44,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 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:44,057 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:22:44,057 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:22:44,057 INFO L186 Difference]: Start difference. First operand has 172 places, 158 transitions, 368 flow. Second operand 5 states and 892 transitions. [2022-01-19 06:22:44,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 159 transitions, 465 flow [2022-01-19 06:22:44,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 159 transitions, 441 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 06:22:44,059 INFO L242 Difference]: Finished difference. Result has 172 places, 158 transitions, 356 flow [2022-01-19 06:22:44,060 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:22:44,060 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -55 predicate places. [2022-01-19 06:22:44,060 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 158 transitions, 356 flow [2022-01-19 06:22:44,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 173.66666666666666) internal successors, (1042), 6 states have internal predecessors, (1042), 0 states have call successors, (0), 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:44,060 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:44,061 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:22:44,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 06:22:44,061 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:22:44,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1734496793, now seen corresponding path program 1 times [2022-01-19 06:22:44,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:44,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318273308] [2022-01-19 06:22:44,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:44,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:44,342 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:44,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:44,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318273308] [2022-01-19 06:22:44,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318273308] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:44,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565001492] [2022-01-19 06:22:44,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:44,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:44,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:44,344 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:22:44,376 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:22:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:44,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:22:44,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:44,691 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:44,691 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:44,737 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:44,804 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:44,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, 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:44,961 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:22:45,009 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:45,037 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:45,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:45,168 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_269 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_269) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:22:45,426 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:45,442 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:45,442 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:45,454 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:45,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565001492] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:45,454 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:45,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 37 [2022-01-19 06:22:45,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364389274] [2022-01-19 06:22:45,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:45,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-19 06:22:45,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:45,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-19 06:22:45,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1125, Unknown=1, NotChecked=68, Total=1332 [2022-01-19 06:22:45,457 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2022-01-19 06:22:45,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 158 transitions, 356 flow. Second operand has 37 states, 37 states have (on average 137.40540540540542) internal successors, (5084), 37 states have internal predecessors, (5084), 0 states have call successors, (0), 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:45,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:45,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2022-01-19 06:22:45,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:46,253 INFO L129 PetriNetUnfolder]: 63/500 cut-off events. [2022-01-19 06:22:46,253 INFO L130 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-01-19 06:22:46,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 500 events. 63/500 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2674 event pairs, 15 based on Foata normal form. 3/484 useless extension candidates. Maximal degree in co-relation 829. Up to 98 conditions per place. [2022-01-19 06:22:46,254 INFO L132 encePairwiseOnDemand]: 242/263 looper letters, 71 selfloop transitions, 26 changer transitions 25/208 dead transitions. [2022-01-19 06:22:46,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 208 transitions, 715 flow [2022-01-19 06:22:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 06:22:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 06:22:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3715 transitions. [2022-01-19 06:22:46,259 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5231657513026334 [2022-01-19 06:22:46,259 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 3715 transitions. [2022-01-19 06:22:46,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 3715 transitions. [2022-01-19 06:22:46,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:46,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 3715 transitions. [2022-01-19 06:22:46,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 137.59259259259258) internal successors, (3715), 27 states have internal predecessors, (3715), 0 states have call successors, (0), 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:46,269 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:22:46,269 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:22:46,269 INFO L186 Difference]: Start difference. First operand has 172 places, 158 transitions, 356 flow. Second operand 27 states and 3715 transitions. [2022-01-19 06:22:46,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 208 transitions, 715 flow [2022-01-19 06:22:46,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 208 transitions, 704 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 06:22:46,273 INFO L242 Difference]: Finished difference. Result has 207 places, 174 transitions, 478 flow [2022-01-19 06:22:46,273 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=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=478, PETRI_PLACES=207, PETRI_TRANSITIONS=174} [2022-01-19 06:22:46,273 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -20 predicate places. [2022-01-19 06:22:46,273 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 174 transitions, 478 flow [2022-01-19 06:22:46,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 137.40540540540542) internal successors, (5084), 37 states have internal predecessors, (5084), 0 states have call successors, (0), 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:46,274 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:46,274 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:22:46,293 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:22:46,490 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:22:46,490 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:22:46,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:46,490 INFO L85 PathProgramCache]: Analyzing trace with hash 446711275, now seen corresponding path program 1 times [2022-01-19 06:22:46,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:46,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455691362] [2022-01-19 06:22:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:46,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:46,773 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:46,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:46,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455691362] [2022-01-19 06:22:46,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455691362] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:46,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155814037] [2022-01-19 06:22:46,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:46,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:46,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:46,775 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:22:46,776 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:22:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:46,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:22:46,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:47,109 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:47,110 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:47,146 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:47,212 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:47,308 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:47,388 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:47,445 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:47,479 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:47,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:47,624 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_335 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_335) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:22:47,895 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:47,912 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:47,912 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:47,923 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:47,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155814037] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:47,924 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:47,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 37 [2022-01-19 06:22:47,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262535619] [2022-01-19 06:22:47,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:47,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-19 06:22:47,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:47,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-19 06:22:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1125, Unknown=1, NotChecked=68, Total=1332 [2022-01-19 06:22:47,928 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2022-01-19 06:22:47,931 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 174 transitions, 478 flow. Second operand has 37 states, 37 states have (on average 137.40540540540542) internal successors, (5084), 37 states have internal predecessors, (5084), 0 states have call successors, (0), 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:47,931 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:47,931 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2022-01-19 06:22:47,931 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:48,850 INFO L129 PetriNetUnfolder]: 112/659 cut-off events. [2022-01-19 06:22:48,851 INFO L130 PetriNetUnfolder]: For 219/226 co-relation queries the response was YES. [2022-01-19 06:22:48,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 659 events. 112/659 cut-off events. For 219/226 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3791 event pairs, 14 based on Foata normal form. 9/646 useless extension candidates. Maximal degree in co-relation 1311. Up to 144 conditions per place. [2022-01-19 06:22:48,853 INFO L132 encePairwiseOnDemand]: 242/263 looper letters, 100 selfloop transitions, 30 changer transitions 18/241 dead transitions. [2022-01-19 06:22:48,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 241 transitions, 1030 flow [2022-01-19 06:22:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 06:22:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 06:22:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3733 transitions. [2022-01-19 06:22:48,858 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5257006055485143 [2022-01-19 06:22:48,858 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 3733 transitions. [2022-01-19 06:22:48,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 3733 transitions. [2022-01-19 06:22:48,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:48,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 3733 transitions. [2022-01-19 06:22:48,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 138.25925925925927) internal successors, (3733), 27 states have internal predecessors, (3733), 0 states have call successors, (0), 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:48,867 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:22:48,868 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:22:48,868 INFO L186 Difference]: Start difference. First operand has 207 places, 174 transitions, 478 flow. Second operand 27 states and 3733 transitions. [2022-01-19 06:22:48,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 241 transitions, 1030 flow [2022-01-19 06:22:48,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 241 transitions, 993 flow, removed 8 selfloop flow, removed 16 redundant places. [2022-01-19 06:22:48,872 INFO L242 Difference]: Finished difference. Result has 218 places, 197 transitions, 612 flow [2022-01-19 06:22:48,872 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=612, PETRI_PLACES=218, PETRI_TRANSITIONS=197} [2022-01-19 06:22:48,872 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -9 predicate places. [2022-01-19 06:22:48,872 INFO L470 AbstractCegarLoop]: Abstraction has has 218 places, 197 transitions, 612 flow [2022-01-19 06:22:48,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 137.40540540540542) internal successors, (5084), 37 states have internal predecessors, (5084), 0 states have call successors, (0), 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:48,873 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:48,874 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:22:48,891 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:22:49,089 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:22:49,089 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:22:49,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash -87740629, now seen corresponding path program 2 times [2022-01-19 06:22:49,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:49,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944060103] [2022-01-19 06:22:49,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:49,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:49,390 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:22:49,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:49,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944060103] [2022-01-19 06:22:49,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944060103] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:49,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770249175] [2022-01-19 06:22:49,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:22:49,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:49,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:49,392 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:22:49,392 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:22:49,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:22:49,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:22:49,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:22:49,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:49,698 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:49,699 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:49,740 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:49,836 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:49,913 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:22:49,987 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:22:50,042 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:50,066 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:22:50,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:50,174 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_403) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:50,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~post7#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_403) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:50,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_403) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:50,216 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_403) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:50,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (= (+ (- 1) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_400))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_403) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:50,491 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:50,506 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:50,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 13 treesize of output 12 [2022-01-19 06:22:50,517 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:22:50,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770249175] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:50,517 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:50,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 41 [2022-01-19 06:22:50,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153235192] [2022-01-19 06:22:50,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:50,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 06:22:50,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:50,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 06:22:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1103, Unknown=5, NotChecked=360, Total=1640 [2022-01-19 06:22:50,521 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2022-01-19 06:22:50,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 197 transitions, 612 flow. Second operand has 41 states, 41 states have (on average 136.97560975609755) internal successors, (5616), 41 states have internal predecessors, (5616), 0 states have call successors, (0), 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:50,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:50,524 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2022-01-19 06:22:50,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:51,403 INFO L129 PetriNetUnfolder]: 158/1104 cut-off events. [2022-01-19 06:22:51,403 INFO L130 PetriNetUnfolder]: For 586/713 co-relation queries the response was YES. [2022-01-19 06:22:51,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 1104 events. 158/1104 cut-off events. For 586/713 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 8175 event pairs, 26 based on Foata normal form. 59/1123 useless extension candidates. Maximal degree in co-relation 2324. Up to 130 conditions per place. [2022-01-19 06:22:51,407 INFO L132 encePairwiseOnDemand]: 241/263 looper letters, 106 selfloop transitions, 54 changer transitions 58/311 dead transitions. [2022-01-19 06:22:51,407 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 311 transitions, 1595 flow [2022-01-19 06:22:51,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-19 06:22:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-01-19 06:22:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4683 transitions. [2022-01-19 06:22:51,410 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5237083426526504 [2022-01-19 06:22:51,410 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 4683 transitions. [2022-01-19 06:22:51,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 4683 transitions. [2022-01-19 06:22:51,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:51,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 4683 transitions. [2022-01-19 06:22:51,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 137.73529411764707) internal successors, (4683), 34 states have internal predecessors, (4683), 0 states have call successors, (0), 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:51,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 263.0) internal successors, (9205), 35 states have internal predecessors, (9205), 0 states have call successors, (0), 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:51,424 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 263.0) internal successors, (9205), 35 states have internal predecessors, (9205), 0 states have call successors, (0), 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:51,424 INFO L186 Difference]: Start difference. First operand has 218 places, 197 transitions, 612 flow. Second operand 34 states and 4683 transitions. [2022-01-19 06:22:51,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 311 transitions, 1595 flow [2022-01-19 06:22:51,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 311 transitions, 1490 flow, removed 41 selfloop flow, removed 13 redundant places. [2022-01-19 06:22:51,430 INFO L242 Difference]: Finished difference. Result has 256 places, 238 transitions, 1044 flow [2022-01-19 06:22:51,430 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1044, PETRI_PLACES=256, PETRI_TRANSITIONS=238} [2022-01-19 06:22:51,430 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 29 predicate places. [2022-01-19 06:22:51,431 INFO L470 AbstractCegarLoop]: Abstraction has has 256 places, 238 transitions, 1044 flow [2022-01-19 06:22:51,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 136.97560975609755) internal successors, (5616), 41 states have internal predecessors, (5616), 0 states have call successors, (0), 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:51,432 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:51,432 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:22:51,448 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:22:51,648 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:22:51,649 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:22:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:51,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1768286467, now seen corresponding path program 3 times [2022-01-19 06:22:51,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:51,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215988371] [2022-01-19 06:22:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:51,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:51,980 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:22:51,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:51,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215988371] [2022-01-19 06:22:51,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215988371] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:51,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115961830] [2022-01-19 06:22:51,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:22:51,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:51,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:51,982 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:22:51,983 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:22:52,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 06:22:52,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:22:52,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:22:52,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:52,280 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:52,280 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:52,316 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:52,403 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:52,470 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:52,540 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:52,599 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:52,624 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:22:52,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:52,702 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_469) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:52,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~post7#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_469) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:52,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_469) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:52,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_469) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:52,766 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (= (+ (- 1) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_466))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_469) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:53,020 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:53,036 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:53,037 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:53,048 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:22:53,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115961830] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:53,048 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:53,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 41 [2022-01-19 06:22:53,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355666164] [2022-01-19 06:22:53,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:53,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 06:22:53,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:53,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 06:22:53,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1103, Unknown=5, NotChecked=360, Total=1640 [2022-01-19 06:22:53,051 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2022-01-19 06:22:53,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 238 transitions, 1044 flow. Second operand has 41 states, 41 states have (on average 136.97560975609755) internal successors, (5616), 41 states have internal predecessors, (5616), 0 states have call successors, (0), 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:53,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:53,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2022-01-19 06:22:53,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:53,764 INFO L129 PetriNetUnfolder]: 146/969 cut-off events. [2022-01-19 06:22:53,764 INFO L130 PetriNetUnfolder]: For 1241/1599 co-relation queries the response was YES. [2022-01-19 06:22:53,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 969 events. 146/969 cut-off events. For 1241/1599 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 6680 event pairs, 12 based on Foata normal form. 72/1007 useless extension candidates. Maximal degree in co-relation 2417. Up to 202 conditions per place. [2022-01-19 06:22:53,769 INFO L132 encePairwiseOnDemand]: 241/263 looper letters, 148 selfloop transitions, 86 changer transitions 7/334 dead transitions. [2022-01-19 06:22:53,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 334 transitions, 2112 flow [2022-01-19 06:22:53,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:22:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:22:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3490 transitions. [2022-01-19 06:22:53,772 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5307984790874525 [2022-01-19 06:22:53,772 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3490 transitions. [2022-01-19 06:22:53,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3490 transitions. [2022-01-19 06:22:53,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:53,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3490 transitions. [2022-01-19 06:22:53,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 139.6) internal successors, (3490), 25 states have internal predecessors, (3490), 0 states have call successors, (0), 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:53,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 263.0) internal successors, (6838), 26 states have internal predecessors, (6838), 0 states have call successors, (0), 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:53,780 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 263.0) internal successors, (6838), 26 states have internal predecessors, (6838), 0 states have call successors, (0), 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:53,780 INFO L186 Difference]: Start difference. First operand has 256 places, 238 transitions, 1044 flow. Second operand 25 states and 3490 transitions. [2022-01-19 06:22:53,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 334 transitions, 2112 flow [2022-01-19 06:22:53,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 334 transitions, 1949 flow, removed 71 selfloop flow, removed 20 redundant places. [2022-01-19 06:22:53,790 INFO L242 Difference]: Finished difference. Result has 262 places, 295 transitions, 1682 flow [2022-01-19 06:22:53,790 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1682, PETRI_PLACES=262, PETRI_TRANSITIONS=295} [2022-01-19 06:22:53,790 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 35 predicate places. [2022-01-19 06:22:53,790 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 295 transitions, 1682 flow [2022-01-19 06:22:53,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 136.97560975609755) internal successors, (5616), 41 states have internal predecessors, (5616), 0 states have call successors, (0), 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:53,791 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:53,791 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:22:53,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 06:22:54,007 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:22:54,007 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:22:54,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash 386052771, now seen corresponding path program 4 times [2022-01-19 06:22:54,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:54,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420173918] [2022-01-19 06:22:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:54,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 06:22:54,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:54,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420173918] [2022-01-19 06:22:54,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420173918] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:54,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328735859] [2022-01-19 06:22:54,361 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 06:22:54,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:54,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:54,362 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:22:54,367 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:22:54,452 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 06:22:54,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:22:54,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:22:54,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:54,687 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:54,687 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:54,722 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:54,850 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:54,868 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:54,937 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:55,004 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 17 treesize of output 9 [2022-01-19 06:22:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 06:22:55,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:55,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_535) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:55,135 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~post7#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_535) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:55,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_535) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:55,142 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_535) |c_~#A~0.base|) |c_~#A~0.offset|) (- 1)) 0)) is different from false [2022-01-19 06:22:55,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (= (+ (- 1) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_532))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_535) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:22:55,447 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:55,465 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:55,465 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:55,479 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:22:55,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328735859] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:55,480 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:55,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 41 [2022-01-19 06:22:55,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295305731] [2022-01-19 06:22:55,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:55,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 06:22:55,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 06:22:55,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1103, Unknown=5, NotChecked=360, Total=1640 [2022-01-19 06:22:55,483 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2022-01-19 06:22:55,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 295 transitions, 1682 flow. Second operand has 41 states, 41 states have (on average 136.97560975609755) internal successors, (5616), 41 states have internal predecessors, (5616), 0 states have call successors, (0), 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:55,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:55,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2022-01-19 06:22:55,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:56,321 INFO L129 PetriNetUnfolder]: 150/1056 cut-off events. [2022-01-19 06:22:56,321 INFO L130 PetriNetUnfolder]: For 1762/2344 co-relation queries the response was YES. [2022-01-19 06:22:56,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2892 conditions, 1056 events. 150/1056 cut-off events. For 1762/2344 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 7599 event pairs, 17 based on Foata normal form. 67/1087 useless extension candidates. Maximal degree in co-relation 2853. Up to 197 conditions per place. [2022-01-19 06:22:56,327 INFO L132 encePairwiseOnDemand]: 241/263 looper letters, 166 selfloop transitions, 78 changer transitions 17/354 dead transitions. [2022-01-19 06:22:56,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 354 transitions, 2481 flow [2022-01-19 06:22:56,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 06:22:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 06:22:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4016 transitions. [2022-01-19 06:22:56,344 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5265504130064246 [2022-01-19 06:22:56,344 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4016 transitions. [2022-01-19 06:22:56,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4016 transitions. [2022-01-19 06:22:56,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:56,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4016 transitions. [2022-01-19 06:22:56,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 138.48275862068965) internal successors, (4016), 29 states have internal predecessors, (4016), 0 states have call successors, (0), 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:56,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 263.0) internal successors, (7890), 30 states have internal predecessors, (7890), 0 states have call successors, (0), 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:56,355 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 263.0) internal successors, (7890), 30 states have internal predecessors, (7890), 0 states have call successors, (0), 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:56,355 INFO L186 Difference]: Start difference. First operand has 262 places, 295 transitions, 1682 flow. Second operand 29 states and 4016 transitions. [2022-01-19 06:22:56,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 354 transitions, 2481 flow [2022-01-19 06:22:56,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 354 transitions, 2408 flow, removed 30 selfloop flow, removed 4 redundant places. [2022-01-19 06:22:56,366 INFO L242 Difference]: Finished difference. Result has 297 places, 307 transitions, 1943 flow [2022-01-19 06:22:56,367 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1609, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1943, PETRI_PLACES=297, PETRI_TRANSITIONS=307} [2022-01-19 06:22:56,367 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 70 predicate places. [2022-01-19 06:22:56,367 INFO L470 AbstractCegarLoop]: Abstraction has has 297 places, 307 transitions, 1943 flow [2022-01-19 06:22:56,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 136.97560975609755) internal successors, (5616), 41 states have internal predecessors, (5616), 0 states have call successors, (0), 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:56,368 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:56,368 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:56,386 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:22:56,583 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:22:56,583 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:22:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2098967387, now seen corresponding path program 5 times [2022-01-19 06:22:56,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:56,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590081824] [2022-01-19 06:22:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:56,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:56,896 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:22:56,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:56,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590081824] [2022-01-19 06:22:56,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590081824] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:56,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203696706] [2022-01-19 06:22:56,896 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 06:22:56,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:56,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:56,897 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:22:56,927 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:22:57,002 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-19 06:22:57,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:22:57,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-19 06:22:57,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:57,217 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:57,217 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:57,251 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:57,308 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:57,400 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:57,502 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:57,615 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:57,633 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:57,658 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:57,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:57,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_608) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:22:57,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_608) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:22:57,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~mem9#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_608) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:22:57,739 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_608) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:22:57,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of2ForFork0_#t~post7#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_608) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:22:57,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| |c_t_funThread1of2ForFork0_#t~mem6#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_608) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:22:57,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_608 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (select .cse0 |c_~#A~0.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_608) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:22:57,796 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_603 (Array Int Int)) (v_ArrVal_608 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_603))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (select .cse1 |c_~#A~0.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_608) |c_~#A~0.base|) |c_~#A~0.offset|))) is different from false [2022-01-19 06:22:58,061 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:22:58,077 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:58,077 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:58,088 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:58,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203696706] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:58,088 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:58,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 39 [2022-01-19 06:22:58,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560583437] [2022-01-19 06:22:58,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:58,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-19 06:22:58,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:58,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-19 06:22:58,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=821, Unknown=8, NotChecked=520, Total=1482 [2022-01-19 06:22:58,092 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2022-01-19 06:22:58,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 307 transitions, 1943 flow. Second operand has 39 states, 39 states have (on average 137.2051282051282) internal successors, (5351), 39 states have internal predecessors, (5351), 0 states have call successors, (0), 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:58,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:58,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2022-01-19 06:22:58,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:22:58,872 INFO L129 PetriNetUnfolder]: 163/1236 cut-off events. [2022-01-19 06:22:58,872 INFO L130 PetriNetUnfolder]: For 2433/3051 co-relation queries the response was YES. [2022-01-19 06:22:58,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3501 conditions, 1236 events. 163/1236 cut-off events. For 2433/3051 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 9695 event pairs, 32 based on Foata normal form. 77/1273 useless extension candidates. Maximal degree in co-relation 3451. Up to 262 conditions per place. [2022-01-19 06:22:58,878 INFO L132 encePairwiseOnDemand]: 244/263 looper letters, 144 selfloop transitions, 39 changer transitions 112/388 dead transitions. [2022-01-19 06:22:58,878 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 388 transitions, 3172 flow [2022-01-19 06:22:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 06:22:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 06:22:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2515 transitions. [2022-01-19 06:22:58,893 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.531263202365864 [2022-01-19 06:22:58,893 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2515 transitions. [2022-01-19 06:22:58,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2515 transitions. [2022-01-19 06:22:58,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:58,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2515 transitions. [2022-01-19 06:22:58,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 139.72222222222223) internal successors, (2515), 18 states have internal predecessors, (2515), 0 states have call successors, (0), 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:58,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 263.0) internal successors, (4997), 19 states have internal predecessors, (4997), 0 states have call successors, (0), 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:58,902 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 263.0) internal successors, (4997), 19 states have internal predecessors, (4997), 0 states have call successors, (0), 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:58,902 INFO L186 Difference]: Start difference. First operand has 297 places, 307 transitions, 1943 flow. Second operand 18 states and 2515 transitions. [2022-01-19 06:22:58,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 388 transitions, 3172 flow [2022-01-19 06:22:58,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 388 transitions, 2997 flow, removed 33 selfloop flow, removed 15 redundant places. [2022-01-19 06:22:58,919 INFO L242 Difference]: Finished difference. Result has 302 places, 261 transitions, 1517 flow [2022-01-19 06:22:58,919 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1517, PETRI_PLACES=302, PETRI_TRANSITIONS=261} [2022-01-19 06:22:58,919 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 75 predicate places. [2022-01-19 06:22:58,919 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 261 transitions, 1517 flow [2022-01-19 06:22:58,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 137.2051282051282) internal successors, (5351), 39 states have internal predecessors, (5351), 0 states have call successors, (0), 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:58,920 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:58,920 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:58,939 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:59,135 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:59,136 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:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1570202239, now seen corresponding path program 6 times [2022-01-19 06:22:59,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:59,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036022150] [2022-01-19 06:22:59,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:59,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:22:59,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036022150] [2022-01-19 06:22:59,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036022150] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:59,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515035585] [2022-01-19 06:22:59,493 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-19 06:22:59,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:59,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:59,494 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:59,494 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:59,611 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-01-19 06:22:59,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:22:59,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:22:59,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:59,823 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:59,823 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:59,856 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:59,940 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:23:00,033 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:00,051 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:23:00,105 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:00,161 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:23:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:23:00,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:23:00,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_676) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:00,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~post7#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_676) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:00,299 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread1of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_676) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:00,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_676 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_676) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:00,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_673 (Array Int Int)) (v_ArrVal_676 (Array Int Int))) (= (+ (- 1) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_673))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_676) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:00,557 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:23:00,572 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:23:00,572 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:23:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-01-19 06:23:00,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515035585] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:23:00,582 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:23:00,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 41 [2022-01-19 06:23:00,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038549314] [2022-01-19 06:23:00,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:23:00,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 06:23:00,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:23:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 06:23:00,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1105, Unknown=5, NotChecked=360, Total=1640 [2022-01-19 06:23:00,585 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2022-01-19 06:23:00,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 261 transitions, 1517 flow. Second operand has 41 states, 41 states have (on average 137.0487804878049) internal successors, (5619), 41 states have internal predecessors, (5619), 0 states have call successors, (0), 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:00,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:23:00,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2022-01-19 06:23:00,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:23:01,260 INFO L129 PetriNetUnfolder]: 98/818 cut-off events. [2022-01-19 06:23:01,260 INFO L130 PetriNetUnfolder]: For 1644/1997 co-relation queries the response was YES. [2022-01-19 06:23:01,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2328 conditions, 818 events. 98/818 cut-off events. For 1644/1997 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5557 event pairs, 14 based on Foata normal form. 49/839 useless extension candidates. Maximal degree in co-relation 2275. Up to 115 conditions per place. [2022-01-19 06:23:01,265 INFO L132 encePairwiseOnDemand]: 244/263 looper letters, 113 selfloop transitions, 10 changer transitions 109/325 dead transitions. [2022-01-19 06:23:01,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 325 transitions, 2475 flow [2022-01-19 06:23:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 06:23:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 06:23:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2511 transitions. [2022-01-19 06:23:01,269 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5304182509505704 [2022-01-19 06:23:01,269 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2511 transitions. [2022-01-19 06:23:01,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2511 transitions. [2022-01-19 06:23:01,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:23:01,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2511 transitions. [2022-01-19 06:23:01,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 139.5) internal successors, (2511), 18 states have internal predecessors, (2511), 0 states have call successors, (0), 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:01,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 263.0) internal successors, (4997), 19 states have internal predecessors, (4997), 0 states have call successors, (0), 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:01,274 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 263.0) internal successors, (4997), 19 states have internal predecessors, (4997), 0 states have call successors, (0), 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:01,274 INFO L186 Difference]: Start difference. First operand has 302 places, 261 transitions, 1517 flow. Second operand 18 states and 2511 transitions. [2022-01-19 06:23:01,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 325 transitions, 2475 flow [2022-01-19 06:23:01,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 325 transitions, 2323 flow, removed 38 selfloop flow, removed 19 redundant places. [2022-01-19 06:23:01,286 INFO L242 Difference]: Finished difference. Result has 307 places, 215 transitions, 998 flow [2022-01-19 06:23:01,286 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=998, PETRI_PLACES=307, PETRI_TRANSITIONS=215} [2022-01-19 06:23:01,286 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 80 predicate places. [2022-01-19 06:23:01,286 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 215 transitions, 998 flow [2022-01-19 06:23:01,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 137.0487804878049) internal successors, (5619), 41 states have internal predecessors, (5619), 0 states have call successors, (0), 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:01,287 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:23:01,287 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:23:01,307 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:23:01,503 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:23:01,503 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:23:01,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:23:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash -574950043, now seen corresponding path program 7 times [2022-01-19 06:23:01,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:23:01,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706610105] [2022-01-19 06:23:01,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:23:01,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:23:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:23:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:23:01,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:23:01,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706610105] [2022-01-19 06:23:01,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706610105] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:23:01,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627407749] [2022-01-19 06:23:01,807 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-19 06:23:01,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:23:01,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:23:01,808 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:23:01,808 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:23:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:23:01,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:23:01,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:23:02,122 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:23:02,122 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:23:02,156 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:02,212 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:23:02,280 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:02,413 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:23: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, 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:02,489 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:23:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:23:02,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:23:02,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_748) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:23:02,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post10#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_748) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:23:02,582 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~mem9#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_748) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:23:02,586 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_748 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_748) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:23:02,618 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:23:02,618 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 18 treesize of output 19 [2022-01-19 06:23:02,619 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:23:02,621 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 9 treesize of output 7 [2022-01-19 06:23:03,128 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 8 treesize of output 4 [2022-01-19 06:23:03,143 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:23:03,143 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:23:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-01-19 06:23:03,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627407749] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:23:03,153 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:23:03,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 38 [2022-01-19 06:23:03,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43576466] [2022-01-19 06:23:03,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:23:03,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-19 06:23:03,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:23:03,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-19 06:23:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1003, Unknown=4, NotChecked=268, Total=1406 [2022-01-19 06:23:03,156 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2022-01-19 06:23:03,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 215 transitions, 998 flow. Second operand has 38 states, 38 states have (on average 137.3684210526316) internal successors, (5220), 38 states have internal predecessors, (5220), 0 states have call successors, (0), 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:03,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:23:03,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2022-01-19 06:23:03,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:23:03,913 INFO L129 PetriNetUnfolder]: 43/452 cut-off events. [2022-01-19 06:23:03,913 INFO L130 PetriNetUnfolder]: For 704/803 co-relation queries the response was YES. [2022-01-19 06:23:03,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 452 events. 43/452 cut-off events. For 704/803 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2217 event pairs, 0 based on Foata normal form. 16/453 useless extension candidates. Maximal degree in co-relation 1127. Up to 69 conditions per place. [2022-01-19 06:23:03,916 INFO L132 encePairwiseOnDemand]: 241/263 looper letters, 95 selfloop transitions, 27 changer transitions 25/240 dead transitions. [2022-01-19 06:23:03,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 240 transitions, 1389 flow [2022-01-19 06:23:03,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 06:23:03,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 06:23:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2915 transitions. [2022-01-19 06:23:03,918 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.527792866195908 [2022-01-19 06:23:03,918 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2915 transitions. [2022-01-19 06:23:03,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2915 transitions. [2022-01-19 06:23:03,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:23:03,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2915 transitions. [2022-01-19 06:23:03,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 138.8095238095238) internal successors, (2915), 21 states have internal predecessors, (2915), 0 states have call successors, (0), 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:03,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 263.0) internal successors, (5786), 22 states have internal predecessors, (5786), 0 states have call successors, (0), 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:03,924 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 263.0) internal successors, (5786), 22 states have internal predecessors, (5786), 0 states have call successors, (0), 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:03,924 INFO L186 Difference]: Start difference. First operand has 307 places, 215 transitions, 998 flow. Second operand 21 states and 2915 transitions. [2022-01-19 06:23:03,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 240 transitions, 1389 flow [2022-01-19 06:23:03,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 240 transitions, 1204 flow, removed 66 selfloop flow, removed 40 redundant places. [2022-01-19 06:23:03,931 INFO L242 Difference]: Finished difference. Result has 262 places, 207 transitions, 840 flow [2022-01-19 06:23:03,931 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=840, PETRI_PLACES=262, PETRI_TRANSITIONS=207} [2022-01-19 06:23:03,931 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 35 predicate places. [2022-01-19 06:23:03,931 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 207 transitions, 840 flow [2022-01-19 06:23:03,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 137.3684210526316) internal successors, (5220), 38 states have internal predecessors, (5220), 0 states have call successors, (0), 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:03,932 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:23:03,932 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:23:03,950 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:23:04,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:23:04,135 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:23:04,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:23:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash -52115365, now seen corresponding path program 8 times [2022-01-19 06:23:04,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:23:04,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552662193] [2022-01-19 06:23:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:23:04,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:23:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:23:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:23:04,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:23:04,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552662193] [2022-01-19 06:23:04,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552662193] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:23:04,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564821817] [2022-01-19 06:23:04,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:23:04,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:23:04,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:23:04,458 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:23:04,458 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:23:04,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:23:04,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:23:04,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-19 06:23:04,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:23:04,777 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:23:04,777 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:23:04,814 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:04,865 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:23:04,930 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:05,008 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:05,058 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:23:05,115 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:23:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:23:05,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:23:05,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_816 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_816) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:05,245 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:23:05,245 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 22 treesize of output 23 [2022-01-19 06:23:05,246 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 36 treesize of output 28 [2022-01-19 06:23:05,248 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 11 treesize of output 9 [2022-01-19 06:23:05,819 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 8 treesize of output 4 [2022-01-19 06:23:05,837 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:23:05,838 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:23:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-01-19 06:23:05,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564821817] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:23:05,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:23:05,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 40 [2022-01-19 06:23:05,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823211898] [2022-01-19 06:23:05,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:23:05,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-19 06:23:05,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:23:05,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-19 06:23:05,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1312, Unknown=1, NotChecked=74, Total=1560 [2022-01-19 06:23:05,853 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2022-01-19 06:23:05,855 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 207 transitions, 840 flow. Second operand has 40 states, 40 states have (on average 137.15) internal successors, (5486), 40 states have internal predecessors, (5486), 0 states have call successors, (0), 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:05,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:23:05,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2022-01-19 06:23:05,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:23:06,465 INFO L129 PetriNetUnfolder]: 36/398 cut-off events. [2022-01-19 06:23:06,465 INFO L130 PetriNetUnfolder]: For 495/574 co-relation queries the response was YES. [2022-01-19 06:23:06,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 398 events. 36/398 cut-off events. For 495/574 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1728 event pairs, 7 based on Foata normal form. 41/425 useless extension candidates. Maximal degree in co-relation 919. Up to 52 conditions per place. [2022-01-19 06:23:06,467 INFO L132 encePairwiseOnDemand]: 243/263 looper letters, 54 selfloop transitions, 6 changer transitions 68/208 dead transitions. [2022-01-19 06:23:06,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 208 transitions, 1077 flow [2022-01-19 06:23:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 06:23:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 06:23:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2614 transitions. [2022-01-19 06:23:06,469 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5231138683209926 [2022-01-19 06:23:06,469 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2614 transitions. [2022-01-19 06:23:06,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2614 transitions. [2022-01-19 06:23:06,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:23:06,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2614 transitions. [2022-01-19 06:23:06,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 137.57894736842104) internal successors, (2614), 19 states have internal predecessors, (2614), 0 states have call successors, (0), 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:06,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 263.0) internal successors, (5260), 20 states have internal predecessors, (5260), 0 states have call successors, (0), 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:06,474 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 263.0) internal successors, (5260), 20 states have internal predecessors, (5260), 0 states have call successors, (0), 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:06,474 INFO L186 Difference]: Start difference. First operand has 262 places, 207 transitions, 840 flow. Second operand 19 states and 2614 transitions. [2022-01-19 06:23:06,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 208 transitions, 1077 flow [2022-01-19 06:23:06,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 208 transitions, 1010 flow, removed 14 selfloop flow, removed 20 redundant places. [2022-01-19 06:23:06,478 INFO L242 Difference]: Finished difference. Result has 246 places, 140 transitions, 434 flow [2022-01-19 06:23:06,479 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=434, PETRI_PLACES=246, PETRI_TRANSITIONS=140} [2022-01-19 06:23:06,479 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, 19 predicate places. [2022-01-19 06:23:06,479 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 140 transitions, 434 flow [2022-01-19 06:23:06,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 137.15) internal successors, (5486), 40 states have internal predecessors, (5486), 0 states have call successors, (0), 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:06,479 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:23:06,480 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:23:06,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-19 06:23:06,696 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,SelfDestructingSolverStorable19 [2022-01-19 06:23:06,696 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:23:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:23:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1681739565, now seen corresponding path program 2 times [2022-01-19 06:23:06,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:23:06,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491782592] [2022-01-19 06:23:06,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:23:06,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:23:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:23:07,051 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:23:07,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:23:07,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491782592] [2022-01-19 06:23:07,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491782592] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:23:07,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772709821] [2022-01-19 06:23:07,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:23:07,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:23:07,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:23:07,052 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:23:07,053 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:23:07,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:23:07,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:23:07,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-19 06:23:07,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:23:07,387 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:23:07,388 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:23:07,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, 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:07,474 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:07,609 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:23:07,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:23:07,702 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:23:07,769 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 17 treesize of output 9 [2022-01-19 06:23:07,793 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:23:07,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:23:07,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_887) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:07,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread2of2ForFork0_#t~post7#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_887) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:07,888 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (store (select |c_#memory_int| |c_~#A~0.base|) |c_~#A~0.offset| (+ |c_t_funThread2of2ForFork0_#t~mem6#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_887) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:07,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int))) (= (+ (- 1) (select (select (store (store |c_#memory_int| |c_~#A~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#A~0.base|))) (store .cse0 |c_~#A~0.offset| (+ (select .cse0 |c_~#A~0.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_887) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:07,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (+ (- 1) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_884))) (store .cse0 |c_~#A~0.base| (let ((.cse1 (select .cse0 |c_~#A~0.base|))) (store .cse1 |c_~#A~0.offset| (+ (select .cse1 |c_~#A~0.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_887) |c_~#A~0.base|) |c_~#A~0.offset|)) 0)) is different from false [2022-01-19 06:23:08,243 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:23:08,262 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:23:08,262 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:23:08,275 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:23:08,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772709821] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:23:08,275 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:23:08,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 41 [2022-01-19 06:23:08,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172943789] [2022-01-19 06:23:08,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:23:08,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 06:23:08,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:23:08,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 06:23:08,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1103, Unknown=5, NotChecked=360, Total=1640 [2022-01-19 06:23:08,279 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 263 [2022-01-19 06:23:08,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 140 transitions, 434 flow. Second operand has 41 states, 41 states have (on average 137.0) internal successors, (5617), 41 states have internal predecessors, (5617), 0 states have call successors, (0), 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:08,286 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:23:08,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 263 [2022-01-19 06:23:08,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:23:08,705 INFO L129 PetriNetUnfolder]: 12/184 cut-off events. [2022-01-19 06:23:08,706 INFO L130 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-01-19 06:23:08,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 184 events. 12/184 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 334 event pairs, 0 based on Foata normal form. 1/181 useless extension candidates. Maximal degree in co-relation 385. Up to 27 conditions per place. [2022-01-19 06:23:08,706 INFO L132 encePairwiseOnDemand]: 245/263 looper letters, 0 selfloop transitions, 0 changer transitions 138/138 dead transitions. [2022-01-19 06:23:08,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 138 transitions, 582 flow [2022-01-19 06:23:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 06:23:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 06:23:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2461 transitions. [2022-01-19 06:23:08,708 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5198563582594001 [2022-01-19 06:23:08,708 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2461 transitions. [2022-01-19 06:23:08,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2461 transitions. [2022-01-19 06:23:08,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:23:08,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2461 transitions. [2022-01-19 06:23:08,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 136.72222222222223) internal successors, (2461), 18 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:23:08,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 263.0) internal successors, (4997), 19 states have internal predecessors, (4997), 0 states have call successors, (0), 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:08,713 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 263.0) internal successors, (4997), 19 states have internal predecessors, (4997), 0 states have call successors, (0), 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:08,713 INFO L186 Difference]: Start difference. First operand has 246 places, 140 transitions, 434 flow. Second operand 18 states and 2461 transitions. [2022-01-19 06:23:08,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 138 transitions, 582 flow [2022-01-19 06:23:08,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 138 transitions, 541 flow, removed 0 selfloop flow, removed 15 redundant places. [2022-01-19 06:23:08,715 INFO L242 Difference]: Finished difference. Result has 177 places, 0 transitions, 0 flow [2022-01-19 06:23:08,715 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=0, PETRI_PLACES=177, PETRI_TRANSITIONS=0} [2022-01-19 06:23:08,716 INFO L334 CegarLoopForPetriNet]: 227 programPoint places, -50 predicate places. [2022-01-19 06:23:08,716 INFO L470 AbstractCegarLoop]: Abstraction has has 177 places, 0 transitions, 0 flow [2022-01-19 06:23:08,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 137.0) internal successors, (5617), 41 states have internal predecessors, (5617), 0 states have call successors, (0), 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:08,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 06:23:08,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-19 06:23:08,716 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-19 06:23:08,717 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-19 06:23:08,733 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:08,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:23:08,933 INFO L732 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:23:08,934 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2022-01-19 06:23:08,934 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:23:08,935 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:23:08,935 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:23:08,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 263 transitions, 544 flow [2022-01-19 06:23:08,957 INFO L129 PetriNetUnfolder]: 71/432 cut-off events. [2022-01-19 06:23:08,957 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-01-19 06:23:08,959 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:23:08,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 263 transitions, 544 flow [2022-01-19 06:23:08,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 263 transitions, 544 flow [2022-01-19 06:23:08,974 INFO L129 PetriNetUnfolder]: 43/311 cut-off events. [2022-01-19 06:23:08,974 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 06:23:08,974 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:23:08,974 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:23:08,974 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:23:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:23:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2052762263, now seen corresponding path program 1 times [2022-01-19 06:23:08,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:23:08,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267510173] [2022-01-19 06:23:08,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:23:08,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:23:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:23:08,985 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 06:23:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:23:09,002 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 06:23:09,002 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 06:23:09,002 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:23:09,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 06:23:09,002 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 06:23:09,002 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 06:23:09,002 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 06:23:09,003 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-01-19 06:23:09,013 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:23:09,013 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:23:09,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,013 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:23:09,014 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:23:09,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,015 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,016 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,016 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,018 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,019 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 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:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 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:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 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:23:09,020 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:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,020 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,021 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:23:09,021 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:23:09,021 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:23:09,021 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:23:09,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,021 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:23:09,021 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:23:09,021 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:23:09,021 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:23:09,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,021 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 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:23:09,022 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:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 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:23:09,022 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:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,022 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,023 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 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:23:09,024 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,024 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:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 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:23:09,025 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:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 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:23:09,025 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:23:09,025 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:23:09,025 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:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,025 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,026 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,026 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:23:09,026 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:23:09,026 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:23:09,026 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:23:09,026 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,026 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,026 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,026 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,027 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:23:09,027 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:23:09,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,027 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 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:23:09,028 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:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,028 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,029 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 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:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 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:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,030 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 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:23:09,031 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:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 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:23:09,031 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:23:09,031 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:23:09,031 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:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,031 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:23:09,032 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:23:09,032 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:23:09,032 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:23:09,032 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,032 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,032 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,032 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,032 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:23:09,032 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,032 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,032 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,032 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:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 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:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,034 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:23:09,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 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:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 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:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,035 WARN L322 ript$VariableManager]: TermVariabe |t_funThread3of3ForFork0_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:23:09,036 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 06:23:09,037 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:23:09,038 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:23:09,038 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 06:23:09,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 276 places, 323 transitions, 676 flow [2022-01-19 06:23:09,084 INFO L129 PetriNetUnfolder]: 105/622 cut-off events. [2022-01-19 06:23:09,084 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-01-19 06:23:09,090 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:23:09,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 323 transitions, 676 flow [2022-01-19 06:23:09,094 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 323 transitions, 676 flow [2022-01-19 06:23:09,099 INFO L129 PetriNetUnfolder]: 15/163 cut-off events. [2022-01-19 06:23:09,099 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:23:09,099 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:23:09,099 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:23:09,099 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:23:09,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:23:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash 645618892, now seen corresponding path program 1 times [2022-01-19 06:23:09,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:23:09,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34745851] [2022-01-19 06:23:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:23:09,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:23:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:23:09,117 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:23:09,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:23:09,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34745851] [2022-01-19 06:23:09,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34745851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:23:09,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:23:09,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:23:09,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048278391] [2022-01-19 06:23:09,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:23:09,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:23:09,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:23:09,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:23:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:23:09,118 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 323 [2022-01-19 06:23:09,119 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:23:09,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:23:09,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 323 [2022-01-19 06:23:09,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:23:09,170 INFO L129 PetriNetUnfolder]: 14/481 cut-off events. [2022-01-19 06:23:09,170 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-01-19 06:23:09,173 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:23:09,175 INFO L132 encePairwiseOnDemand]: 274/323 looper letters, 15 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2022-01-19 06:23:09,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 277 transitions, 618 flow [2022-01-19 06:23:09,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:23:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:23:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2022-01-19 06:23:09,176 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8833849329205367 [2022-01-19 06:23:09,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 856 transitions. [2022-01-19 06:23:09,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 856 transitions. [2022-01-19 06:23:09,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:23:09,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 856 transitions. [2022-01-19 06:23:09,177 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:23:09,178 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:23:09,178 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:23:09,178 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:23:09,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 277 transitions, 618 flow [2022-01-19 06:23:09,180 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:23:09,182 INFO L242 Difference]: Finished difference. Result has 275 places, 274 transitions, 588 flow [2022-01-19 06:23:09,182 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:23:09,182 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, -1 predicate places. [2022-01-19 06:23:09,182 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 588 flow [2022-01-19 06:23:09,182 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:23:09,182 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:23:09,183 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:23:09,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 06:23:09,183 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:23:09,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:23:09,183 INFO L85 PathProgramCache]: Analyzing trace with hash -245225620, now seen corresponding path program 1 times [2022-01-19 06:23:09,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:23:09,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710386773] [2022-01-19 06:23:09,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:23:09,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:23:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:23:09,330 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:23:09,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:23:09,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710386773] [2022-01-19 06:23:09,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710386773] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:23:09,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:23:09,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 06:23:09,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320060665] [2022-01-19 06:23:09,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:23:09,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 06:23:09,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:23:09,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 06:23:09,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-19 06:23:09,333 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 323 [2022-01-19 06:23:09,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 588 flow. Second operand has 12 states, 12 states have (on average 175.66666666666666) internal successors, (2108), 12 states have internal predecessors, (2108), 0 states have call successors, (0), 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:09,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:23:09,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 323 [2022-01-19 06:23:09,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:24:06,200 INFO L129 PetriNetUnfolder]: 318887/621891 cut-off events. [2022-01-19 06:24:06,200 INFO L130 PetriNetUnfolder]: For 7924/7924 co-relation queries the response was YES. [2022-01-19 06:24:08,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1059153 conditions, 621891 events. 318887/621891 cut-off events. For 7924/7924 co-relation queries the response was YES. Maximal size of possible extension queue 20258. Compared 8725900 event pairs, 72598 based on Foata normal form. 0/606931 useless extension candidates. Maximal degree in co-relation 1059034. Up to 203800 conditions per place. [2022-01-19 06:24:10,803 INFO L132 encePairwiseOnDemand]: 306/323 looper letters, 718 selfloop transitions, 59 changer transitions 0/950 dead transitions. [2022-01-19 06:24:10,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 950 transitions, 3658 flow [2022-01-19 06:24:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:24:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:24:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5081 transitions. [2022-01-19 06:24:10,807 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6292260061919505 [2022-01-19 06:24:10,807 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5081 transitions. [2022-01-19 06:24:10,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5081 transitions. [2022-01-19 06:24:10,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:24:10,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5081 transitions. [2022-01-19 06:24:10,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 203.24) internal successors, (5081), 25 states have internal predecessors, (5081), 0 states have call successors, (0), 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,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 323.0) internal successors, (8398), 26 states have internal predecessors, (8398), 0 states have call successors, (0), 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,816 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 323.0) internal successors, (8398), 26 states have internal predecessors, (8398), 0 states have call successors, (0), 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,816 INFO L186 Difference]: Start difference. First operand has 275 places, 274 transitions, 588 flow. Second operand 25 states and 5081 transitions. [2022-01-19 06:24:10,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 950 transitions, 3658 flow [2022-01-19 06:24:10,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 950 transitions, 3656 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:24:10,828 INFO L242 Difference]: Finished difference. Result has 312 places, 335 transitions, 1010 flow [2022-01-19 06:24:10,828 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=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1010, PETRI_PLACES=312, PETRI_TRANSITIONS=335} [2022-01-19 06:24:10,828 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 36 predicate places. [2022-01-19 06:24:10,828 INFO L470 AbstractCegarLoop]: Abstraction has has 312 places, 335 transitions, 1010 flow [2022-01-19 06:24:10,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 175.66666666666666) internal successors, (2108), 12 states have internal predecessors, (2108), 0 states have call successors, (0), 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,829 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:24:10,829 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:24:10,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 06:24:10,829 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:24:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:24:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash -367962712, now seen corresponding path program 1 times [2022-01-19 06:24:10,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:24:10,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429669167] [2022-01-19 06:24:10,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:10,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:24:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:10,985 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:24:10,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:24:10,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429669167] [2022-01-19 06:24:10,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429669167] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:24:10,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741406984] [2022-01-19 06:24:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:10,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:10,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:24:10,987 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:24:10,988 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:24:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:11,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:24:11,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:24:11,161 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:24:11,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:24:11,240 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:24:11,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741406984] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:24:11,241 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:24:11,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:24:11,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192468297] [2022-01-19 06:24:11,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:24:11,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:24:11,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:24:11,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:24:11,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:24:11,243 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 323 [2022-01-19 06:24:11,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 335 transitions, 1010 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:24:11,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:24:11,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 323 [2022-01-19 06:24:11,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:24:11,753 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_24| 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_24|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_24|} AuxVars[] AssignedVars[][304], [288#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), 349#true, 81#L1037-5true, Black: 289#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 319#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), 4#L1013-8true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 325#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 331#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), t_funThread3of3ForFork0NotInUse, Black: 305#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 311#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 297#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 303#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 287#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|))]) [2022-01-19 06:24:11,753 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-01-19 06:24:11,753 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-01-19 06:24:11,754 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-01-19 06:24:11,754 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-01-19 06:24:11,762 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_26| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_26|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_26|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][306], [288#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), 349#true, 81#L1037-5true, Black: 289#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 319#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 299#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), t_funThread1of3ForFork0InUse, 4#L1013-8true, Black: 325#(and (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), t_funThread2of3ForFork0NotInUse, Black: 321#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), t_funThread3of3ForFork0NotInUse, Black: 331#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 305#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 311#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 297#(and (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 317#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 303#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1| 0)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 301#(and (= |t_funThread1of3ForFork0_#t~mem12#1| 0) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| |~#A~0.base|)) (not (= |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1| 0)) (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (= (select |#valid| 4) 1) (= (select (select |#memory_int| |~#A~0.base|) |~#A~0.offset|) 0) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|)), Black: 281#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 287#(and (= |~#__global_lock~0.offset| 0) (not (<= (+ 5 |~#__global_lock~0.offset|) |~#A~0.base|)) (<= (+ 4 |~#__global_lock~0.offset|) |~#A~0.base|))]) [2022-01-19 06:24:11,762 INFO L384 tUnfolder$Statistics]: this new event has 181 ancestors and is not cut-off event [2022-01-19 06:24:11,762 INFO L387 tUnfolder$Statistics]: existing Event has 181 ancestors and is not cut-off event [2022-01-19 06:24:11,762 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is not cut-off event [2022-01-19 06:24:11,762 INFO L387 tUnfolder$Statistics]: existing Event has 189 ancestors and is not cut-off event [2022-01-19 06:24:11,789 INFO L129 PetriNetUnfolder]: 550/4235 cut-off events. [2022-01-19 06:24:11,789 INFO L130 PetriNetUnfolder]: For 7312/7885 co-relation queries the response was YES. [2022-01-19 06:24:11,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8508 conditions, 4235 events. 550/4235 cut-off events. For 7312/7885 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 42469 event pairs, 129 based on Foata normal form. 36/4051 useless extension candidates. Maximal degree in co-relation 8342. Up to 485 conditions per place. [2022-01-19 06:24:11,842 INFO L132 encePairwiseOnDemand]: 317/323 looper letters, 16 selfloop transitions, 9 changer transitions 0/345 dead transitions. [2022-01-19 06:24:11,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 345 transitions, 1082 flow [2022-01-19 06:24:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:24:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:24:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2358 transitions. [2022-01-19 06:24:11,844 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8111455108359134 [2022-01-19 06:24:11,844 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2358 transitions. [2022-01-19 06:24:11,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2358 transitions. [2022-01-19 06:24:11,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:24:11,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2358 transitions. [2022-01-19 06:24:11,846 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:24:11,847 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:24:11,848 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:24:11,848 INFO L186 Difference]: Start difference. First operand has 312 places, 335 transitions, 1010 flow. Second operand 9 states and 2358 transitions. [2022-01-19 06:24:11,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 345 transitions, 1082 flow [2022-01-19 06:24:11,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 345 transitions, 1079 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:24:11,866 INFO L242 Difference]: Finished difference. Result has 321 places, 341 transitions, 1057 flow [2022-01-19 06:24:11,866 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:24:11,866 INFO L334 CegarLoopForPetriNet]: 276 programPoint places, 45 predicate places. [2022-01-19 06:24:11,866 INFO L470 AbstractCegarLoop]: Abstraction has has 321 places, 341 transitions, 1057 flow [2022-01-19 06:24:11,867 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:24:11,867 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:24:11,867 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:24:11,884 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:12,082 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:12,082 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:24:12,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:24:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash -550974725, now seen corresponding path program 1 times [2022-01-19 06:24:12,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:24:12,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585648728] [2022-01-19 06:24:12,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:12,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:24:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:12,234 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:12,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:24:12,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585648728] [2022-01-19 06:24:12,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585648728] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:24:12,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133145131] [2022-01-19 06:24:12,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:24:12,235 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:24:12,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:24:12,236 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:12,236 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:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:24:12,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 06:24:12,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:24:12,529 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:24:12,529 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:12,560 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:12,608 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:12,648 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:12,668 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:12,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:24:12,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_977 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_977) |c_~#A~0.base|) |c_~#A~0.offset|) 0)) is different from false [2022-01-19 06:24:12,933 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:12,946 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:24:12,947 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:12,958 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:12,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133145131] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:24:12,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:24:12,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 22 [2022-01-19 06:24:12,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601681508] [2022-01-19 06:24:12,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:24:12,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 06:24:12,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:24:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 06:24:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=343, Unknown=1, NotChecked=38, Total=462 [2022-01-19 06:24:12,961 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 323 [2022-01-19 06:24:12,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 341 transitions, 1057 flow. Second operand has 22 states, 22 states have (on average 177.22727272727272) internal successors, (3899), 22 states have internal predecessors, (3899), 0 states have call successors, (0), 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:12,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:24:12,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 323 [2022-01-19 06:24:12,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand