/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 06:21:13,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:21:13,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:21:13,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:21:13,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:21:13,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:21:13,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:21:13,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:21:13,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:21:13,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:21:13,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:21:13,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:21:13,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:21:13,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:21:13,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:21:13,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:21:13,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:21:13,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:21:13,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:21:13,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:21:13,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:21:13,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:21:13,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:21:13,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:21:13,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:21:13,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:21:13,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:21:13,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:21:13,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:21:13,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:21:13,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:21:13,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:21:13,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:21:13,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:21:13,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:21:13,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:21:13,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:21:13,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:21:13,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:21:13,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:21:13,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:21:13,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 06:21:13,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:21:13,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:21:13,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:21:13,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:21:13,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:21:13,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:21:13,149 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:21:13,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:21:13,149 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:21:13,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:21:13,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:21:13,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:21:13,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:21:13,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:21:13,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:21:13,150 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:21:13,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:21:13,150 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:21:13,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:21:13,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:21:13,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:21:13,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:21:13,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:21:13,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:21:13,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:21:13,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:21:13,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:21:13,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:21:13,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:21:13,151 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:21:13,151 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:21:13,151 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:21:13,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 06:21:13,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:21:13,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:21:13,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:21:13,315 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:21:13,316 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:21:13,317 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2022-01-19 06:21:13,351 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4719ff68/4b9a5c72cbb347bc8c7b42a03429475d/FLAG2d2e9f58e [2022-01-19 06:21:13,766 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:21:13,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i [2022-01-19 06:21:13,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4719ff68/4b9a5c72cbb347bc8c7b42a03429475d/FLAG2d2e9f58e [2022-01-19 06:21:13,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4719ff68/4b9a5c72cbb347bc8c7b42a03429475d [2022-01-19 06:21:13,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:21:13,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:21:13,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:21:13,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:21:13,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:21:13,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:21:13" (1/1) ... [2022-01-19 06:21:13,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2575f050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:13, skipping insertion in model container [2022-01-19 06:21:13,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:21:13" (1/1) ... [2022-01-19 06:21:13,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:21:13,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:21:14,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i[41323,41336] [2022-01-19 06:21:14,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:21:14,144 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:21:14,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_77-tricky_address4_racing.i[41323,41336] [2022-01-19 06:21:14,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:21:14,229 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:21:14,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14 WrapperNode [2022-01-19 06:21:14,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:21:14,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:21:14,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:21:14,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:21:14,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (1/1) ... [2022-01-19 06:21:14,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (1/1) ... [2022-01-19 06:21:14,281 INFO L137 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 189 [2022-01-19 06:21:14,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:21:14,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:21:14,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:21:14,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:21:14,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (1/1) ... [2022-01-19 06:21:14,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (1/1) ... [2022-01-19 06:21:14,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (1/1) ... [2022-01-19 06:21:14,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (1/1) ... [2022-01-19 06:21:14,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (1/1) ... [2022-01-19 06:21:14,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (1/1) ... [2022-01-19 06:21:14,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (1/1) ... [2022-01-19 06:21:14,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:21:14,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:21:14,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:21:14,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:21:14,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (1/1) ... [2022-01-19 06:21:14,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:21:14,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:14,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 06:21:14,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 06:21:14,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:21:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:21:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:21:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:21:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 06:21:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:21:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-19 06:21:14,372 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-19 06:21:14,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:21:14,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:21:14,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:21:14,374 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 06:21:14,482 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:21:14,482 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:21:14,660 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:21:14,666 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:21:14,666 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-01-19 06:21:14,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:21:14 BoogieIcfgContainer [2022-01-19 06:21:14,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:21:14,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:21:14,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:21:14,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:21:14,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:21:13" (1/3) ... [2022-01-19 06:21:14,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678e073c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:21:14, skipping insertion in model container [2022-01-19 06:21:14,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:21:14" (2/3) ... [2022-01-19 06:21:14,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678e073c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:21:14, skipping insertion in model container [2022-01-19 06:21:14,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:21:14" (3/3) ... [2022-01-19 06:21:14,682 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_77-tricky_address4_racing.i [2022-01-19 06:21:14,685 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:21:14,685 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 06:21:14,685 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:21:14,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,734 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,735 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,735 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,735 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,735 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,735 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,736 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,737 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,738 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,739 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,740 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,741 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,742 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,743 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,744 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,745 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,746 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,747 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,748 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,749 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,750 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,751 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,752 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,753 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,754 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,755 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,756 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,757 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,758 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,761 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,762 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,763 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:14,768 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-19 06:21:14,822 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:21:14,826 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:21:14,827 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 06:21:14,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 200 transitions, 408 flow [2022-01-19 06:21:14,888 INFO L129 PetriNetUnfolder]: 45/272 cut-off events. [2022-01-19 06:21:14,888 INFO L130 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-01-19 06:21:14,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 272 events. 45/272 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 838 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2022-01-19 06:21:14,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 200 transitions, 408 flow [2022-01-19 06:21:14,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 195 transitions, 395 flow [2022-01-19 06:21:14,925 INFO L129 PetriNetUnfolder]: 15/138 cut-off events. [2022-01-19 06:21:14,925 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:21:14,925 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:14,926 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] [2022-01-19 06:21:14,926 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:21:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:14,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1575720690, now seen corresponding path program 1 times [2022-01-19 06:21:14,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:14,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49721918] [2022-01-19 06:21:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:14,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:15,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:15,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49721918] [2022-01-19 06:21:15,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49721918] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:15,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:15,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:21:15,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906550945] [2022-01-19 06:21:15,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:15,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:21:15,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:21:15,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:21:15,222 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-01-19 06:21:15,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 195 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:15,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:15,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-01-19 06:21:15,230 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:15,297 INFO L129 PetriNetUnfolder]: 4/228 cut-off events. [2022-01-19 06:21:15,297 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:21:15,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 228 events. 4/228 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 629 event pairs, 0 based on Foata normal form. 39/254 useless extension candidates. Maximal degree in co-relation 125. Up to 9 conditions per place. [2022-01-19 06:21:15,302 INFO L132 encePairwiseOnDemand]: 170/200 looper letters, 10 selfloop transitions, 2 changer transitions 1/170 dead transitions. [2022-01-19 06:21:15,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 170 transitions, 369 flow [2022-01-19 06:21:15,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:21:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:21:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-01-19 06:21:15,322 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2022-01-19 06:21:15,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-01-19 06:21:15,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-01-19 06:21:15,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:15,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-01-19 06:21:15,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:15,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:15,339 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:15,340 INFO L186 Difference]: Start difference. First operand has 168 places, 195 transitions, 395 flow. Second operand 3 states and 527 transitions. [2022-01-19 06:21:15,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 170 transitions, 369 flow [2022-01-19 06:21:15,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 170 transitions, 369 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:21:15,346 INFO L242 Difference]: Finished difference. Result has 169 places, 166 transitions, 347 flow [2022-01-19 06:21:15,348 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=169, PETRI_TRANSITIONS=166} [2022-01-19 06:21:15,351 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 1 predicate places. [2022-01-19 06:21:15,352 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 166 transitions, 347 flow [2022-01-19 06:21:15,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:15,353 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:15,355 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] [2022-01-19 06:21:15,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:21:15,358 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:21:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:15,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1970782420, now seen corresponding path program 1 times [2022-01-19 06:21:15,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:15,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847948787] [2022-01-19 06:21:15,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:15,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:15,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:15,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847948787] [2022-01-19 06:21:15,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847948787] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:15,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448422501] [2022-01-19 06:21:15,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:15,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:15,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:15,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:15,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 06:21:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:15,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:21:15,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:15,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:21:15,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448422501] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:15,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:21:15,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:21:15,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469063512] [2022-01-19 06:21:15,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:15,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:21:15,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:15,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:21:15,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:21:15,701 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-01-19 06:21:15,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 166 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:15,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:15,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-01-19 06:21:15,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:15,729 INFO L129 PetriNetUnfolder]: 3/173 cut-off events. [2022-01-19 06:21:15,730 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:21:15,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 173 events. 3/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 319 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 160. Up to 6 conditions per place. [2022-01-19 06:21:15,731 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 8 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2022-01-19 06:21:15,731 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 168 transitions, 371 flow [2022-01-19 06:21:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:21:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:21:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-01-19 06:21:15,732 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8283333333333334 [2022-01-19 06:21:15,733 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-01-19 06:21:15,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-01-19 06:21:15,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:15,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-01-19 06:21:15,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:15,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:15,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:15,736 INFO L186 Difference]: Start difference. First operand has 169 places, 166 transitions, 347 flow. Second operand 3 states and 497 transitions. [2022-01-19 06:21:15,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 168 transitions, 371 flow [2022-01-19 06:21:15,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 168 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:21:15,742 INFO L242 Difference]: Finished difference. Result has 170 places, 166 transitions, 353 flow [2022-01-19 06:21:15,742 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2022-01-19 06:21:15,743 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 2 predicate places. [2022-01-19 06:21:15,743 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 353 flow [2022-01-19 06:21:15,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:15,743 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:15,743 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] [2022-01-19 06:21:15,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-19 06:21:15,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:15,960 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:21:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash 449728335, now seen corresponding path program 1 times [2022-01-19 06:21:15,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:15,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821690405] [2022-01-19 06:21:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:15,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:16,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:16,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821690405] [2022-01-19 06:21:16,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821690405] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:16,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560446575] [2022-01-19 06:21:16,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:16,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:16,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:16,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:16,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 06:21:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:16,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:21:16,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:16,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:16,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560446575] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:16,351 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:16,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:21:16,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728362525] [2022-01-19 06:21:16,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:16,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:21:16,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:16,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:21:16,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:21:16,355 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:21:16,356 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 353 flow. Second operand has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:16,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:16,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:21:16,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:16,421 INFO L129 PetriNetUnfolder]: 3/180 cut-off events. [2022-01-19 06:21:16,421 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 06:21:16,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 180 events. 3/180 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 314 event pairs, 0 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2022-01-19 06:21:16,422 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 11 selfloop transitions, 9 changer transitions 0/176 dead transitions. [2022-01-19 06:21:16,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 176 transitions, 415 flow [2022-01-19 06:21:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:21:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:21:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2022-01-19 06:21:16,425 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8172222222222222 [2022-01-19 06:21:16,425 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1471 transitions. [2022-01-19 06:21:16,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1471 transitions. [2022-01-19 06:21:16,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:16,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1471 transitions. [2022-01-19 06:21:16,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 163.44444444444446) internal successors, (1471), 9 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:16,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:16,432 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:16,432 INFO L186 Difference]: Start difference. First operand has 170 places, 166 transitions, 353 flow. Second operand 9 states and 1471 transitions. [2022-01-19 06:21:16,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 176 transitions, 415 flow [2022-01-19 06:21:16,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 176 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:21:16,435 INFO L242 Difference]: Finished difference. Result has 179 places, 172 transitions, 399 flow [2022-01-19 06:21:16,435 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=399, PETRI_PLACES=179, PETRI_TRANSITIONS=172} [2022-01-19 06:21:16,436 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 11 predicate places. [2022-01-19 06:21:16,436 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 172 transitions, 399 flow [2022-01-19 06:21:16,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:16,437 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:16,437 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:16,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:16,651 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,SelfDestructingSolverStorable2 [2022-01-19 06:21:16,652 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:21:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:16,653 INFO L85 PathProgramCache]: Analyzing trace with hash 305383343, now seen corresponding path program 2 times [2022-01-19 06:21:16,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:16,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436883125] [2022-01-19 06:21:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:16,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:21:16,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:16,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436883125] [2022-01-19 06:21:16,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436883125] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:16,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16463609] [2022-01-19 06:21:16,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:21:16,727 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:16,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:16,730 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:16,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 06:21:16,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:21:16,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:21:16,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:21:16,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:17,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:17,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16463609] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:17,178 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:17,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-19 06:21:17,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072912203] [2022-01-19 06:21:17,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:17,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 06:21:17,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 06:21:17,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:21:17,182 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 200 [2022-01-19 06:21:17,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 172 transitions, 399 flow. Second operand has 19 states, 19 states have (on average 157.05263157894737) internal successors, (2984), 19 states have internal predecessors, (2984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:17,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:17,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 200 [2022-01-19 06:21:17,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:17,365 INFO L129 PetriNetUnfolder]: 2/146 cut-off events. [2022-01-19 06:21:17,365 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-01-19 06:21:17,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 146 events. 2/146 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 5/148 useless extension candidates. Maximal degree in co-relation 170. Up to 11 conditions per place. [2022-01-19 06:21:17,366 INFO L132 encePairwiseOnDemand]: 189/200 looper letters, 23 selfloop transitions, 25 changer transitions 32/144 dead transitions. [2022-01-19 06:21:17,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 497 flow [2022-01-19 06:21:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:21:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:21:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3903 transitions. [2022-01-19 06:21:17,371 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7806 [2022-01-19 06:21:17,372 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3903 transitions. [2022-01-19 06:21:17,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3903 transitions. [2022-01-19 06:21:17,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:17,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3903 transitions. [2022-01-19 06:21:17,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 156.12) internal successors, (3903), 25 states have internal predecessors, (3903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:17,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 200.0) internal successors, (5200), 26 states have internal predecessors, (5200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:17,384 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 200.0) internal successors, (5200), 26 states have internal predecessors, (5200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:17,384 INFO L186 Difference]: Start difference. First operand has 179 places, 172 transitions, 399 flow. Second operand 25 states and 3903 transitions. [2022-01-19 06:21:17,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 497 flow [2022-01-19 06:21:17,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 144 transitions, 481 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-01-19 06:21:17,388 INFO L242 Difference]: Finished difference. Result has 153 places, 99 transitions, 356 flow [2022-01-19 06:21:17,388 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=356, PETRI_PLACES=153, PETRI_TRANSITIONS=99} [2022-01-19 06:21:17,388 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, -15 predicate places. [2022-01-19 06:21:17,389 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 99 transitions, 356 flow [2022-01-19 06:21:17,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 157.05263157894737) internal successors, (2984), 19 states have internal predecessors, (2984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:17,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:17,390 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:17,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:17,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:17,619 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:21:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:17,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1085374393, now seen corresponding path program 1 times [2022-01-19 06:21:17,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:17,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046787183] [2022-01-19 06:21:17,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:17,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:17,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:17,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046787183] [2022-01-19 06:21:17,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046787183] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:17,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697160479] [2022-01-19 06:21:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:17,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:17,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:17,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 06:21:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:17,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:21:17,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:18,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:18,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697160479] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:18,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:18,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:21:18,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714500436] [2022-01-19 06:21:18,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:18,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:21:18,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:18,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:21:18,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:21:18,261 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:21:18,264 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 99 transitions, 356 flow. Second operand has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:18,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:18,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:21:18,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:18,521 INFO L129 PetriNetUnfolder]: 1/129 cut-off events. [2022-01-19 06:21:18,521 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-01-19 06:21:18,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 129 events. 1/129 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 3/132 useless extension candidates. Maximal degree in co-relation 265. Up to 17 conditions per place. [2022-01-19 06:21:18,522 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 30 changer transitions 0/125 dead transitions. [2022-01-19 06:21:18,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 125 transitions, 612 flow [2022-01-19 06:21:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:21:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:21:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4888 transitions. [2022-01-19 06:21:18,531 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8146666666666667 [2022-01-19 06:21:18,531 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4888 transitions. [2022-01-19 06:21:18,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4888 transitions. [2022-01-19 06:21:18,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:18,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4888 transitions. [2022-01-19 06:21:18,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 162.93333333333334) internal successors, (4888), 30 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:18,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:18,551 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:18,551 INFO L186 Difference]: Start difference. First operand has 153 places, 99 transitions, 356 flow. Second operand 30 states and 4888 transitions. [2022-01-19 06:21:18,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 125 transitions, 612 flow [2022-01-19 06:21:18,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 125 transitions, 576 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-01-19 06:21:18,555 INFO L242 Difference]: Finished difference. Result has 146 places, 109 transitions, 478 flow [2022-01-19 06:21:18,555 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=478, PETRI_PLACES=146, PETRI_TRANSITIONS=109} [2022-01-19 06:21:18,555 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, -22 predicate places. [2022-01-19 06:21:18,555 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 109 transitions, 478 flow [2022-01-19 06:21:18,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:18,557 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:18,557 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:18,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:18,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:18,772 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:21:18,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1164011634, now seen corresponding path program 2 times [2022-01-19 06:21:18,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:18,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229871766] [2022-01-19 06:21:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:18,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:19,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:19,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229871766] [2022-01-19 06:21:19,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229871766] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:19,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:19,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-19 06:21:19,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819373322] [2022-01-19 06:21:19,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:19,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 06:21:19,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:19,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 06:21:19,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-01-19 06:21:19,089 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 200 [2022-01-19 06:21:19,091 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 109 transitions, 478 flow. Second operand has 15 states, 15 states have (on average 123.0) internal successors, (1845), 15 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:19,091 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:19,091 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 200 [2022-01-19 06:21:19,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:19,807 INFO L129 PetriNetUnfolder]: 52/280 cut-off events. [2022-01-19 06:21:19,808 INFO L130 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-01-19 06:21:19,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 280 events. 52/280 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 698 event pairs, 3 based on Foata normal form. 5/285 useless extension candidates. Maximal degree in co-relation 368. Up to 25 conditions per place. [2022-01-19 06:21:19,810 INFO L132 encePairwiseOnDemand]: 185/200 looper letters, 49 selfloop transitions, 18 changer transitions 19/163 dead transitions. [2022-01-19 06:21:19,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 163 transitions, 758 flow [2022-01-19 06:21:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 06:21:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 06:21:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2387 transitions. [2022-01-19 06:21:19,822 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6281578947368421 [2022-01-19 06:21:19,822 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2387 transitions. [2022-01-19 06:21:19,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2387 transitions. [2022-01-19 06:21:19,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:19,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2387 transitions. [2022-01-19 06:21:19,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 125.63157894736842) internal successors, (2387), 19 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:19,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 200.0) internal successors, (4000), 20 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:19,836 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 200.0) internal successors, (4000), 20 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:19,837 INFO L186 Difference]: Start difference. First operand has 146 places, 109 transitions, 478 flow. Second operand 19 states and 2387 transitions. [2022-01-19 06:21:19,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 163 transitions, 758 flow [2022-01-19 06:21:19,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 163 transitions, 714 flow, removed 4 selfloop flow, removed 18 redundant places. [2022-01-19 06:21:19,843 INFO L242 Difference]: Finished difference. Result has 159 places, 122 transitions, 542 flow [2022-01-19 06:21:19,844 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=542, PETRI_PLACES=159, PETRI_TRANSITIONS=122} [2022-01-19 06:21:19,844 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, -9 predicate places. [2022-01-19 06:21:19,844 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 122 transitions, 542 flow [2022-01-19 06:21:19,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 123.0) internal successors, (1845), 15 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:19,845 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:19,846 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:21:19,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 06:21:19,846 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:21:19,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:19,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1021747464, now seen corresponding path program 1 times [2022-01-19 06:21:19,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:19,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149141840] [2022-01-19 06:21:19,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:19,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:20,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:20,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149141840] [2022-01-19 06:21:20,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149141840] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:20,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214816279] [2022-01-19 06:21:20,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:20,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:20,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:20,494 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:20,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 06:21:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:20,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 06:21:20,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:20,647 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 7 treesize of output 6 [2022-01-19 06:21:21,036 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:21,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:21,088 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 13 treesize of output 15 [2022-01-19 06:21:21,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:21:21,279 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 18 treesize of output 14 [2022-01-19 06:21:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:21:21,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:21:21,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214816279] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:21,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:21:21,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 25 [2022-01-19 06:21:21,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107607743] [2022-01-19 06:21:21,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:21,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:21:21,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:21,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:21:21,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2022-01-19 06:21:21,339 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 200 [2022-01-19 06:21:21,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 122 transitions, 542 flow. Second operand has 10 states, 10 states have (on average 131.6) internal successors, (1316), 10 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:21,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 200 [2022-01-19 06:21:21,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:21,430 INFO L129 PetriNetUnfolder]: 8/150 cut-off events. [2022-01-19 06:21:21,430 INFO L130 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-01-19 06:21:21,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 150 events. 8/150 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 128 event pairs, 1 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 370. Up to 16 conditions per place. [2022-01-19 06:21:21,430 INFO L132 encePairwiseOnDemand]: 192/200 looper letters, 0 selfloop transitions, 0 changer transitions 120/120 dead transitions. [2022-01-19 06:21:21,431 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 120 transitions, 596 flow [2022-01-19 06:21:21,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:21:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:21:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1186 transitions. [2022-01-19 06:21:21,433 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6588888888888889 [2022-01-19 06:21:21,433 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1186 transitions. [2022-01-19 06:21:21,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1186 transitions. [2022-01-19 06:21:21,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:21,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1186 transitions. [2022-01-19 06:21:21,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.77777777777777) internal successors, (1186), 9 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,437 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,437 INFO L186 Difference]: Start difference. First operand has 159 places, 122 transitions, 542 flow. Second operand 9 states and 1186 transitions. [2022-01-19 06:21:21,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 120 transitions, 596 flow [2022-01-19 06:21:21,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 120 transitions, 574 flow, removed 4 selfloop flow, removed 8 redundant places. [2022-01-19 06:21:21,440 INFO L242 Difference]: Finished difference. Result has 151 places, 0 transitions, 0 flow [2022-01-19 06:21:21,440 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=151, PETRI_TRANSITIONS=0} [2022-01-19 06:21:21,441 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, -17 predicate places. [2022-01-19 06:21:21,441 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 0 transitions, 0 flow [2022-01-19 06:21:21,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.6) internal successors, (1316), 10 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,443 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 06:21:21,443 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-19 06:21:21,443 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-19 06:21:21,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:21,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:21,662 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-01-19 06:21:21,663 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2022-01-19 06:21:21,665 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:21:21,666 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:21:21,666 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:21:21,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 200 transitions, 408 flow [2022-01-19 06:21:21,681 INFO L129 PetriNetUnfolder]: 45/272 cut-off events. [2022-01-19 06:21:21,682 INFO L130 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-01-19 06:21:21,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 272 events. 45/272 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 838 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2022-01-19 06:21:21,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 200 transitions, 408 flow [2022-01-19 06:21:21,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 195 transitions, 395 flow [2022-01-19 06:21:21,689 INFO L129 PetriNetUnfolder]: 14/133 cut-off events. [2022-01-19 06:21:21,689 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:21:21,689 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:21,689 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:21,689 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:21:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:21,689 INFO L85 PathProgramCache]: Analyzing trace with hash -959674574, now seen corresponding path program 1 times [2022-01-19 06:21:21,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:21,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6453693] [2022-01-19 06:21:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:21,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:21,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:21,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6453693] [2022-01-19 06:21:21,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6453693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:21,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:21,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:21:21,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352402338] [2022-01-19 06:21:21,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:21,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:21:21,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:21,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:21:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:21:21,713 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-01-19 06:21:21,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 195 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:21,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-01-19 06:21:21,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:21,733 INFO L129 PetriNetUnfolder]: 4/228 cut-off events. [2022-01-19 06:21:21,733 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:21:21,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 228 events. 4/228 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 629 event pairs, 0 based on Foata normal form. 39/254 useless extension candidates. Maximal degree in co-relation 125. Up to 9 conditions per place. [2022-01-19 06:21:21,734 INFO L132 encePairwiseOnDemand]: 170/200 looper letters, 10 selfloop transitions, 2 changer transitions 1/170 dead transitions. [2022-01-19 06:21:21,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 170 transitions, 369 flow [2022-01-19 06:21:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:21:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:21:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-01-19 06:21:21,736 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2022-01-19 06:21:21,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-01-19 06:21:21,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-01-19 06:21:21,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:21,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-01-19 06:21:21,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,739 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,739 INFO L186 Difference]: Start difference. First operand has 168 places, 195 transitions, 395 flow. Second operand 3 states and 527 transitions. [2022-01-19 06:21:21,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 170 transitions, 369 flow [2022-01-19 06:21:21,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 170 transitions, 369 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:21:21,741 INFO L242 Difference]: Finished difference. Result has 169 places, 166 transitions, 347 flow [2022-01-19 06:21:21,741 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=169, PETRI_TRANSITIONS=166} [2022-01-19 06:21:21,743 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 1 predicate places. [2022-01-19 06:21:21,743 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 166 transitions, 347 flow [2022-01-19 06:21:21,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,743 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:21,743 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:21,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 06:21:21,743 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:21:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1718762197, now seen corresponding path program 1 times [2022-01-19 06:21:21,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:21,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750378233] [2022-01-19 06:21:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:21,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:21,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:21,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750378233] [2022-01-19 06:21:21,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750378233] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:21,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459297627] [2022-01-19 06:21:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:21,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:21,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:21,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:21,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 06:21:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:21,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:21:21,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:21,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:21,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:21,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459297627] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:21,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:21,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:21:21,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979668083] [2022-01-19 06:21:21,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:21,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:21:21,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:21,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:21:21,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:21:21,994 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:21:21,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 166 transitions, 347 flow. Second operand has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:21,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:21,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:21:21,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:22,040 INFO L129 PetriNetUnfolder]: 4/234 cut-off events. [2022-01-19 06:21:22,041 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 06:21:22,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 234 events. 4/234 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 227. Up to 6 conditions per place. [2022-01-19 06:21:22,041 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 11 selfloop transitions, 9 changer transitions 0/176 dead transitions. [2022-01-19 06:21:22,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 176 transitions, 409 flow [2022-01-19 06:21:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:21:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:21:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2022-01-19 06:21:22,043 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8172222222222222 [2022-01-19 06:21:22,043 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1471 transitions. [2022-01-19 06:21:22,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1471 transitions. [2022-01-19 06:21:22,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:22,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1471 transitions. [2022-01-19 06:21:22,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 163.44444444444446) internal successors, (1471), 9 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:22,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:22,047 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:22,047 INFO L186 Difference]: Start difference. First operand has 169 places, 166 transitions, 347 flow. Second operand 9 states and 1471 transitions. [2022-01-19 06:21:22,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 176 transitions, 409 flow [2022-01-19 06:21:22,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 176 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:21:22,049 INFO L242 Difference]: Finished difference. Result has 178 places, 172 transitions, 395 flow [2022-01-19 06:21:22,050 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=395, PETRI_PLACES=178, PETRI_TRANSITIONS=172} [2022-01-19 06:21:22,050 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 10 predicate places. [2022-01-19 06:21:22,050 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 172 transitions, 395 flow [2022-01-19 06:21:22,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:22,051 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:22,051 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 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] [2022-01-19 06:21:22,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:22,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:22,267 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:21:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2122069387, now seen corresponding path program 2 times [2022-01-19 06:21:22,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:22,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336574028] [2022-01-19 06:21:22,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:22,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:22,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:22,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336574028] [2022-01-19 06:21:22,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336574028] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:22,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567877515] [2022-01-19 06:21:22,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:21:22,307 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:22,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:22,308 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:22,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 06:21:22,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:21:22,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:21:22,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:21:22,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:22,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:22,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567877515] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:22,576 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:22,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-19 06:21:22,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849220828] [2022-01-19 06:21:22,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:22,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 06:21:22,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 06:21:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-19 06:21:22,578 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:21:22,580 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 172 transitions, 395 flow. Second operand has 18 states, 18 states have (on average 163.27777777777777) internal successors, (2939), 18 states have internal predecessors, (2939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:22,580 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:22,580 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:21:22,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:22,707 INFO L129 PetriNetUnfolder]: 4/254 cut-off events. [2022-01-19 06:21:22,707 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-01-19 06:21:22,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 254 events. 4/254 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 4/247 useless extension candidates. Maximal degree in co-relation 221. Up to 11 conditions per place. [2022-01-19 06:21:22,708 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 19 selfloop transitions, 21 changer transitions 0/196 dead transitions. [2022-01-19 06:21:22,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 196 transitions, 583 flow [2022-01-19 06:21:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 06:21:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 06:21:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3425 transitions. [2022-01-19 06:21:22,711 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2022-01-19 06:21:22,711 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3425 transitions. [2022-01-19 06:21:22,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3425 transitions. [2022-01-19 06:21:22,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:22,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3425 transitions. [2022-01-19 06:21:22,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 163.0952380952381) internal successors, (3425), 21 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:22,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 200.0) internal successors, (4400), 22 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:22,719 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 200.0) internal successors, (4400), 22 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:22,719 INFO L186 Difference]: Start difference. First operand has 178 places, 172 transitions, 395 flow. Second operand 21 states and 3425 transitions. [2022-01-19 06:21:22,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 196 transitions, 583 flow [2022-01-19 06:21:22,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 196 transitions, 569 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 06:21:22,722 INFO L242 Difference]: Finished difference. Result has 202 places, 185 transitions, 519 flow [2022-01-19 06:21:22,722 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=519, PETRI_PLACES=202, PETRI_TRANSITIONS=185} [2022-01-19 06:21:22,722 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 34 predicate places. [2022-01-19 06:21:22,722 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 185 transitions, 519 flow [2022-01-19 06:21:22,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 163.27777777777777) internal successors, (2939), 18 states have internal predecessors, (2939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:22,723 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:22,723 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 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] [2022-01-19 06:21:22,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:22,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:22,938 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:21:22,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1016344139, now seen corresponding path program 3 times [2022-01-19 06:21:22,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:22,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623724994] [2022-01-19 06:21:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:22,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:23,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:23,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623724994] [2022-01-19 06:21:23,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623724994] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:23,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249265851] [2022-01-19 06:21:23,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:21:23,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:23,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:23,051 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:23,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 06:21:23,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-19 06:21:23,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:21:23,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:21:23,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:23,247 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:23,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:23,389 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:21:23,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249265851] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:23,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:23,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:21:23,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380695425] [2022-01-19 06:21:23,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:23,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:21:23,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:23,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:21:23,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:21:23,392 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:21:23,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 185 transitions, 519 flow. Second operand has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:23,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:23,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:21:23,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:23,599 INFO L129 PetriNetUnfolder]: 4/269 cut-off events. [2022-01-19 06:21:23,599 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-01-19 06:21:23,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 269 events. 4/269 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 3/261 useless extension candidates. Maximal degree in co-relation 317. Up to 17 conditions per place. [2022-01-19 06:21:23,600 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 30 changer transitions 0/211 dead transitions. [2022-01-19 06:21:23,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 211 transitions, 775 flow [2022-01-19 06:21:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:21:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:21:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4888 transitions. [2022-01-19 06:21:23,604 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8146666666666667 [2022-01-19 06:21:23,604 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4888 transitions. [2022-01-19 06:21:23,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4888 transitions. [2022-01-19 06:21:23,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:23,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4888 transitions. [2022-01-19 06:21:23,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 162.93333333333334) internal successors, (4888), 30 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:23,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:23,615 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:23,615 INFO L186 Difference]: Start difference. First operand has 202 places, 185 transitions, 519 flow. Second operand 30 states and 4888 transitions. [2022-01-19 06:21:23,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 211 transitions, 775 flow [2022-01-19 06:21:23,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 211 transitions, 745 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-01-19 06:21:23,618 INFO L242 Difference]: Finished difference. Result has 229 places, 195 transitions, 647 flow [2022-01-19 06:21:23,618 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=647, PETRI_PLACES=229, PETRI_TRANSITIONS=195} [2022-01-19 06:21:23,619 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 61 predicate places. [2022-01-19 06:21:23,619 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 195 transitions, 647 flow [2022-01-19 06:21:23,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:23,620 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:23,620 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:21:23,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:23,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-19 06:21:23,836 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:21:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash 282089810, now seen corresponding path program 4 times [2022-01-19 06:21:23,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:23,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607801247] [2022-01-19 06:21:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:23,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:21:23,849 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 06:21:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:21:23,878 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 06:21:23,878 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 06:21:23,878 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:21:23,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 06:21:23,878 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1] [2022-01-19 06:21:23,878 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 06:21:23,879 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 06:21:23,879 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-19 06:21:23,888 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,888 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,889 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,890 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,891 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,892 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,893 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,894 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,895 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,896 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,897 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,898 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,899 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,900 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,901 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,902 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,903 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,904 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,905 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,906 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,907 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,908 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,909 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,909 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,909 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,909 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,909 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,909 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,909 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:21:23,910 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 06:21:23,910 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:21:23,910 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:21:23,911 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 06:21:23,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 235 places, 275 transitions, 568 flow [2022-01-19 06:21:23,936 INFO L129 PetriNetUnfolder]: 75/444 cut-off events. [2022-01-19 06:21:23,936 INFO L130 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-01-19 06:21:23,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 444 events. 75/444 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1726 event pairs, 0 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 274. Up to 12 conditions per place. [2022-01-19 06:21:23,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 275 transitions, 568 flow [2022-01-19 06:21:23,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 275 transitions, 568 flow [2022-01-19 06:21:23,944 INFO L129 PetriNetUnfolder]: 13/134 cut-off events. [2022-01-19 06:21:23,944 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:21:23,945 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:23,945 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] [2022-01-19 06:21:23,945 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:23,945 INFO L85 PathProgramCache]: Analyzing trace with hash 510054994, now seen corresponding path program 1 times [2022-01-19 06:21:23,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:23,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582063001] [2022-01-19 06:21:23,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:23,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:23,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:23,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582063001] [2022-01-19 06:21:23,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582063001] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:23,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:23,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:21:23,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126963981] [2022-01-19 06:21:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:23,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:21:23,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:21:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:21:23,959 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 275 [2022-01-19 06:21:23,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 275 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:23,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:23,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 275 [2022-01-19 06:21:23,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:24,029 INFO L129 PetriNetUnfolder]: 9/377 cut-off events. [2022-01-19 06:21:24,030 INFO L130 PetriNetUnfolder]: For 18/22 co-relation queries the response was YES. [2022-01-19 06:21:24,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 377 events. 9/377 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1438 event pairs, 0 based on Foata normal form. 90/446 useless extension candidates. Maximal degree in co-relation 248. Up to 14 conditions per place. [2022-01-19 06:21:24,032 INFO L132 encePairwiseOnDemand]: 233/275 looper letters, 13 selfloop transitions, 2 changer transitions 1/237 dead transitions. [2022-01-19 06:21:24,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 237 transitions, 522 flow [2022-01-19 06:21:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:21:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:21:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2022-01-19 06:21:24,033 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8751515151515151 [2022-01-19 06:21:24,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2022-01-19 06:21:24,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2022-01-19 06:21:24,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:24,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2022-01-19 06:21:24,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,035 INFO L186 Difference]: Start difference. First operand has 235 places, 275 transitions, 568 flow. Second operand 3 states and 722 transitions. [2022-01-19 06:21:24,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 237 transitions, 522 flow [2022-01-19 06:21:24,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 237 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:21:24,038 INFO L242 Difference]: Finished difference. Result has 235 places, 233 transitions, 494 flow [2022-01-19 06:21:24,038 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=235, PETRI_TRANSITIONS=233} [2022-01-19 06:21:24,038 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 0 predicate places. [2022-01-19 06:21:24,039 INFO L470 AbstractCegarLoop]: Abstraction has has 235 places, 233 transitions, 494 flow [2022-01-19 06:21:24,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,039 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:24,039 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] [2022-01-19 06:21:24,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 06:21:24,039 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:24,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:24,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1078955039, now seen corresponding path program 1 times [2022-01-19 06:21:24,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:24,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078754003] [2022-01-19 06:21:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:24,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:24,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:24,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078754003] [2022-01-19 06:21:24,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078754003] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:24,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034952914] [2022-01-19 06:21:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:24,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:24,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:24,062 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:24,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 06:21:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:24,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:21:24,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:24,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:21:24,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034952914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:24,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:21:24,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:21:24,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671421444] [2022-01-19 06:21:24,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:24,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:21:24,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:24,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:21:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:21:24,184 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 275 [2022-01-19 06:21:24,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 233 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:24,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 275 [2022-01-19 06:21:24,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:24,220 INFO L129 PetriNetUnfolder]: 7/331 cut-off events. [2022-01-19 06:21:24,220 INFO L130 PetriNetUnfolder]: For 15/34 co-relation queries the response was YES. [2022-01-19 06:21:24,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 331 events. 7/331 cut-off events. For 15/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1125 event pairs, 0 based on Foata normal form. 1/316 useless extension candidates. Maximal degree in co-relation 336. Up to 16 conditions per place. [2022-01-19 06:21:24,223 INFO L132 encePairwiseOnDemand]: 272/275 looper letters, 13 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2022-01-19 06:21:24,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 237 transitions, 532 flow [2022-01-19 06:21:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:21:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:21:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2022-01-19 06:21:24,223 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2022-01-19 06:21:24,224 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2022-01-19 06:21:24,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2022-01-19 06:21:24,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:24,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2022-01-19 06:21:24,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,226 INFO L186 Difference]: Start difference. First operand has 235 places, 233 transitions, 494 flow. Second operand 3 states and 682 transitions. [2022-01-19 06:21:24,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 237 transitions, 532 flow [2022-01-19 06:21:24,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 237 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:21:24,229 INFO L242 Difference]: Finished difference. Result has 236 places, 234 transitions, 504 flow [2022-01-19 06:21:24,229 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=236, PETRI_TRANSITIONS=234} [2022-01-19 06:21:24,230 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 1 predicate places. [2022-01-19 06:21:24,230 INFO L470 AbstractCegarLoop]: Abstraction has has 236 places, 234 transitions, 504 flow [2022-01-19 06:21:24,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,230 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:24,230 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] [2022-01-19 06:21:24,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:24,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-19 06:21:24,447 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1428162091, now seen corresponding path program 1 times [2022-01-19 06:21:24,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:24,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72490179] [2022-01-19 06:21:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:24,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:24,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:24,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72490179] [2022-01-19 06:21:24,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72490179] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:24,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633649099] [2022-01-19 06:21:24,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:24,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:24,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:24,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:24,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 06:21:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:24,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:21:24,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:24,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:24,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633649099] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:24,738 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:24,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:21:24,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587993794] [2022-01-19 06:21:24,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:24,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:21:24,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:24,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:21:24,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:21:24,740 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 275 [2022-01-19 06:21:24,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 234 transitions, 504 flow. Second operand has 10 states, 10 states have (on average 223.1) internal successors, (2231), 10 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:24,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 275 [2022-01-19 06:21:24,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:24,838 INFO L129 PetriNetUnfolder]: 7/338 cut-off events. [2022-01-19 06:21:24,838 INFO L130 PetriNetUnfolder]: For 19/23 co-relation queries the response was YES. [2022-01-19 06:21:24,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 338 events. 7/338 cut-off events. For 19/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1121 event pairs, 0 based on Foata normal form. 2/326 useless extension candidates. Maximal degree in co-relation 321. Up to 11 conditions per place. [2022-01-19 06:21:24,841 INFO L132 encePairwiseOnDemand]: 269/275 looper letters, 14 selfloop transitions, 9 changer transitions 0/244 dead transitions. [2022-01-19 06:21:24,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 244 transitions, 572 flow [2022-01-19 06:21:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:21:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:21:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2014 transitions. [2022-01-19 06:21:24,849 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8137373737373738 [2022-01-19 06:21:24,849 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2014 transitions. [2022-01-19 06:21:24,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2014 transitions. [2022-01-19 06:21:24,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:24,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2014 transitions. [2022-01-19 06:21:24,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 223.77777777777777) internal successors, (2014), 9 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 275.0) internal successors, (2750), 10 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,855 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 275.0) internal successors, (2750), 10 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,855 INFO L186 Difference]: Start difference. First operand has 236 places, 234 transitions, 504 flow. Second operand 9 states and 2014 transitions. [2022-01-19 06:21:24,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 244 transitions, 572 flow [2022-01-19 06:21:24,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 244 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:21:24,860 INFO L242 Difference]: Finished difference. Result has 246 places, 240 transitions, 552 flow [2022-01-19 06:21:24,860 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=552, PETRI_PLACES=246, PETRI_TRANSITIONS=240} [2022-01-19 06:21:24,861 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 11 predicate places. [2022-01-19 06:21:24,861 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 240 transitions, 552 flow [2022-01-19 06:21:24,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 223.1) internal successors, (2231), 10 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:24,861 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:24,862 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:24,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:25,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 06:21:25,075 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:25,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2019148117, now seen corresponding path program 2 times [2022-01-19 06:21:25,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:25,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698049561] [2022-01-19 06:21:25,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:25,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:21:25,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:25,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698049561] [2022-01-19 06:21:25,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698049561] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:25,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334851235] [2022-01-19 06:21:25,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:21:25,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:25,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:25,101 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:25,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 06:21:25,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:21:25,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:21:25,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:21:25,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:25,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:21:25,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334851235] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:25,419 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:25,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-19 06:21:25,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386993305] [2022-01-19 06:21:25,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:25,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 06:21:25,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:25,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 06:21:25,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:21:25,421 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 275 [2022-01-19 06:21:25,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 240 transitions, 552 flow. Second operand has 19 states, 19 states have (on average 217.05263157894737) internal successors, (4124), 19 states have internal predecessors, (4124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:25,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:25,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 275 [2022-01-19 06:21:25,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:25,603 INFO L129 PetriNetUnfolder]: 5/313 cut-off events. [2022-01-19 06:21:25,603 INFO L130 PetriNetUnfolder]: For 36/43 co-relation queries the response was YES. [2022-01-19 06:21:25,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 313 events. 5/313 cut-off events. For 36/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 732 event pairs, 1 based on Foata normal form. 6/307 useless extension candidates. Maximal degree in co-relation 293. Up to 14 conditions per place. [2022-01-19 06:21:25,605 INFO L132 encePairwiseOnDemand]: 264/275 looper letters, 31 selfloop transitions, 26 changer transitions 0/270 dead transitions. [2022-01-19 06:21:25,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 270 transitions, 786 flow [2022-01-19 06:21:25,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:21:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:21:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5412 transitions. [2022-01-19 06:21:25,609 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7872 [2022-01-19 06:21:25,609 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5412 transitions. [2022-01-19 06:21:25,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5412 transitions. [2022-01-19 06:21:25,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:25,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5412 transitions. [2022-01-19 06:21:25,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 216.48) internal successors, (5412), 25 states have internal predecessors, (5412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:25,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 275.0) internal successors, (7150), 26 states have internal predecessors, (7150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:25,619 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 275.0) internal successors, (7150), 26 states have internal predecessors, (7150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:25,619 INFO L186 Difference]: Start difference. First operand has 246 places, 240 transitions, 552 flow. Second operand 25 states and 5412 transitions. [2022-01-19 06:21:25,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 270 transitions, 786 flow [2022-01-19 06:21:25,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 270 transitions, 772 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 06:21:25,623 INFO L242 Difference]: Finished difference. Result has 277 places, 255 transitions, 704 flow [2022-01-19 06:21:25,623 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=704, PETRI_PLACES=277, PETRI_TRANSITIONS=255} [2022-01-19 06:21:25,623 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 42 predicate places. [2022-01-19 06:21:25,624 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 255 transitions, 704 flow [2022-01-19 06:21:25,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 217.05263157894737) internal successors, (4124), 19 states have internal predecessors, (4124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:25,624 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:25,624 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:25,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:25,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-19 06:21:25,840 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:25,840 INFO L85 PathProgramCache]: Analyzing trace with hash 44072195, now seen corresponding path program 1 times [2022-01-19 06:21:25,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:25,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727328382] [2022-01-19 06:21:25,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:25,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:25,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:25,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727328382] [2022-01-19 06:21:25,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727328382] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:25,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622407558] [2022-01-19 06:21:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:25,981 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:25,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:25,982 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:26,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-19 06:21:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:26,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:21:26,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:26,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:21:26,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622407558] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:26,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:26,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:21:26,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944042702] [2022-01-19 06:21:26,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:26,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:21:26,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:26,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:21:26,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:21:26,493 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 275 [2022-01-19 06:21:26,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 255 transitions, 704 flow. Second operand has 23 states, 23 states have (on average 223.43478260869566) internal successors, (5139), 23 states have internal predecessors, (5139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:26,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:26,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 275 [2022-01-19 06:21:26,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:26,809 INFO L129 PetriNetUnfolder]: 5/328 cut-off events. [2022-01-19 06:21:26,810 INFO L130 PetriNetUnfolder]: For 135/136 co-relation queries the response was YES. [2022-01-19 06:21:26,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 328 events. 5/328 cut-off events. For 135/136 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 732 event pairs, 1 based on Foata normal form. 3/319 useless extension candidates. Maximal degree in co-relation 345. Up to 17 conditions per place. [2022-01-19 06:21:26,812 INFO L132 encePairwiseOnDemand]: 269/275 looper letters, 28 selfloop transitions, 30 changer transitions 0/281 dead transitions. [2022-01-19 06:21:26,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 281 transitions, 966 flow [2022-01-19 06:21:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:21:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:21:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6691 transitions. [2022-01-19 06:21:26,817 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.811030303030303 [2022-01-19 06:21:26,817 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 6691 transitions. [2022-01-19 06:21:26,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 6691 transitions. [2022-01-19 06:21:26,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:26,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 6691 transitions. [2022-01-19 06:21:26,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 223.03333333333333) internal successors, (6691), 30 states have internal predecessors, (6691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:26,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 275.0) internal successors, (8525), 31 states have internal predecessors, (8525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:26,830 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 275.0) internal successors, (8525), 31 states have internal predecessors, (8525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:26,830 INFO L186 Difference]: Start difference. First operand has 277 places, 255 transitions, 704 flow. Second operand 30 states and 6691 transitions. [2022-01-19 06:21:26,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 281 transitions, 966 flow [2022-01-19 06:21:26,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 281 transitions, 932 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-01-19 06:21:26,835 INFO L242 Difference]: Finished difference. Result has 303 places, 265 transitions, 828 flow [2022-01-19 06:21:26,835 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=828, PETRI_PLACES=303, PETRI_TRANSITIONS=265} [2022-01-19 06:21:26,835 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 68 predicate places. [2022-01-19 06:21:26,835 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 265 transitions, 828 flow [2022-01-19 06:21:26,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 223.43478260869566) internal successors, (5139), 23 states have internal predecessors, (5139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:26,836 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:26,837 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:26,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:27,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-19 06:21:27,053 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:27,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:27,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1321944183, now seen corresponding path program 2 times [2022-01-19 06:21:27,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:27,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001816316] [2022-01-19 06:21:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:27,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:27,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:27,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001816316] [2022-01-19 06:21:27,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001816316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:27,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:27,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-19 06:21:27,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700607089] [2022-01-19 06:21:27,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:27,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-19 06:21:27,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:27,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-19 06:21:27,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-01-19 06:21:27,385 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 275 [2022-01-19 06:21:27,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 265 transitions, 828 flow. Second operand has 16 states, 16 states have (on average 176.875) internal successors, (2830), 16 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:27,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:27,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 275 [2022-01-19 06:21:27,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:30,937 INFO L129 PetriNetUnfolder]: 5481/19196 cut-off events. [2022-01-19 06:21:30,937 INFO L130 PetriNetUnfolder]: For 1555/1574 co-relation queries the response was YES. [2022-01-19 06:21:31,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29586 conditions, 19196 events. 5481/19196 cut-off events. For 1555/1574 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 231578 event pairs, 2983 based on Foata normal form. 19/17615 useless extension candidates. Maximal degree in co-relation 29337. Up to 5991 conditions per place. [2022-01-19 06:21:31,088 INFO L132 encePairwiseOnDemand]: 257/275 looper letters, 205 selfloop transitions, 31 changer transitions 5/446 dead transitions. [2022-01-19 06:21:31,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 446 transitions, 1845 flow [2022-01-19 06:21:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 06:21:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 06:21:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4091 transitions. [2022-01-19 06:21:31,092 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.676198347107438 [2022-01-19 06:21:31,092 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4091 transitions. [2022-01-19 06:21:31,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4091 transitions. [2022-01-19 06:21:31,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:31,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4091 transitions. [2022-01-19 06:21:31,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 185.95454545454547) internal successors, (4091), 22 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:31,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 275.0) internal successors, (6325), 23 states have internal predecessors, (6325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:31,105 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 275.0) internal successors, (6325), 23 states have internal predecessors, (6325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:31,106 INFO L186 Difference]: Start difference. First operand has 303 places, 265 transitions, 828 flow. Second operand 22 states and 4091 transitions. [2022-01-19 06:21:31,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 446 transitions, 1845 flow [2022-01-19 06:21:31,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 446 transitions, 1801 flow, removed 4 selfloop flow, removed 18 redundant places. [2022-01-19 06:21:31,126 INFO L242 Difference]: Finished difference. Result has 316 places, 297 transitions, 989 flow [2022-01-19 06:21:31,127 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=989, PETRI_PLACES=316, PETRI_TRANSITIONS=297} [2022-01-19 06:21:31,127 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 81 predicate places. [2022-01-19 06:21:31,127 INFO L470 AbstractCegarLoop]: Abstraction has has 316 places, 297 transitions, 989 flow [2022-01-19 06:21:31,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 176.875) internal successors, (2830), 16 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:31,128 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:31,128 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:21:31,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 06:21:31,129 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1385235796, now seen corresponding path program 1 times [2022-01-19 06:21:31,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:31,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958460391] [2022-01-19 06:21:31,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:31,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:31,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:31,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958460391] [2022-01-19 06:21:31,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958460391] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:31,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792352104] [2022-01-19 06:21:31,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:31,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:31,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:31,205 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:31,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-19 06:21:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:31,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 06:21:31,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:31,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:31,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792352104] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:31,647 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:31,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-01-19 06:21:31,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292144288] [2022-01-19 06:21:31,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:31,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 06:21:31,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:31,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 06:21:31,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-01-19 06:21:31,651 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 275 [2022-01-19 06:21:31,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 297 transitions, 989 flow. Second operand has 14 states, 14 states have (on average 223.5) internal successors, (3129), 14 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:31,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:31,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 275 [2022-01-19 06:21:31,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:31,826 INFO L129 PetriNetUnfolder]: 22/558 cut-off events. [2022-01-19 06:21:31,826 INFO L130 PetriNetUnfolder]: For 225/285 co-relation queries the response was YES. [2022-01-19 06:21:31,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 558 events. 22/558 cut-off events. For 225/285 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2630 event pairs, 2 based on Foata normal form. 46/589 useless extension candidates. Maximal degree in co-relation 848. Up to 24 conditions per place. [2022-01-19 06:21:31,830 INFO L132 encePairwiseOnDemand]: 270/275 looper letters, 25 selfloop transitions, 7 changer transitions 0/240 dead transitions. [2022-01-19 06:21:31,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 240 transitions, 931 flow [2022-01-19 06:21:31,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:21:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:21:31,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2006 transitions. [2022-01-19 06:21:31,837 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8105050505050505 [2022-01-19 06:21:31,838 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2006 transitions. [2022-01-19 06:21:31,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2006 transitions. [2022-01-19 06:21:31,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:31,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2006 transitions. [2022-01-19 06:21:31,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 222.88888888888889) internal successors, (2006), 9 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:31,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 275.0) internal successors, (2750), 10 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:31,844 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 275.0) internal successors, (2750), 10 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:31,845 INFO L186 Difference]: Start difference. First operand has 316 places, 297 transitions, 989 flow. Second operand 9 states and 2006 transitions. [2022-01-19 06:21:31,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 240 transitions, 931 flow [2022-01-19 06:21:31,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 240 transitions, 920 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-01-19 06:21:31,850 INFO L242 Difference]: Finished difference. Result has 262 places, 237 transitions, 862 flow [2022-01-19 06:21:31,851 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=862, PETRI_PLACES=262, PETRI_TRANSITIONS=237} [2022-01-19 06:21:31,853 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 27 predicate places. [2022-01-19 06:21:31,853 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 237 transitions, 862 flow [2022-01-19 06:21:31,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 223.5) internal successors, (3129), 14 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:31,853 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:31,854 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:21:31,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-01-19 06:21:32,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:32,079 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:32,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash -106023454, now seen corresponding path program 1 times [2022-01-19 06:21:32,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:32,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151726671] [2022-01-19 06:21:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:32,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:32,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:32,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151726671] [2022-01-19 06:21:32,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151726671] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:32,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389129372] [2022-01-19 06:21:32,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:32,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:32,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:32,706 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:32,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-19 06:21:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:32,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 06:21:32,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:32,870 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 7 treesize of output 6 [2022-01-19 06:21:33,395 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:33,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:33,454 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 13 treesize of output 15 [2022-01-19 06:21:33,602 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 13 treesize of output 15 [2022-01-19 06:21:33,704 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 18 treesize of output 14 [2022-01-19 06:21:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:21:33,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:21:33,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389129372] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:33,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:21:33,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 26 [2022-01-19 06:21:33,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830227506] [2022-01-19 06:21:33,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:33,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:21:33,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:33,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:21:33,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-01-19 06:21:33,772 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 275 [2022-01-19 06:21:33,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 237 transitions, 862 flow. Second operand has 10 states, 10 states have (on average 185.6) internal successors, (1856), 10 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:33,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:33,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 275 [2022-01-19 06:21:33,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:34,286 INFO L129 PetriNetUnfolder]: 404/2221 cut-off events. [2022-01-19 06:21:34,286 INFO L130 PetriNetUnfolder]: For 535/553 co-relation queries the response was YES. [2022-01-19 06:21:34,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 2221 events. 404/2221 cut-off events. For 535/553 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 18878 event pairs, 74 based on Foata normal form. 27/2189 useless extension candidates. Maximal degree in co-relation 3629. Up to 260 conditions per place. [2022-01-19 06:21:34,326 INFO L132 encePairwiseOnDemand]: 264/275 looper letters, 71 selfloop transitions, 18 changer transitions 41/303 dead transitions. [2022-01-19 06:21:34,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 303 transitions, 1341 flow [2022-01-19 06:21:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 06:21:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 06:21:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2658 transitions. [2022-01-19 06:21:34,337 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6903896103896104 [2022-01-19 06:21:34,337 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2658 transitions. [2022-01-19 06:21:34,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2658 transitions. [2022-01-19 06:21:34,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:34,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2658 transitions. [2022-01-19 06:21:34,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 189.85714285714286) internal successors, (2658), 14 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:34,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 275.0) internal successors, (4125), 15 states have internal predecessors, (4125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:34,355 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 275.0) internal successors, (4125), 15 states have internal predecessors, (4125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:34,355 INFO L186 Difference]: Start difference. First operand has 262 places, 237 transitions, 862 flow. Second operand 14 states and 2658 transitions. [2022-01-19 06:21:34,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 303 transitions, 1341 flow [2022-01-19 06:21:34,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 303 transitions, 1316 flow, removed 2 selfloop flow, removed 9 redundant places. [2022-01-19 06:21:34,363 INFO L242 Difference]: Finished difference. Result has 273 places, 240 transitions, 922 flow [2022-01-19 06:21:34,363 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=922, PETRI_PLACES=273, PETRI_TRANSITIONS=240} [2022-01-19 06:21:34,364 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 38 predicate places. [2022-01-19 06:21:34,364 INFO L470 AbstractCegarLoop]: Abstraction has has 273 places, 240 transitions, 922 flow [2022-01-19 06:21:34,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 185.6) internal successors, (1856), 10 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:34,364 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:34,364 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:21:34,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:34,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:34,595 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash -278495548, now seen corresponding path program 1 times [2022-01-19 06:21:34,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:34,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804527530] [2022-01-19 06:21:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:34,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:35,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:35,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804527530] [2022-01-19 06:21:35,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804527530] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:35,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967909116] [2022-01-19 06:21:35,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:35,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:35,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:35,127 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:35,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-19 06:21:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:35,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 06:21:35,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:35,281 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 7 treesize of output 6 [2022-01-19 06:21:35,684 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:35,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:35,709 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 13 treesize of output 15 [2022-01-19 06:21:35,751 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 13 treesize of output 15 [2022-01-19 06:21:35,808 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 18 treesize of output 14 [2022-01-19 06:21:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:21:35,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:35,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_681) |c_~#a~0.base|) (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|)) 0)) is different from false [2022-01-19 06:21:36,481 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 13 treesize of output 7 [2022-01-19 06:21:36,503 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:21:36,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:21:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-19 06:21:36,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967909116] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:36,521 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:36,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 29 [2022-01-19 06:21:36,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492861225] [2022-01-19 06:21:36,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:36,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 06:21:36,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:36,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 06:21:36,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=644, Unknown=1, NotChecked=52, Total=812 [2022-01-19 06:21:36,524 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 275 [2022-01-19 06:21:36,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 240 transitions, 922 flow. Second operand has 29 states, 29 states have (on average 171.24137931034483) internal successors, (4966), 29 states have internal predecessors, (4966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:36,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:36,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 275 [2022-01-19 06:21:36,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:46,671 WARN L228 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 47 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:21:48,437 INFO L129 PetriNetUnfolder]: 2195/8420 cut-off events. [2022-01-19 06:21:48,437 INFO L130 PetriNetUnfolder]: For 2464/2472 co-relation queries the response was YES. [2022-01-19 06:21:48,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14684 conditions, 8420 events. 2195/8420 cut-off events. For 2464/2472 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 91677 event pairs, 883 based on Foata normal form. 0/8122 useless extension candidates. Maximal degree in co-relation 14577. Up to 1606 conditions per place. [2022-01-19 06:21:48,492 INFO L132 encePairwiseOnDemand]: 261/275 looper letters, 103 selfloop transitions, 14 changer transitions 106/376 dead transitions. [2022-01-19 06:21:48,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 376 transitions, 1781 flow [2022-01-19 06:21:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 06:21:48,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 06:21:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2854 transitions. [2022-01-19 06:21:48,495 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6486363636363637 [2022-01-19 06:21:48,495 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2854 transitions. [2022-01-19 06:21:48,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2854 transitions. [2022-01-19 06:21:48,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:48,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2854 transitions. [2022-01-19 06:21:48,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 178.375) internal successors, (2854), 16 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:48,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 275.0) internal successors, (4675), 17 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:48,500 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 275.0) internal successors, (4675), 17 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:48,500 INFO L186 Difference]: Start difference. First operand has 273 places, 240 transitions, 922 flow. Second operand 16 states and 2854 transitions. [2022-01-19 06:21:48,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 376 transitions, 1781 flow [2022-01-19 06:21:48,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 376 transitions, 1747 flow, removed 7 selfloop flow, removed 9 redundant places. [2022-01-19 06:21:48,510 INFO L242 Difference]: Finished difference. Result has 284 places, 223 transitions, 850 flow [2022-01-19 06:21:48,510 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=850, PETRI_PLACES=284, PETRI_TRANSITIONS=223} [2022-01-19 06:21:48,510 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 49 predicate places. [2022-01-19 06:21:48,510 INFO L470 AbstractCegarLoop]: Abstraction has has 284 places, 223 transitions, 850 flow [2022-01-19 06:21:48,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 171.24137931034483) internal successors, (4966), 29 states have internal predecessors, (4966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:48,511 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:48,511 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:21:48,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:48,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:48,728 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:48,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:48,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1138114946, now seen corresponding path program 1 times [2022-01-19 06:21:48,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:48,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625119340] [2022-01-19 06:21:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:48,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:21:48,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:48,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625119340] [2022-01-19 06:21:48,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625119340] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:21:48,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:21:48,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 06:21:48,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434733666] [2022-01-19 06:21:48,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:21:48,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:21:48,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:48,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:21:48,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-19 06:21:48,821 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 275 [2022-01-19 06:21:48,822 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 223 transitions, 850 flow. Second operand has 7 states, 7 states have (on average 181.85714285714286) internal successors, (1273), 7 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:48,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:48,822 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 275 [2022-01-19 06:21:48,822 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:48,995 INFO L129 PetriNetUnfolder]: 105/1067 cut-off events. [2022-01-19 06:21:48,995 INFO L130 PetriNetUnfolder]: For 443/458 co-relation queries the response was YES. [2022-01-19 06:21:48,998 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1933 conditions, 1067 events. 105/1067 cut-off events. For 443/458 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6913 event pairs, 38 based on Foata normal form. 63/1093 useless extension candidates. Maximal degree in co-relation 1882. Up to 170 conditions per place. [2022-01-19 06:21:49,000 INFO L132 encePairwiseOnDemand]: 259/275 looper letters, 39 selfloop transitions, 18 changer transitions 5/241 dead transitions. [2022-01-19 06:21:49,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 241 transitions, 1021 flow [2022-01-19 06:21:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:21:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:21:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1138 transitions. [2022-01-19 06:21:49,001 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6896969696969697 [2022-01-19 06:21:49,001 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1138 transitions. [2022-01-19 06:21:49,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1138 transitions. [2022-01-19 06:21:49,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:49,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1138 transitions. [2022-01-19 06:21:49,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.66666666666666) internal successors, (1138), 6 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:49,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:49,003 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:49,003 INFO L186 Difference]: Start difference. First operand has 284 places, 223 transitions, 850 flow. Second operand 6 states and 1138 transitions. [2022-01-19 06:21:49,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 241 transitions, 1021 flow [2022-01-19 06:21:49,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 241 transitions, 978 flow, removed 6 selfloop flow, removed 13 redundant places. [2022-01-19 06:21:49,009 INFO L242 Difference]: Finished difference. Result has 258 places, 225 transitions, 862 flow [2022-01-19 06:21:49,009 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=862, PETRI_PLACES=258, PETRI_TRANSITIONS=225} [2022-01-19 06:21:49,009 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 23 predicate places. [2022-01-19 06:21:49,009 INFO L470 AbstractCegarLoop]: Abstraction has has 258 places, 225 transitions, 862 flow [2022-01-19 06:21:49,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 181.85714285714286) internal successors, (1273), 7 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:49,009 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:49,010 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 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] [2022-01-19 06:21:49,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 06:21:49,010 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:49,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:49,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1332168195, now seen corresponding path program 1 times [2022-01-19 06:21:49,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:49,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729080552] [2022-01-19 06:21:49,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:49,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:21:51,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:51,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729080552] [2022-01-19 06:21:51,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729080552] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:51,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752703670] [2022-01-19 06:21:51,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:51,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:51,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:51,662 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:51,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-19 06:21:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:51,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-19 06:21:51,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:51,914 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 7 treesize of output 6 [2022-01-19 06:21:52,456 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:52,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:52,534 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 13 treesize of output 15 [2022-01-19 06:21:52,648 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 13 treesize of output 15 [2022-01-19 06:21:52,892 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 16 treesize of output 12 [2022-01-19 06:21:53,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:21:53,124 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 19 treesize of output 21 [2022-01-19 06:21:53,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-01-19 06:21:57,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 06:21:57,345 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 19 treesize of output 21 [2022-01-19 06:22:01,467 INFO L353 Elim1Store]: treesize reduction 8, result has 55.6 percent of original size [2022-01-19 06:22:01,468 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 25 treesize of output 17 [2022-01-19 06:22:24,925 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 25 treesize of output 21 [2022-01-19 06:22:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:22:25,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:25,319 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28)) 0) (forall ((v_ArrVal_805 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_805) |c_t_funThread2of2ForFork0_~p~0#1.base|) (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2022-01-19 06:22:25,342 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_804 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_804) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28)) 0)) (forall ((v_ArrVal_805 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_805) |c_t_funThread2of2ForFork0_~p~0#1.base|) (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2022-01-19 06:22:25,405 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_805 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_805) |c_t_funThread2of2ForFork0_~p~0#1.base|) (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 4)) 0))) (forall ((v_ArrVal_804 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_#t~post33#1| 28) |c_~#a~0.offset| 28) v_ArrVal_804) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28)) 0))) is different from false [2022-01-19 06:22:25,417 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_805 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_805) |c_t_funThread2of2ForFork0_~p~0#1.base|) (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 4)) 0))) (forall ((v_ArrVal_804 Int)) (= 0 (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset| 28) v_ArrVal_804) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28) 28))))) is different from false [2022-01-19 06:22:25,429 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:22:25,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-01-19 06:22:25,437 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 06:22:25,437 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 39 treesize of output 42 [2022-01-19 06:22:25,440 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 22 treesize of output 18 [2022-01-19 06:22:27,571 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~i~0#1| Int)) (or (forall ((v_ArrVal_804 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset| 28) v_ArrVal_804) (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|) 28)) 0)) (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (= (+ |c_~#a~0.offset| (* 28 |t_funThread2of2ForFork0_~i~0#1|)) |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)))) is different from false [2022-01-19 06:22:29,838 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (v_ArrVal_804 Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28)) (.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (and (= (+ .cse0 |~#a~0.offset|) (+ .cse1 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 28 |~#a~0.offset|) v_ArrVal_804) (+ .cse1 28 |~#a~0.offset|)) 0)))) is different from false [2022-01-19 06:22:29,896 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_804 Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28)) (.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|))) (or (and (= (+ .cse0 |~#a~0.offset|) (+ .cse1 |~#a~0.offset|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_799) |c_~#a~0.base|) (+ .cse0 28 |~#a~0.offset|) v_ArrVal_804) (+ .cse1 28 |~#a~0.offset|)) 0)))) is different from false [2022-01-19 06:22:36,626 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 47 treesize of output 40 [2022-01-19 06:22:36,780 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:36,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:22:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-19 06:22:40,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752703670] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:40,009 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:40,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 21] total 60 [2022-01-19 06:22:40,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826451251] [2022-01-19 06:22:40,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:40,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-01-19 06:22:40,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:40,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-01-19 06:22:40,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2431, Unknown=33, NotChecked=756, Total=3540 [2022-01-19 06:22:40,013 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 275 [2022-01-19 06:22:40,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 225 transitions, 862 flow. Second operand has 60 states, 60 states have (on average 142.36666666666667) internal successors, (8542), 60 states have internal predecessors, (8542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:40,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:40,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 275 [2022-01-19 06:22:40,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:24:01,334 WARN L228 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 84 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:25:08,525 WARN L228 SmtUtils]: Spent 1.12m on a formula simplification. DAG size of input: 86 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-01-19 06:35:47,263 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 06:35:47,270 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 06:35:47,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-01-19 06:35:47,397 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 06:35:47,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-19 06:35:47,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-19 06:35:47,598 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. [2022-01-19 06:35:47,598 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-19 06:35:47,598 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-19 06:35:47,598 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-19 06:35:47,598 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:35:47,599 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2022-01-19 06:35:47,599 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:35:47,600 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:35:47,600 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:35:47,600 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. [2022-01-19 06:35:47,600 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:35:47,600 INFO L732 BasicCegarLoop]: Path program histogram: [] [2022-01-19 06:35:47,600 INFO L309 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2022-01-19 06:35:47,600 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-01-19 06:35:47,600 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 06:35:47,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 06:35:47 BasicIcfg [2022-01-19 06:35:47,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 06:35:47,604 INFO L158 Benchmark]: Toolchain (without parser) took 873814.99ms. Allocated memory was 375.4MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 320.2MB in the beginning and 901.6MB in the end (delta: -581.4MB). Peak memory consumption was 522.4MB. Max. memory is 16.0GB. [2022-01-19 06:35:47,604 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 375.4MB. Free memory is still 338.4MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 06:35:47,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.54ms. Allocated memory is still 375.4MB. Free memory was 320.0MB in the beginning and 327.9MB in the end (delta: -7.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.0GB. [2022-01-19 06:35:47,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.93ms. Allocated memory is still 375.4MB. Free memory was 327.9MB in the beginning and 324.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:35:47,605 INFO L158 Benchmark]: Boogie Preprocessor took 33.28ms. Allocated memory is still 375.4MB. Free memory was 324.8MB in the beginning and 323.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:35:47,605 INFO L158 Benchmark]: RCFGBuilder took 356.67ms. Allocated memory is still 375.4MB. Free memory was 323.7MB in the beginning and 304.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-19 06:35:47,605 INFO L158 Benchmark]: TraceAbstraction took 872930.97ms. Allocated memory was 375.4MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 303.8MB in the beginning and 901.6MB in the end (delta: -597.8MB). Peak memory consumption was 506.3MB. Max. memory is 16.0GB. [2022-01-19 06:35:47,606 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.09ms. Allocated memory is still 375.4MB. Free memory is still 338.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 435.54ms. Allocated memory is still 375.4MB. Free memory was 320.0MB in the beginning and 327.9MB in the end (delta: -7.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.93ms. Allocated memory is still 375.4MB. Free memory was 327.9MB in the beginning and 324.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.28ms. Allocated memory is still 375.4MB. Free memory was 324.8MB in the beginning and 323.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 356.67ms. Allocated memory is still 375.4MB. Free memory was 323.7MB in the beginning and 304.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 872930.97ms. Allocated memory was 375.4MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 303.8MB in the beginning and 901.6MB in the end (delta: -597.8MB). Peak memory consumption was 506.3MB. 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 - 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 - 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 - 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: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 153 known predicates. - TimeoutResultAtElement [Line: 954]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was constructing initial abstraction,while executing CegarLoopForPetriNet. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 231 locations, 4 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: 6.8s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 234 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 439 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 383 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 576 IncrementalHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 76 mSDtfsCounter, 576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 639 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542occurred in iteration=6, InterpolantAutomatonStates: 98, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1246 ConstructedInterpolants, 0 QuantifiedInterpolants, 6443 SizeOfPredicates, 29 NumberOfNonLiveVariables, 955 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 733/1114 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 292 locations, 5 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: 863.7s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 804.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3422 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3422 mSDsluCounter, 6102 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4417 IncrementalHoareTripleChecker+Unchecked, 5964 mSDsCounter, 408 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6410 IncrementalHoareTripleChecker+Invalid, 11235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 408 mSolverCounterUnsat, 345 mSDtfsCounter, 6410 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1822 GetRequests, 1426 SyntacticMatches, 30 SemanticMatches, 365 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 9488 ImplicationChecksByTransitivity, 828.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=989occurred in iteration=6, InterpolantAutomatonStates: 137, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 56.0s InterpolantComputationTime, 1979 NumberOfCodeBlocks, 1979 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2601 ConstructedInterpolants, 240 QuantifiedInterpolants, 30714 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1843 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 25 InterpolantComputations, 5 PerfectInterpolantSequences, 3104/3535 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 231 locations, 4 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: 2.2s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 16 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 472 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=647occurred in iteration=4, InterpolantAutomatonStates: 63, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 1005 SizeOfPredicates, 22 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 50/443 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 292 locations, 5 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: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown