/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-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 10:19:53,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 10:19:53,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 10:19:53,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 10:19:53,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 10:19:53,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 10:19:53,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 10:19:53,773 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 10:19:53,775 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 10:19:53,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 10:19:53,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 10:19:53,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 10:19:53,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 10:19:53,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 10:19:53,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 10:19:53,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 10:19:53,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 10:19:53,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 10:19:53,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 10:19:53,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 10:19:53,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 10:19:53,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 10:19:53,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 10:19:53,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 10:19:53,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 10:19:53,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 10:19:53,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 10:19:53,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 10:19:53,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 10:19:53,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 10:19:53,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 10:19:53,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 10:19:53,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 10:19:53,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 10:19:53,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 10:19:53,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 10:19:53,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 10:19:53,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 10:19:53,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 10:19:53,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 10:19:53,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 10:19:53,801 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-After.epf [2022-01-19 10:19:53,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 10:19:53,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 10:19:53,820 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 10:19:53,820 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 10:19:53,820 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 10:19:53,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 10:19:53,821 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 10:19:53,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 10:19:53,821 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 10:19:53,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 10:19:53,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 10:19:53,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 10:19:53,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 10:19:53,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 10:19:53,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 10:19:53,822 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 10:19:53,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 10:19:53,823 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 10:19:53,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 10:19:53,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 10:19:53,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 10:19:53,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 10:19:53,824 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 10:19:53,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:19:53,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 10:19:53,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 10:19:53,824 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 10:19:53,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 10:19:53,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 10:19:53,825 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 10:19:53,825 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 10:19:53,825 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 10:19:53,825 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 10:19:54,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 10:19:54,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 10:19:54,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 10:19:54,027 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 10:19:54,029 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 10:19:54,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2022-01-19 10:19:54,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c013a0c9b/aefeb49bc8b64bcf943d21a324207e4c/FLAG2cc25f9fd [2022-01-19 10:19:54,569 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 10:19:54,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2022-01-19 10:19:54,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c013a0c9b/aefeb49bc8b64bcf943d21a324207e4c/FLAG2cc25f9fd [2022-01-19 10:19:54,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c013a0c9b/aefeb49bc8b64bcf943d21a324207e4c [2022-01-19 10:19:54,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 10:19:54,604 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 10:19:54,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 10:19:54,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 10:19:54,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 10:19:54,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:19:54" (1/1) ... [2022-01-19 10:19:54,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9a02ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:54, skipping insertion in model container [2022-01-19 10:19:54,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 10:19:54" (1/1) ... [2022-01-19 10:19:54,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 10:19:54,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 10:19:55,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2022-01-19 10:19:55,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:19:55,036 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 10:19:55,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2022-01-19 10:19:55,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 10:19:55,157 INFO L208 MainTranslator]: Completed translation [2022-01-19 10:19:55,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55 WrapperNode [2022-01-19 10:19:55,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 10:19:55,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 10:19:55,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 10:19:55,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 10:19:55,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (1/1) ... [2022-01-19 10:19:55,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (1/1) ... [2022-01-19 10:19:55,211 INFO L137 Inliner]: procedures = 277, calls = 40, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 150 [2022-01-19 10:19:55,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 10:19:55,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 10:19:55,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 10:19:55,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 10:19:55,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (1/1) ... [2022-01-19 10:19:55,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (1/1) ... [2022-01-19 10:19:55,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (1/1) ... [2022-01-19 10:19:55,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (1/1) ... [2022-01-19 10:19:55,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (1/1) ... [2022-01-19 10:19:55,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (1/1) ... [2022-01-19 10:19:55,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (1/1) ... [2022-01-19 10:19:55,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 10:19:55,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 10:19:55,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 10:19:55,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 10:19:55,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (1/1) ... [2022-01-19 10:19:55,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 10:19:55,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:19:55,286 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 10:19:55,289 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 10:19:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-01-19 10:19:55,321 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-01-19 10:19:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-01-19 10:19:55,321 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-01-19 10:19:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 10:19:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 10:19:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 10:19:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 10:19:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 10:19:55,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 10:19:55,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 10:19:55,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 10:19:55,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 10:19:55,327 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 10:19:55,464 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 10:19:55,465 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 10:19:55,696 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 10:19:55,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 10:19:55,704 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 10:19:55,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:19:55 BoogieIcfgContainer [2022-01-19 10:19:55,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 10:19:55,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 10:19:55,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 10:19:55,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 10:19:55,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 10:19:54" (1/3) ... [2022-01-19 10:19:55,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9848ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:19:55, skipping insertion in model container [2022-01-19 10:19:55,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 10:19:55" (2/3) ... [2022-01-19 10:19:55,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9848ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 10:19:55, skipping insertion in model container [2022-01-19 10:19:55,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 10:19:55" (3/3) ... [2022-01-19 10:19:55,717 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-01-19 10:19:55,721 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 10:19:55,722 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 10:19:55,722 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 10:19:55,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,790 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,806 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,807 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,808 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,808 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,808 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,808 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,808 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,809 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,809 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,809 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,809 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,809 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,809 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,810 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,810 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,810 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,810 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,810 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,810 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,811 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,811 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,811 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,811 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,811 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,811 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,812 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,812 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,821 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,822 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,822 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,822 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,822 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,822 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,823 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,824 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,824 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,825 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,830 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,830 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,830 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,830 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,830 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,830 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,830 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,831 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,831 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,831 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,831 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,832 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,832 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,833 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,833 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,833 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,833 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,833 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,834 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,834 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,834 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,834 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,834 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,834 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,835 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,835 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,839 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,840 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,850 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,850 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,850 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,851 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,851 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,851 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,851 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,851 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,851 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,852 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,852 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,852 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,852 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,852 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,853 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,853 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,853 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,853 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,853 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,854 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,854 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,854 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,854 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,854 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,854 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,855 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,855 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,855 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,855 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,855 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,855 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,858 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,858 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,858 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,859 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,859 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,859 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,859 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,859 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,859 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,859 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,860 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,860 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,860 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,860 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,860 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,860 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,860 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,865 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,865 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,865 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,866 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,867 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 10:19:55,872 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 10:19:55,935 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 10:19:55,944 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 10:19:55,944 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-19 10:19:55,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 172 transitions, 360 flow [2022-01-19 10:19:56,036 INFO L129 PetriNetUnfolder]: 10/170 cut-off events. [2022-01-19 10:19:56,036 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 10:19:56,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 10/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 417 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 126. Up to 3 conditions per place. [2022-01-19 10:19:56,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 172 transitions, 360 flow [2022-01-19 10:19:56,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 160 transitions, 329 flow [2022-01-19 10:19:56,087 INFO L129 PetriNetUnfolder]: 5/125 cut-off events. [2022-01-19 10:19:56,087 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 10:19:56,087 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:19:56,088 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] [2022-01-19 10:19:56,088 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:19:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:19:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2105074172, now seen corresponding path program 1 times [2022-01-19 10:19:56,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:19:56,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720825132] [2022-01-19 10:19:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:19:56,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:19:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:19:56,452 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 10:19:56,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:19:56,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720825132] [2022-01-19 10:19:56,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720825132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:19:56,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:19:56,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:19:56,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631120187] [2022-01-19 10:19:56,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:19:56,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:19:56,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:19:56,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:19:56,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:19:56,497 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2022-01-19 10:19:56,504 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 160 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:56,504 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:19:56,504 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2022-01-19 10:19:56,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:19:56,688 INFO L129 PetriNetUnfolder]: 88/699 cut-off events. [2022-01-19 10:19:56,688 INFO L130 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-01-19 10:19:56,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 699 events. 88/699 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3097 event pairs, 32 based on Foata normal form. 69/702 useless extension candidates. Maximal degree in co-relation 747. Up to 111 conditions per place. [2022-01-19 10:19:56,698 INFO L132 encePairwiseOnDemand]: 162/172 looper letters, 20 selfloop transitions, 3 changer transitions 0/158 dead transitions. [2022-01-19 10:19:56,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 158 transitions, 377 flow [2022-01-19 10:19:56,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:19:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:19:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2022-01-19 10:19:56,720 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9282945736434108 [2022-01-19 10:19:56,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2022-01-19 10:19:56,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2022-01-19 10:19:56,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:19:56,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2022-01-19 10:19:56,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:56,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:56,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:56,742 INFO L186 Difference]: Start difference. First operand has 157 places, 160 transitions, 329 flow. Second operand 3 states and 479 transitions. [2022-01-19 10:19:56,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 158 transitions, 377 flow [2022-01-19 10:19:56,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 158 transitions, 369 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 10:19:56,749 INFO L242 Difference]: Finished difference. Result has 153 places, 152 transitions, 323 flow [2022-01-19 10:19:56,750 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=323, PETRI_PLACES=153, PETRI_TRANSITIONS=152} [2022-01-19 10:19:56,753 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, -4 predicate places. [2022-01-19 10:19:56,753 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 152 transitions, 323 flow [2022-01-19 10:19:56,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:56,754 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:19:56,754 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] [2022-01-19 10:19:56,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 10:19:56,755 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:19:56,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:19:56,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1103212847, now seen corresponding path program 1 times [2022-01-19 10:19:56,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:19:56,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512497007] [2022-01-19 10:19:56,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:19:56,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:19:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:19:56,964 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 10:19:56,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:19:56,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512497007] [2022-01-19 10:19:56,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512497007] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:19:56,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:19:56,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 10:19:56,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810355897] [2022-01-19 10:19:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:19:56,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 10:19:56,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:19:56,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 10:19:56,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 10:19:56,984 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 172 [2022-01-19 10:19:56,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 152 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:56,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:19:56,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 172 [2022-01-19 10:19:56,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:19:57,195 INFO L129 PetriNetUnfolder]: 34/590 cut-off events. [2022-01-19 10:19:57,195 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-19 10:19:57,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 590 events. 34/590 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2051 event pairs, 11 based on Foata normal form. 0/553 useless extension candidates. Maximal degree in co-relation 411. Up to 45 conditions per place. [2022-01-19 10:19:57,199 INFO L132 encePairwiseOnDemand]: 167/172 looper letters, 16 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2022-01-19 10:19:57,200 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 160 transitions, 384 flow [2022-01-19 10:19:57,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 10:19:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 10:19:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2022-01-19 10:19:57,202 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9142441860465116 [2022-01-19 10:19:57,202 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 629 transitions. [2022-01-19 10:19:57,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 629 transitions. [2022-01-19 10:19:57,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:19:57,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 629 transitions. [2022-01-19 10:19:57,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:57,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:57,207 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:57,207 INFO L186 Difference]: Start difference. First operand has 153 places, 152 transitions, 323 flow. Second operand 4 states and 629 transitions. [2022-01-19 10:19:57,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 160 transitions, 384 flow [2022-01-19 10:19:57,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 160 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 10:19:57,214 INFO L242 Difference]: Finished difference. Result has 157 places, 155 transitions, 348 flow [2022-01-19 10:19:57,215 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=157, PETRI_TRANSITIONS=155} [2022-01-19 10:19:57,215 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 0 predicate places. [2022-01-19 10:19:57,215 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 155 transitions, 348 flow [2022-01-19 10:19:57,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:57,216 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:19:57,216 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 10:19:57,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 10:19:57,217 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:19:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:19:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1628458080, now seen corresponding path program 1 times [2022-01-19 10:19:57,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:19:57,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651078860] [2022-01-19 10:19:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:19:57,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:19:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:19:57,319 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 10:19:57,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:19:57,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651078860] [2022-01-19 10:19:57,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651078860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:19:57,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:19:57,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:19:57,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531530947] [2022-01-19 10:19:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:19:57,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:19:57,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:19:57,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:19:57,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:19:57,322 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 172 [2022-01-19 10:19:57,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 155 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:57,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:19:57,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 172 [2022-01-19 10:19:57,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:19:57,530 INFO L129 PetriNetUnfolder]: 127/1267 cut-off events. [2022-01-19 10:19:57,530 INFO L130 PetriNetUnfolder]: For 90/100 co-relation queries the response was YES. [2022-01-19 10:19:57,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1267 events. 127/1267 cut-off events. For 90/100 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6927 event pairs, 33 based on Foata normal form. 12/1205 useless extension candidates. Maximal degree in co-relation 1334. Up to 135 conditions per place. [2022-01-19 10:19:57,541 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 25 selfloop transitions, 4 changer transitions 0/167 dead transitions. [2022-01-19 10:19:57,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 167 transitions, 439 flow [2022-01-19 10:19:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:19:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:19:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2022-01-19 10:19:57,543 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9186046511627907 [2022-01-19 10:19:57,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 474 transitions. [2022-01-19 10:19:57,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 474 transitions. [2022-01-19 10:19:57,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:19:57,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 474 transitions. [2022-01-19 10:19:57,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:57,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:57,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:57,546 INFO L186 Difference]: Start difference. First operand has 157 places, 155 transitions, 348 flow. Second operand 3 states and 474 transitions. [2022-01-19 10:19:57,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 167 transitions, 439 flow [2022-01-19 10:19:57,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 167 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 10:19:57,553 INFO L242 Difference]: Finished difference. Result has 160 places, 159 transitions, 388 flow [2022-01-19 10:19:57,553 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=160, PETRI_TRANSITIONS=159} [2022-01-19 10:19:57,555 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 3 predicate places. [2022-01-19 10:19:57,556 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 159 transitions, 388 flow [2022-01-19 10:19:57,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:57,556 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:19:57,557 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-19 10:19:57,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 10:19:57,557 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:19:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:19:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash 585023441, now seen corresponding path program 1 times [2022-01-19 10:19:57,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:19:57,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643466072] [2022-01-19 10:19:57,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:19:57,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:19:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:19:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:19:57,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:19:57,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643466072] [2022-01-19 10:19:57,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643466072] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:19:57,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279874431] [2022-01-19 10:19:57,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:19:57,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:19:57,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:19:57,693 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 10:19:57,694 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 10:19:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:19:57,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 10:19:57,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:19:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:19:58,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:19:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:19:58,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279874431] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:19:58,325 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:19:58,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 10:19:58,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130954266] [2022-01-19 10:19:58,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:19:58,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 10:19:58,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:19:58,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 10:19:58,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 10:19:58,331 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 172 [2022-01-19 10:19:58,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 159 transitions, 388 flow. Second operand has 10 states, 10 states have (on average 148.5) internal successors, (1485), 10 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:58,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:19:58,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 172 [2022-01-19 10:19:58,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:19:58,842 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1008-->L1010: Formula: (< 0 v_~top~0_7) InVars {~top~0=v_~top~0_7} OutVars{~top~0=v_~top~0_7} AuxVars[] AssignedVars[][178], [Black: 174#(= ~top~0 0), 72#L1010true, 114#L945-2true, 20#L1022-4true, Black: 182#(and (= |t1Thread1of1ForFork0_push_#res#1| 0) (= |t1Thread1of1ForFork0_#t~ret42#1| 0)), Black: 179#(= |t1Thread1of1ForFork0_push_#res#1| 0), 192#true, t2Thread1of1ForFork1InUse, 188#(<= 1 ~top~0), Black: 186#true]) [2022-01-19 10:19:58,842 INFO L384 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-01-19 10:19:58,843 INFO L387 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-01-19 10:19:58,843 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-01-19 10:19:58,843 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-01-19 10:19:58,843 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([465] L1008-->L1008-1: Formula: (not (< 0 v_~top~0_13)) InVars {~top~0=v_~top~0_13} OutVars{~top~0=v_~top~0_13} AuxVars[] AssignedVars[][179], [Black: 174#(= ~top~0 0), 114#L945-2true, 20#L1022-4true, Black: 182#(and (= |t1Thread1of1ForFork0_push_#res#1| 0) (= |t1Thread1of1ForFork0_#t~ret42#1| 0)), 31#L1008-1true, Black: 179#(= |t1Thread1of1ForFork0_push_#res#1| 0), 186#true, t2Thread1of1ForFork1InUse, 230#(<= ~top~0 0), Black: 188#(<= 1 ~top~0)]) [2022-01-19 10:19:58,843 INFO L384 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-01-19 10:19:58,843 INFO L387 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-01-19 10:19:58,843 INFO L387 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-01-19 10:19:58,843 INFO L387 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-01-19 10:19:58,912 INFO L129 PetriNetUnfolder]: 387/2990 cut-off events. [2022-01-19 10:19:58,913 INFO L130 PetriNetUnfolder]: For 1008/1064 co-relation queries the response was YES. [2022-01-19 10:19:58,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4470 conditions, 2990 events. 387/2990 cut-off events. For 1008/1064 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 21695 event pairs, 43 based on Foata normal form. 40/2871 useless extension candidates. Maximal degree in co-relation 3934. Up to 300 conditions per place. [2022-01-19 10:19:58,934 INFO L132 encePairwiseOnDemand]: 163/172 looper letters, 86 selfloop transitions, 46 changer transitions 1/269 dead transitions. [2022-01-19 10:19:58,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 269 transitions, 1070 flow [2022-01-19 10:19:58,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 10:19:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 10:19:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2759 transitions. [2022-01-19 10:19:58,940 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8911498708010336 [2022-01-19 10:19:58,940 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2759 transitions. [2022-01-19 10:19:58,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2759 transitions. [2022-01-19 10:19:58,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:19:58,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2759 transitions. [2022-01-19 10:19:58,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 153.27777777777777) internal successors, (2759), 18 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:58,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 172.0) internal successors, (3268), 19 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:58,955 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 172.0) internal successors, (3268), 19 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:58,955 INFO L186 Difference]: Start difference. First operand has 160 places, 159 transitions, 388 flow. Second operand 18 states and 2759 transitions. [2022-01-19 10:19:58,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 269 transitions, 1070 flow [2022-01-19 10:19:58,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 269 transitions, 1008 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-01-19 10:19:58,965 INFO L242 Difference]: Finished difference. Result has 181 places, 214 transitions, 759 flow [2022-01-19 10:19:58,965 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=759, PETRI_PLACES=181, PETRI_TRANSITIONS=214} [2022-01-19 10:19:58,966 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 24 predicate places. [2022-01-19 10:19:58,966 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 214 transitions, 759 flow [2022-01-19 10:19:58,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 148.5) internal successors, (1485), 10 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:58,966 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:19:58,967 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 10:19:58,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 10:19:59,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:19:59,188 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:19:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:19:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash -240965741, now seen corresponding path program 1 times [2022-01-19 10:19:59,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:19:59,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642848764] [2022-01-19 10:19:59,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:19:59,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:19:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:19:59,275 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 10:19:59,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:19:59,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642848764] [2022-01-19 10:19:59,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642848764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:19:59,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:19:59,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 10:19:59,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65199133] [2022-01-19 10:19:59,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:19:59,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 10:19:59,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:19:59,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 10:19:59,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 10:19:59,278 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 172 [2022-01-19 10:19:59,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 214 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:59,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:19:59,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 172 [2022-01-19 10:19:59,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:19:59,417 INFO L129 PetriNetUnfolder]: 54/1107 cut-off events. [2022-01-19 10:19:59,417 INFO L130 PetriNetUnfolder]: For 239/239 co-relation queries the response was YES. [2022-01-19 10:19:59,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 1107 events. 54/1107 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4892 event pairs, 9 based on Foata normal form. 18/1082 useless extension candidates. Maximal degree in co-relation 1132. Up to 51 conditions per place. [2022-01-19 10:19:59,423 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 12 selfloop transitions, 4 changer transitions 0/173 dead transitions. [2022-01-19 10:19:59,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 173 transitions, 536 flow [2022-01-19 10:19:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 10:19:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 10:19:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2022-01-19 10:19:59,425 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9069767441860465 [2022-01-19 10:19:59,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2022-01-19 10:19:59,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2022-01-19 10:19:59,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:19:59,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2022-01-19 10:19:59,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:59,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:59,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:59,428 INFO L186 Difference]: Start difference. First operand has 181 places, 214 transitions, 759 flow. Second operand 3 states and 468 transitions. [2022-01-19 10:19:59,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 173 transitions, 536 flow [2022-01-19 10:19:59,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 173 transitions, 514 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-01-19 10:19:59,433 INFO L242 Difference]: Finished difference. Result has 171 places, 171 transitions, 483 flow [2022-01-19 10:19:59,434 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=171, PETRI_TRANSITIONS=171} [2022-01-19 10:19:59,434 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 14 predicate places. [2022-01-19 10:19:59,434 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 171 transitions, 483 flow [2022-01-19 10:19:59,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:19:59,435 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:19:59,435 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 10:19:59,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 10:19:59,435 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:19:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:19:59,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1993733317, now seen corresponding path program 1 times [2022-01-19 10:19:59,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:19:59,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399900469] [2022-01-19 10:19:59,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:19:59,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:19:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:20:00,207 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 10:20:00,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:20:00,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399900469] [2022-01-19 10:20:00,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399900469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:20:00,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:20:00,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-19 10:20:00,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194393035] [2022-01-19 10:20:00,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:20:00,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 10:20:00,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:20:00,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 10:20:00,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-01-19 10:20:00,213 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 172 [2022-01-19 10:20:00,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 171 transitions, 483 flow. Second operand has 25 states, 25 states have (on average 99.28) internal successors, (2482), 25 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:00,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:20:00,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 172 [2022-01-19 10:20:00,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:20:02,414 INFO L129 PetriNetUnfolder]: 1109/4447 cut-off events. [2022-01-19 10:20:02,415 INFO L130 PetriNetUnfolder]: For 789/789 co-relation queries the response was YES. [2022-01-19 10:20:02,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8360 conditions, 4447 events. 1109/4447 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 33380 event pairs, 163 based on Foata normal form. 0/4295 useless extension candidates. Maximal degree in co-relation 4749. Up to 1468 conditions per place. [2022-01-19 10:20:02,448 INFO L132 encePairwiseOnDemand]: 138/172 looper letters, 254 selfloop transitions, 42 changer transitions 2/384 dead transitions. [2022-01-19 10:20:02,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 384 transitions, 1688 flow [2022-01-19 10:20:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 10:20:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 10:20:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3271 transitions. [2022-01-19 10:20:02,456 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6134658664666166 [2022-01-19 10:20:02,456 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 3271 transitions. [2022-01-19 10:20:02,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 3271 transitions. [2022-01-19 10:20:02,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:20:02,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 3271 transitions. [2022-01-19 10:20:02,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 105.51612903225806) internal successors, (3271), 31 states have internal predecessors, (3271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:02,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 172.0) internal successors, (5504), 32 states have internal predecessors, (5504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:02,477 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 172.0) internal successors, (5504), 32 states have internal predecessors, (5504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:02,477 INFO L186 Difference]: Start difference. First operand has 171 places, 171 transitions, 483 flow. Second operand 31 states and 3271 transitions. [2022-01-19 10:20:02,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 384 transitions, 1688 flow [2022-01-19 10:20:02,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 384 transitions, 1684 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 10:20:02,488 INFO L242 Difference]: Finished difference. Result has 227 places, 209 transitions, 797 flow [2022-01-19 10:20:02,489 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=797, PETRI_PLACES=227, PETRI_TRANSITIONS=209} [2022-01-19 10:20:02,490 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 70 predicate places. [2022-01-19 10:20:02,490 INFO L470 AbstractCegarLoop]: Abstraction has has 227 places, 209 transitions, 797 flow [2022-01-19 10:20:02,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 99.28) internal successors, (2482), 25 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:02,492 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:20:02,492 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 10:20:02,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 10:20:02,495 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:20:02,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:20:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash -701995727, now seen corresponding path program 2 times [2022-01-19 10:20:02,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:20:02,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89284726] [2022-01-19 10:20:02,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:20:02,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:20:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:20:03,331 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 10:20:03,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:20:03,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89284726] [2022-01-19 10:20:03,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89284726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:20:03,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:20:03,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-19 10:20:03,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385271641] [2022-01-19 10:20:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:20:03,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 10:20:03,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:20:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 10:20:03,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2022-01-19 10:20:03,335 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 172 [2022-01-19 10:20:03,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 209 transitions, 797 flow. Second operand has 28 states, 28 states have (on average 86.39285714285714) internal successors, (2419), 28 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:03,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:20:03,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 172 [2022-01-19 10:20:03,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:20:06,041 INFO L129 PetriNetUnfolder]: 1483/6008 cut-off events. [2022-01-19 10:20:06,041 INFO L130 PetriNetUnfolder]: For 2902/2902 co-relation queries the response was YES. [2022-01-19 10:20:06,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13045 conditions, 6008 events. 1483/6008 cut-off events. For 2902/2902 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 49070 event pairs, 304 based on Foata normal form. 4/5900 useless extension candidates. Maximal degree in co-relation 7853. Up to 1499 conditions per place. [2022-01-19 10:20:06,101 INFO L132 encePairwiseOnDemand]: 136/172 looper letters, 264 selfloop transitions, 61 changer transitions 2/403 dead transitions. [2022-01-19 10:20:06,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 403 transitions, 2213 flow [2022-01-19 10:20:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-19 10:20:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-01-19 10:20:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3126 transitions. [2022-01-19 10:20:06,108 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5345417236662107 [2022-01-19 10:20:06,109 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3126 transitions. [2022-01-19 10:20:06,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3126 transitions. [2022-01-19 10:20:06,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:20:06,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3126 transitions. [2022-01-19 10:20:06,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 91.94117647058823) internal successors, (3126), 34 states have internal predecessors, (3126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:06,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 172.0) internal successors, (6020), 35 states have internal predecessors, (6020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:06,127 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 172.0) internal successors, (6020), 35 states have internal predecessors, (6020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:06,127 INFO L186 Difference]: Start difference. First operand has 227 places, 209 transitions, 797 flow. Second operand 34 states and 3126 transitions. [2022-01-19 10:20:06,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 403 transitions, 2213 flow [2022-01-19 10:20:06,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 403 transitions, 2209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 10:20:06,144 INFO L242 Difference]: Finished difference. Result has 273 places, 228 transitions, 1117 flow [2022-01-19 10:20:06,145 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1117, PETRI_PLACES=273, PETRI_TRANSITIONS=228} [2022-01-19 10:20:06,146 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 116 predicate places. [2022-01-19 10:20:06,146 INFO L470 AbstractCegarLoop]: Abstraction has has 273 places, 228 transitions, 1117 flow [2022-01-19 10:20:06,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 86.39285714285714) internal successors, (2419), 28 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:06,147 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:20:06,147 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 10:20:06,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 10:20:06,147 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:20:06,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:20:06,148 INFO L85 PathProgramCache]: Analyzing trace with hash -23337595, now seen corresponding path program 3 times [2022-01-19 10:20:06,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:20:06,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509103926] [2022-01-19 10:20:06,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:20:06,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:20:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:20:06,881 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 10:20:06,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:20:06,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509103926] [2022-01-19 10:20:06,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509103926] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:20:06,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 10:20:06,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-01-19 10:20:06,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552807974] [2022-01-19 10:20:06,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:20:06,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 10:20:06,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:20:06,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 10:20:06,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2022-01-19 10:20:06,886 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 172 [2022-01-19 10:20:06,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 228 transitions, 1117 flow. Second operand has 28 states, 28 states have (on average 86.39285714285714) internal successors, (2419), 28 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:06,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:20:06,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 172 [2022-01-19 10:20:06,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:20:10,020 INFO L129 PetriNetUnfolder]: 1881/7642 cut-off events. [2022-01-19 10:20:10,021 INFO L130 PetriNetUnfolder]: For 4951/4954 co-relation queries the response was YES. [2022-01-19 10:20:10,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17450 conditions, 7642 events. 1881/7642 cut-off events. For 4951/4954 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 67252 event pairs, 174 based on Foata normal form. 5/7496 useless extension candidates. Maximal degree in co-relation 10823. Up to 1429 conditions per place. [2022-01-19 10:20:10,088 INFO L132 encePairwiseOnDemand]: 135/172 looper letters, 284 selfloop transitions, 81 changer transitions 3/444 dead transitions. [2022-01-19 10:20:10,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 444 transitions, 2751 flow [2022-01-19 10:20:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-19 10:20:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-01-19 10:20:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3232 transitions. [2022-01-19 10:20:10,096 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5368770764119601 [2022-01-19 10:20:10,096 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3232 transitions. [2022-01-19 10:20:10,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3232 transitions. [2022-01-19 10:20:10,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:20:10,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3232 transitions. [2022-01-19 10:20:10,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 92.34285714285714) internal successors, (3232), 35 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:10,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 172.0) internal successors, (6192), 36 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:10,113 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 172.0) internal successors, (6192), 36 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:10,113 INFO L186 Difference]: Start difference. First operand has 273 places, 228 transitions, 1117 flow. Second operand 35 states and 3232 transitions. [2022-01-19 10:20:10,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 444 transitions, 2751 flow [2022-01-19 10:20:10,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 444 transitions, 2656 flow, removed 28 selfloop flow, removed 14 redundant places. [2022-01-19 10:20:10,139 INFO L242 Difference]: Finished difference. Result has 308 places, 249 transitions, 1482 flow [2022-01-19 10:20:10,139 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1482, PETRI_PLACES=308, PETRI_TRANSITIONS=249} [2022-01-19 10:20:10,140 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 151 predicate places. [2022-01-19 10:20:10,140 INFO L470 AbstractCegarLoop]: Abstraction has has 308 places, 249 transitions, 1482 flow [2022-01-19 10:20:10,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 86.39285714285714) internal successors, (2419), 28 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:10,141 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:20:10,141 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-01-19 10:20:10,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 10:20:10,142 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:20:10,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:20:10,142 INFO L85 PathProgramCache]: Analyzing trace with hash 93237923, now seen corresponding path program 1 times [2022-01-19 10:20:10,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:20:10,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800752596] [2022-01-19 10:20:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:20:10,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:20:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:20:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:20:10,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:20:10,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800752596] [2022-01-19 10:20:10,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800752596] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:20:10,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639988770] [2022-01-19 10:20:10,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:20:10,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:20:10,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:20:10,224 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 10:20:10,225 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 10:20:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:20:10,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 10:20:10,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:20:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 10:20:10,605 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 10:20:10,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639988770] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 10:20:10,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 10:20:10,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2022-01-19 10:20:10,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964260733] [2022-01-19 10:20:10,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:20:10,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 10:20:10,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:20:10,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 10:20:10,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-19 10:20:10,607 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 172 [2022-01-19 10:20:10,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 249 transitions, 1482 flow. Second operand has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:10,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:20:10,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 172 [2022-01-19 10:20:10,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:20:11,221 INFO L129 PetriNetUnfolder]: 256/3426 cut-off events. [2022-01-19 10:20:11,221 INFO L130 PetriNetUnfolder]: For 3005/3009 co-relation queries the response was YES. [2022-01-19 10:20:11,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6900 conditions, 3426 events. 256/3426 cut-off events. For 3005/3009 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 25160 event pairs, 67 based on Foata normal form. 14/3364 useless extension candidates. Maximal degree in co-relation 5089. Up to 261 conditions per place. [2022-01-19 10:20:11,250 INFO L132 encePairwiseOnDemand]: 162/172 looper letters, 52 selfloop transitions, 33 changer transitions 0/271 dead transitions. [2022-01-19 10:20:11,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 271 transitions, 1710 flow [2022-01-19 10:20:11,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 10:20:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 10:20:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1202 transitions. [2022-01-19 10:20:11,252 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.873546511627907 [2022-01-19 10:20:11,252 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1202 transitions. [2022-01-19 10:20:11,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1202 transitions. [2022-01-19 10:20:11,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:20:11,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1202 transitions. [2022-01-19 10:20:11,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.25) internal successors, (1202), 8 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:11,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:11,256 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:11,256 INFO L186 Difference]: Start difference. First operand has 308 places, 249 transitions, 1482 flow. Second operand 8 states and 1202 transitions. [2022-01-19 10:20:11,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 271 transitions, 1710 flow [2022-01-19 10:20:11,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 271 transitions, 1596 flow, removed 35 selfloop flow, removed 18 redundant places. [2022-01-19 10:20:11,360 INFO L242 Difference]: Finished difference. Result has 302 places, 252 transitions, 1499 flow [2022-01-19 10:20:11,361 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1499, PETRI_PLACES=302, PETRI_TRANSITIONS=252} [2022-01-19 10:20:11,362 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 145 predicate places. [2022-01-19 10:20:11,362 INFO L470 AbstractCegarLoop]: Abstraction has has 302 places, 252 transitions, 1499 flow [2022-01-19 10:20:11,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:11,363 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:20:11,363 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-19 10:20:11,391 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 10:20:11,579 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,SelfDestructingSolverStorable8 [2022-01-19 10:20:11,579 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:20:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:20:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1396302866, now seen corresponding path program 1 times [2022-01-19 10:20:11,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:20:11,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958329486] [2022-01-19 10:20:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:20:11,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:20:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:20:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 10:20:12,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:20:12,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958329486] [2022-01-19 10:20:12,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958329486] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:20:12,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116502845] [2022-01-19 10:20:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:20:12,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:20:12,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:20:12,128 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 10:20:12,128 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 10:20:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:20:12,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 10:20:12,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:20:13,587 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 19 treesize of output 15 [2022-01-19 10:20:14,588 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 43 treesize of output 23 [2022-01-19 10:20:14,794 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:20:14,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:20:15,357 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 54 treesize of output 46 [2022-01-19 10:20:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 10:20:16,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116502845] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 10:20:16,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 10:20:16,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [23, 26] total 66 [2022-01-19 10:20:16,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184567591] [2022-01-19 10:20:16,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 10:20:16,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 10:20:16,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:20:16,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 10:20:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4050, Unknown=0, NotChecked=0, Total=4290 [2022-01-19 10:20:16,026 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 172 [2022-01-19 10:20:16,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 252 transitions, 1499 flow. Second operand has 22 states, 22 states have (on average 100.45454545454545) internal successors, (2210), 22 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:16,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:20:16,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 172 [2022-01-19 10:20:16,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:20:22,416 INFO L129 PetriNetUnfolder]: 2699/11060 cut-off events. [2022-01-19 10:20:22,416 INFO L130 PetriNetUnfolder]: For 9643/9646 co-relation queries the response was YES. [2022-01-19 10:20:22,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25567 conditions, 11060 events. 2699/11060 cut-off events. For 9643/9646 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 102693 event pairs, 422 based on Foata normal form. 13/10836 useless extension candidates. Maximal degree in co-relation 23111. Up to 1478 conditions per place. [2022-01-19 10:20:22,504 INFO L132 encePairwiseOnDemand]: 137/172 looper letters, 280 selfloop transitions, 186 changer transitions 3/555 dead transitions. [2022-01-19 10:20:22,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 555 transitions, 3899 flow [2022-01-19 10:20:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-19 10:20:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2022-01-19 10:20:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 6727 transitions. [2022-01-19 10:20:22,513 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5925828047921071 [2022-01-19 10:20:22,513 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 6727 transitions. [2022-01-19 10:20:22,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 6727 transitions. [2022-01-19 10:20:22,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:20:22,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 6727 transitions. [2022-01-19 10:20:22,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 101.92424242424242) internal successors, (6727), 66 states have internal predecessors, (6727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:22,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 172.0) internal successors, (11524), 67 states have internal predecessors, (11524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:22,536 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 172.0) internal successors, (11524), 67 states have internal predecessors, (11524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:22,536 INFO L186 Difference]: Start difference. First operand has 302 places, 252 transitions, 1499 flow. Second operand 66 states and 6727 transitions. [2022-01-19 10:20:22,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 555 transitions, 3899 flow [2022-01-19 10:20:22,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 555 transitions, 3883 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-01-19 10:20:22,588 INFO L242 Difference]: Finished difference. Result has 384 places, 374 transitions, 2885 flow [2022-01-19 10:20:22,589 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=2885, PETRI_PLACES=384, PETRI_TRANSITIONS=374} [2022-01-19 10:20:22,589 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 227 predicate places. [2022-01-19 10:20:22,589 INFO L470 AbstractCegarLoop]: Abstraction has has 384 places, 374 transitions, 2885 flow [2022-01-19 10:20:22,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 100.45454545454545) internal successors, (2210), 22 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:22,590 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:20:22,590 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-19 10:20:22,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-19 10:20:22,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:20:22,803 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:20:22,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:20:22,804 INFO L85 PathProgramCache]: Analyzing trace with hash 135273450, now seen corresponding path program 2 times [2022-01-19 10:20:22,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:20:22,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136780143] [2022-01-19 10:20:22,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:20:22,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:20:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:20:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:20:23,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:20:23,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136780143] [2022-01-19 10:20:23,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136780143] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:20:23,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779023730] [2022-01-19 10:20:23,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 10:20:23,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:20:23,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:20:23,816 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 10:20:23,817 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 10:20:23,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 10:20:23,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:20:23,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 10:20:23,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:20:24,063 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 10:20:24,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 10:20:24,077 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 10:20:24,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 11 treesize of output 11 [2022-01-19 10:20:25,029 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 19 treesize of output 15 [2022-01-19 10:20:25,101 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 58 treesize of output 54 [2022-01-19 10:20:25,915 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 63 treesize of output 23 [2022-01-19 10:20:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 10:20:26,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:20:26,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_303 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_303) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-01-19 10:20:26,905 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:20:26,905 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 29 treesize of output 30 [2022-01-19 10:20:26,941 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:20:26,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 52 [2022-01-19 10:20:26,946 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 28 treesize of output 22 [2022-01-19 10:20:28,050 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 10:20:28,051 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 10:20:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 10:20:28,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779023730] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:20:28,065 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:20:28,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 75 [2022-01-19 10:20:28,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847456443] [2022-01-19 10:20:28,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:20:28,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-01-19 10:20:28,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:20:28,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-01-19 10:20:28,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=5163, Unknown=1, NotChecked=144, Total=5550 [2022-01-19 10:20:28,072 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 172 [2022-01-19 10:20:28,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 374 transitions, 2885 flow. Second operand has 75 states, 75 states have (on average 87.21333333333334) internal successors, (6541), 75 states have internal predecessors, (6541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:20:28,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:20:28,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 172 [2022-01-19 10:20:28,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:21:08,867 INFO L129 PetriNetUnfolder]: 4776/19368 cut-off events. [2022-01-19 10:21:08,867 INFO L130 PetriNetUnfolder]: For 23905/23912 co-relation queries the response was YES. [2022-01-19 10:21:09,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50267 conditions, 19368 events. 4776/19368 cut-off events. For 23905/23912 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 204561 event pairs, 427 based on Foata normal form. 23/19034 useless extension candidates. Maximal degree in co-relation 46187. Up to 2669 conditions per place. [2022-01-19 10:21:09,143 INFO L132 encePairwiseOnDemand]: 129/172 looper letters, 537 selfloop transitions, 509 changer transitions 20/1142 dead transitions. [2022-01-19 10:21:09,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 1142 transitions, 9258 flow [2022-01-19 10:21:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2022-01-19 10:21:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2022-01-19 10:21:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 13950 transitions. [2022-01-19 10:21:09,167 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5133205769796879 [2022-01-19 10:21:09,167 INFO L72 ComplementDD]: Start complementDD. Operand 158 states and 13950 transitions. [2022-01-19 10:21:09,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 13950 transitions. [2022-01-19 10:21:09,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:21:09,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 158 states and 13950 transitions. [2022-01-19 10:21:09,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 159 states, 158 states have (on average 88.29113924050633) internal successors, (13950), 158 states have internal predecessors, (13950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:21:09,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 159 states, 159 states have (on average 172.0) internal successors, (27348), 159 states have internal predecessors, (27348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:21:09,240 INFO L81 ComplementDD]: Finished complementDD. Result has 159 states, 159 states have (on average 172.0) internal successors, (27348), 159 states have internal predecessors, (27348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:21:09,240 INFO L186 Difference]: Start difference. First operand has 384 places, 374 transitions, 2885 flow. Second operand 158 states and 13950 transitions. [2022-01-19 10:21:09,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 1142 transitions, 9258 flow [2022-01-19 10:21:09,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 1142 transitions, 8553 flow, removed 326 selfloop flow, removed 10 redundant places. [2022-01-19 10:21:09,474 INFO L242 Difference]: Finished difference. Result has 573 places, 719 transitions, 6413 flow [2022-01-19 10:21:09,475 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=2568, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=158, PETRI_FLOW=6413, PETRI_PLACES=573, PETRI_TRANSITIONS=719} [2022-01-19 10:21:09,476 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 416 predicate places. [2022-01-19 10:21:09,476 INFO L470 AbstractCegarLoop]: Abstraction has has 573 places, 719 transitions, 6413 flow [2022-01-19 10:21:09,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 87.21333333333334) internal successors, (6541), 75 states have internal predecessors, (6541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:21:09,477 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:21:09,478 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-19 10:21:09,500 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 10:21:09,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:21:09,700 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:21:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:21:09,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1440411600, now seen corresponding path program 3 times [2022-01-19 10:21:09,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:21:09,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462061443] [2022-01-19 10:21:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:21:09,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:21:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:21:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 10:21:10,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:21:10,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462061443] [2022-01-19 10:21:10,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462061443] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:21:10,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463368971] [2022-01-19 10:21:10,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 10:21:10,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:21:10,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:21:10,377 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 10:21:10,378 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 10:21:10,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-01-19 10:21:10,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:21:10,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 10:21:10,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:21:10,606 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 10:21:10,606 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 10:21:10,617 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 10:21:10,617 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 10:21:11,342 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 19 treesize of output 15 [2022-01-19 10:21:11,443 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 58 treesize of output 54 [2022-01-19 10:21:12,152 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 63 treesize of output 23 [2022-01-19 10:21:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 10:21:12,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:21:12,893 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_357 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_357) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-01-19 10:21:12,911 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:21:12,911 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 29 treesize of output 30 [2022-01-19 10:21:12,919 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:21:12,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 52 [2022-01-19 10:21:12,922 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 28 treesize of output 22 [2022-01-19 10:21:13,682 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 10:21:13,682 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 10:21:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 10:21:13,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463368971] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:21:13,693 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:21:13,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 72 [2022-01-19 10:21:13,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971587711] [2022-01-19 10:21:13,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:21:13,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-01-19 10:21:13,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:21:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-01-19 10:21:13,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=4705, Unknown=1, NotChecked=138, Total=5112 [2022-01-19 10:21:13,699 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 172 [2022-01-19 10:21:13,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 719 transitions, 6413 flow. Second operand has 72 states, 72 states have (on average 87.31944444444444) internal successors, (6287), 72 states have internal predecessors, (6287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:21:13,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:21:13,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 172 [2022-01-19 10:21:13,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:21:50,378 INFO L129 PetriNetUnfolder]: 8725/35833 cut-off events. [2022-01-19 10:21:50,378 INFO L130 PetriNetUnfolder]: For 189131/189149 co-relation queries the response was YES. [2022-01-19 10:21:51,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132118 conditions, 35833 events. 8725/35833 cut-off events. For 189131/189149 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 429568 event pairs, 969 based on Foata normal form. 15/35045 useless extension candidates. Maximal degree in co-relation 121340. Up to 4850 conditions per place. [2022-01-19 10:21:51,364 INFO L132 encePairwiseOnDemand]: 131/172 looper letters, 686 selfloop transitions, 1175 changer transitions 5/1942 dead transitions. [2022-01-19 10:21:51,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 1942 transitions, 21893 flow [2022-01-19 10:21:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-01-19 10:21:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2022-01-19 10:21:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 11344 transitions. [2022-01-19 10:21:51,376 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5193188060794727 [2022-01-19 10:21:51,376 INFO L72 ComplementDD]: Start complementDD. Operand 127 states and 11344 transitions. [2022-01-19 10:21:51,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 11344 transitions. [2022-01-19 10:21:51,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:21:51,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 127 states and 11344 transitions. [2022-01-19 10:21:51,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 128 states, 127 states have (on average 89.32283464566929) internal successors, (11344), 127 states have internal predecessors, (11344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:21:51,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 128 states, 128 states have (on average 172.0) internal successors, (22016), 128 states have internal predecessors, (22016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:21:51,417 INFO L81 ComplementDD]: Finished complementDD. Result has 128 states, 128 states have (on average 172.0) internal successors, (22016), 128 states have internal predecessors, (22016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:21:51,417 INFO L186 Difference]: Start difference. First operand has 573 places, 719 transitions, 6413 flow. Second operand 127 states and 11344 transitions. [2022-01-19 10:21:51,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 1942 transitions, 21893 flow [2022-01-19 10:21:52,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 1942 transitions, 21234 flow, removed 253 selfloop flow, removed 29 redundant places. [2022-01-19 10:21:52,387 INFO L242 Difference]: Finished difference. Result has 717 places, 1489 transitions, 17567 flow [2022-01-19 10:21:52,388 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=6111, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=483, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=127, PETRI_FLOW=17567, PETRI_PLACES=717, PETRI_TRANSITIONS=1489} [2022-01-19 10:21:52,389 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 560 predicate places. [2022-01-19 10:21:52,389 INFO L470 AbstractCegarLoop]: Abstraction has has 717 places, 1489 transitions, 17567 flow [2022-01-19 10:21:52,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 87.31944444444444) internal successors, (6287), 72 states have internal predecessors, (6287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:21:52,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:21:52,390 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-19 10:21:52,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-19 10:21:52,603 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 10:21:52,603 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:21:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:21:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash -167689996, now seen corresponding path program 2 times [2022-01-19 10:21:52,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:21:52,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050717905] [2022-01-19 10:21:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:21:52,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:21:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:21:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 10:21:52,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:21:52,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050717905] [2022-01-19 10:21:52,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050717905] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:21:52,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828465847] [2022-01-19 10:21:52,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 10:21:52,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:21:52,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:21:52,692 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 10:21:52,693 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 10:21:52,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 10:21:52,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 10:21:52,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 10:21:52,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:21:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 10:21:53,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:21:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 10:21:53,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828465847] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:21:53,541 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:21:53,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-01-19 10:21:53,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73302165] [2022-01-19 10:21:53,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:21:53,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-19 10:21:53,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:21:53,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-19 10:21:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-01-19 10:21:53,544 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 172 [2022-01-19 10:21:53,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 1489 transitions, 17567 flow. Second operand has 16 states, 16 states have (on average 147.375) internal successors, (2358), 16 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 10:21:53,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:21:53,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 172 [2022-01-19 10:21:53,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:22:00,520 INFO L129 PetriNetUnfolder]: 2200/19988 cut-off events. [2022-01-19 10:22:00,520 INFO L130 PetriNetUnfolder]: For 142902/143038 co-relation queries the response was YES. [2022-01-19 10:22:00,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74581 conditions, 19988 events. 2200/19988 cut-off events. For 142902/143038 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 230839 event pairs, 678 based on Foata normal form. 103/19444 useless extension candidates. Maximal degree in co-relation 71826. Up to 1284 conditions per place. [2022-01-19 10:22:00,981 INFO L132 encePairwiseOnDemand]: 162/172 looper letters, 262 selfloop transitions, 513 changer transitions 2/1700 dead transitions. [2022-01-19 10:22:00,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 1700 transitions, 22223 flow [2022-01-19 10:22:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 10:22:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 10:22:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3258 transitions. [2022-01-19 10:22:00,985 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8609936575052854 [2022-01-19 10:22:00,985 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3258 transitions. [2022-01-19 10:22:00,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3258 transitions. [2022-01-19 10:22:00,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 10:22:00,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3258 transitions. [2022-01-19 10:22:00,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 148.0909090909091) internal successors, (3258), 22 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:22:00,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 172.0) internal successors, (3956), 23 states have internal predecessors, (3956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:22:00,991 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 172.0) internal successors, (3956), 23 states have internal predecessors, (3956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:22:00,991 INFO L186 Difference]: Start difference. First operand has 717 places, 1489 transitions, 17567 flow. Second operand 22 states and 3258 transitions. [2022-01-19 10:22:00,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 736 places, 1700 transitions, 22223 flow [2022-01-19 10:22:01,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 1700 transitions, 20978 flow, removed 278 selfloop flow, removed 9 redundant places. [2022-01-19 10:22:01,796 INFO L242 Difference]: Finished difference. Result has 732 places, 1559 transitions, 18967 flow [2022-01-19 10:22:01,798 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=16127, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=407, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1035, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=18967, PETRI_PLACES=732, PETRI_TRANSITIONS=1559} [2022-01-19 10:22:01,798 INFO L334 CegarLoopForPetriNet]: 157 programPoint places, 575 predicate places. [2022-01-19 10:22:01,798 INFO L470 AbstractCegarLoop]: Abstraction has has 732 places, 1559 transitions, 18967 flow [2022-01-19 10:22:01,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 147.375) internal successors, (2358), 16 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 10:22:01,799 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 10:22:01,799 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 10:22:01,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-19 10:22:02,012 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 10:22:02,012 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-19 10:22:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 10:22:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2053556871, now seen corresponding path program 1 times [2022-01-19 10:22:02,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 10:22:02,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655257833] [2022-01-19 10:22:02,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:22:02,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 10:22:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:22:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 4 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:22:03,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 10:22:03,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655257833] [2022-01-19 10:22:03,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655257833] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 10:22:03,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654038454] [2022-01-19 10:22:03,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 10:22:03,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 10:22:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 10:22:03,078 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 10:22:03,087 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 10:22:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 10:22:03,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 86 conjunts are in the unsatisfiable core [2022-01-19 10:22:03,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 10:22:04,066 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 19 treesize of output 15 [2022-01-19 10:22:05,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 10:22:05,090 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 51 treesize of output 38 [2022-01-19 10:22:06,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-01-19 10:22:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:22:07,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 10:23:06,389 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:23:06,389 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 35 treesize of output 36 [2022-01-19 10:23:06,395 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:23:06,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 40 [2022-01-19 10:23:06,406 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 49 treesize of output 42 [2022-01-19 10:23:06,425 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 10:23:06,426 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 63 treesize of output 67 [2022-01-19 10:23:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 10:23:07,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654038454] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 10:23:07,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 10:23:07,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 33] total 96 [2022-01-19 10:23:07,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316253574] [2022-01-19 10:23:07,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 10:23:07,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-01-19 10:23:07,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 10:23:07,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-01-19 10:23:07,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=802, Invalid=8279, Unknown=39, NotChecked=0, Total=9120 [2022-01-19 10:23:07,468 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 172 [2022-01-19 10:23:07,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 1559 transitions, 18967 flow. Second operand has 96 states, 96 states have (on average 100.02083333333333) internal successors, (9602), 96 states have internal predecessors, (9602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 10:23:07,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 10:23:07,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 172 [2022-01-19 10:23:07,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 10:23:34,424 WARN L228 SmtUtils]: Spent 5.49s on a formula simplification. DAG size of input: 59 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:23:54,855 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse7 (* c_~top~0 4))) (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse2 (< .cse7 4)) (.cse4 (<= .cse11 799)) (.cse6 (<= 0 .cse11)) (.cse5 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse9 (* (- 1) |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|)) (.cse8 (* (- 1) |c_t1Thread1of1ForFork0_push_~stack#1.offset|)) (.cse0 (<= (+ c_~top~0 1) 0)) (.cse10 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|))) (and (or .cse0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (or .cse2 (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (<= 0 .cse3) .cse1 (<= .cse3 799)))) (or .cse2 (and .cse4 .cse5 (not (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) 0)) .cse6)) (<= .cse7 4) (forall ((v_~top~0_29 Int) (v_ArrVal_476 Int)) (or (< (+ c_~top~0 1) v_~top~0_29) (not (= 4294967294 (mod (select (store (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) 4) v_ArrVal_476) (+ |c_~#arr~0.offset| (* v_~top~0_29 4) (- 4))) 4294967296))) (not (< 0 v_~top~0_29)))) (<= c_~top~0 1) (or .cse0 (not (= (mod (+ |c_t1Thread1of1ForFork0_push_#in~x#1| 2) 4294967296) 0))) (<= c_~top~0 0) (or .cse2 (and .cse4 .cse5 (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 1) .cse6)) (= |c_~#arr~0.offset| 0) (or .cse0 .cse5) (or .cse0 (<= (+ (div (+ .cse8 |c_~#arr~0.offset| (- 4)) (- 4)) c_~top~0) 1)) (or .cse0 (<= 2 (div (+ |c_~#arr~0.offset| .cse9 (- 5)) (- 4)))) (or .cse0 (<= (+ (div (+ |c_~#arr~0.offset| .cse9 (- 4)) (- 4)) c_~top~0) 1)) (< .cse10 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or .cse0 (<= 2 (div (+ .cse8 |c_~#arr~0.offset| (- 5)) (- 4)))) (or .cse0 (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0))) (<= 0 .cse10) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse10) 799) (- 4294967296)) (+ (div .cse10 4294967296) 1))))) is different from false [2022-01-19 10:24:31,909 WARN L228 SmtUtils]: Spent 23.46s on a formula simplification. DAG size of input: 100 DAG size of output: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:24:43,542 WARN L228 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:25:10,026 WARN L228 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 73 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:25:48,199 WARN L228 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 128 DAG size of output: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:26:06,191 WARN L228 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 134 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:26:29,269 WARN L228 SmtUtils]: Spent 14.81s on a formula simplification. DAG size of input: 141 DAG size of output: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:26:50,703 WARN L228 SmtUtils]: Spent 20.87s on a formula simplification. DAG size of input: 147 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:27:25,355 WARN L228 SmtUtils]: Spent 26.36s on a formula simplification. DAG size of input: 136 DAG size of output: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:27:46,767 WARN L228 SmtUtils]: Spent 15.59s on a formula simplification. DAG size of input: 123 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:28:07,599 WARN L228 SmtUtils]: Spent 12.30s on a formula simplification. DAG size of input: 60 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:28:25,388 WARN L228 SmtUtils]: Spent 12.45s on a formula simplification. DAG size of input: 72 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:29:19,546 WARN L228 SmtUtils]: Spent 49.94s on a formula simplification. DAG size of input: 146 DAG size of output: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:29:36,836 WARN L228 SmtUtils]: Spent 6.99s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:30:09,514 WARN L228 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 93 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:30:59,889 WARN L228 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 148 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:31:19,035 WARN L228 SmtUtils]: Spent 10.08s on a formula simplification. DAG size of input: 154 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:31:38,369 WARN L228 SmtUtils]: Spent 9.90s on a formula simplification. DAG size of input: 64 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:31:57,280 WARN L228 SmtUtils]: Spent 15.51s on a formula simplification. DAG size of input: 161 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:32:18,046 WARN L228 SmtUtils]: Spent 14.27s on a formula simplification. DAG size of input: 76 DAG size of output: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:32:39,645 WARN L228 SmtUtils]: Spent 21.44s on a formula simplification. DAG size of input: 167 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:33:03,311 WARN L228 SmtUtils]: Spent 22.27s on a formula simplification. DAG size of input: 145 DAG size of output: 97 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 10:33:27,214 WARN L228 SmtUtils]: Spent 16.81s on a formula simplification. DAG size of input: 132 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-01-19 10:33:48,005 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 10:33:48,006 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 10:33:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2022-01-19 10:33:48,634 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-19 10:33:48,650 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 10:33:48,834 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 10:33:48,834 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 270 known predicates. [2022-01-19 10:33:48,836 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-01-19 10:33:48,836 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-01-19 10:33:48,836 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-01-19 10:33:48,836 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-01-19 10:33:48,836 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-19 10:33:48,839 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-01-19 10:33:48,841 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 10:33:48,841 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 10:33:48,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 10:33:48 BasicIcfg [2022-01-19 10:33:48,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 10:33:48,843 INFO L158 Benchmark]: Toolchain (without parser) took 834239.53ms. Allocated memory was 390.1MB in the beginning and 8.6GB in the end (delta: 8.2GB). Free memory was 332.3MB in the beginning and 5.2GB in the end (delta: -4.9GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. [2022-01-19 10:33:48,844 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 390.1MB. Free memory is still 351.1MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 10:33:48,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.46ms. Allocated memory was 390.1MB in the beginning and 559.9MB in the end (delta: 169.9MB). Free memory was 332.2MB in the beginning and 513.0MB in the end (delta: -180.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.0GB. [2022-01-19 10:33:48,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.75ms. Allocated memory is still 559.9MB. Free memory was 513.0MB in the beginning and 510.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 10:33:48,844 INFO L158 Benchmark]: Boogie Preprocessor took 25.05ms. Allocated memory is still 559.9MB. Free memory was 510.9MB in the beginning and 508.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 10:33:48,844 INFO L158 Benchmark]: RCFGBuilder took 468.66ms. Allocated memory is still 559.9MB. Free memory was 508.8MB in the beginning and 493.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2022-01-19 10:33:48,845 INFO L158 Benchmark]: TraceAbstraction took 833135.66ms. Allocated memory was 559.9MB in the beginning and 8.6GB in the end (delta: 8.1GB). Free memory was 492.0MB in the beginning and 5.2GB in the end (delta: -4.7GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. [2022-01-19 10:33:48,846 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 390.1MB. Free memory is still 351.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 549.46ms. Allocated memory was 390.1MB in the beginning and 559.9MB in the end (delta: 169.9MB). Free memory was 332.2MB in the beginning and 513.0MB in the end (delta: -180.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.75ms. Allocated memory is still 559.9MB. Free memory was 513.0MB in the beginning and 510.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.05ms. Allocated memory is still 559.9MB. Free memory was 510.9MB in the beginning and 508.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 468.66ms. Allocated memory is still 559.9MB. Free memory was 508.8MB in the beginning and 493.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 833135.66ms. Allocated memory was 559.9MB in the beginning and 8.6GB in the end (delta: 8.1GB). Free memory was 492.0MB in the beginning and 5.2GB in the end (delta: -4.7GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 270 known predicates. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 270 known predicates. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 270 known predicates. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 270 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 272 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 832.9s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 746.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12054 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12054 mSDsluCounter, 13417 SdHoareTripleChecker+Invalid, 14.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4269 IncrementalHoareTripleChecker+Unchecked, 17154 mSDsCounter, 893 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32654 IncrementalHoareTripleChecker+Invalid, 37816 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 893 mSolverCounterUnsat, 638 mSDtfsCounter, 32654 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3044 GetRequests, 1966 SyntacticMatches, 49 SemanticMatches, 1028 ConstructedPredicates, 3 IntricatePredicates, 5 DeprecatedPredicates, 60075 ImplicationChecksByTransitivity, 743.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18967occurred in iteration=13, InterpolantAutomatonStates: 512, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 82.9s InterpolantComputationTime, 2930 NumberOfCodeBlocks, 2842 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3873 ConstructedInterpolants, 96 QuantifiedInterpolants, 46285 SizeOfPredicates, 152 NumberOfNonLiveVariables, 2285 ConjunctsInSsa, 293 ConjunctsInUnsatCore, 27 InterpolantComputations, 9 PerfectInterpolantSequences, 317/926 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown