/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/pthread-deagle/arithmetic_prog_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 09:31:28,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 09:31:28,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 09:31:28,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 09:31:28,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 09:31:28,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 09:31:28,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 09:31:28,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 09:31:28,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 09:31:28,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 09:31:28,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 09:31:28,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 09:31:28,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 09:31:28,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 09:31:28,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 09:31:28,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 09:31:28,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 09:31:28,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 09:31:28,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 09:31:28,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 09:31:28,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 09:31:28,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 09:31:28,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 09:31:28,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 09:31:28,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 09:31:28,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 09:31:28,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 09:31:28,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 09:31:28,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 09:31:28,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 09:31:28,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 09:31:28,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 09:31:28,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 09:31:28,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 09:31:28,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 09:31:28,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 09:31:28,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 09:31:28,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 09:31:28,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 09:31:28,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 09:31:28,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 09:31:28,106 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 09:31:28,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 09:31:28,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 09:31:28,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 09:31:28,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 09:31:28,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 09:31:28,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 09:31:28,125 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 09:31:28,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 09:31:28,126 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 09:31:28,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 09:31:28,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 09:31:28,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 09:31:28,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 09:31:28,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 09:31:28,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 09:31:28,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 09:31:28,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 09:31:28,127 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 09:31:28,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 09:31:28,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 09:31:28,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 09:31:28,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 09:31:28,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 09:31:28,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 09:31:28,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 09:31:28,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 09:31:28,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 09:31:28,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 09:31:28,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 09:31:28,128 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 09:31:28,128 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 09:31:28,128 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 09:31:28,128 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 09:31:28,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 09:31:28,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 09:31:28,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 09:31:28,308 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 09:31:28,308 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 09:31:28,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-01-19 09:31:28,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9f24a7a/57cf838ea06f48dba2725de478dc8472/FLAGe1fe0d225 [2022-01-19 09:31:28,726 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 09:31:28,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-01-19 09:31:28,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9f24a7a/57cf838ea06f48dba2725de478dc8472/FLAGe1fe0d225 [2022-01-19 09:31:28,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a9f24a7a/57cf838ea06f48dba2725de478dc8472 [2022-01-19 09:31:28,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 09:31:28,756 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 09:31:28,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 09:31:28,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 09:31:28,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 09:31:28,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 09:31:28" (1/1) ... [2022-01-19 09:31:28,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ef288f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:28, skipping insertion in model container [2022-01-19 09:31:28,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 09:31:28" (1/1) ... [2022-01-19 09:31:28,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 09:31:28,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 09:31:29,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2022-01-19 09:31:29,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 09:31:29,061 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 09:31:29,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2022-01-19 09:31:29,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 09:31:29,117 INFO L208 MainTranslator]: Completed translation [2022-01-19 09:31:29,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29 WrapperNode [2022-01-19 09:31:29,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 09:31:29,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 09:31:29,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 09:31:29,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 09:31:29,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (1/1) ... [2022-01-19 09:31:29,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (1/1) ... [2022-01-19 09:31:29,152 INFO L137 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-01-19 09:31:29,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 09:31:29,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 09:31:29,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 09:31:29,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 09:31:29,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (1/1) ... [2022-01-19 09:31:29,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (1/1) ... [2022-01-19 09:31:29,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (1/1) ... [2022-01-19 09:31:29,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (1/1) ... [2022-01-19 09:31:29,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (1/1) ... [2022-01-19 09:31:29,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (1/1) ... [2022-01-19 09:31:29,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (1/1) ... [2022-01-19 09:31:29,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 09:31:29,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 09:31:29,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 09:31:29,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 09:31:29,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (1/1) ... [2022-01-19 09:31:29,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 09:31:29,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:31:29,198 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 09:31:29,203 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 09:31:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 09:31:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 09:31:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-19 09:31:29,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 09:31:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 09:31:29,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 09:31:29,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 09:31:29,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 09:31:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 09:31:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 09:31:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 09:31:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 09:31:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 09:31:29,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 09:31:29,230 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 09:31:29,317 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 09:31:29,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 09:31:29,541 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 09:31:29,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 09:31:29,547 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 09:31:29,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 09:31:29 BoogieIcfgContainer [2022-01-19 09:31:29,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 09:31:29,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 09:31:29,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 09:31:29,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 09:31:29,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 09:31:28" (1/3) ... [2022-01-19 09:31:29,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ff7013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 09:31:29, skipping insertion in model container [2022-01-19 09:31:29,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:31:29" (2/3) ... [2022-01-19 09:31:29,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ff7013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 09:31:29, skipping insertion in model container [2022-01-19 09:31:29,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 09:31:29" (3/3) ... [2022-01-19 09:31:29,559 INFO L111 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2022-01-19 09:31:29,563 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 09:31:29,563 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 09:31:29,563 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 09:31:29,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,611 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,611 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,611 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,611 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,611 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,612 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,612 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,612 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,612 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,612 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,612 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,612 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,613 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,613 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,614 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,615 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,615 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,616 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,616 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,616 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,616 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,616 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,616 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,616 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,616 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,616 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,617 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,617 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,617 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,617 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,618 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,618 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,618 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,618 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,618 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,618 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,618 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,619 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,619 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,619 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,620 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,620 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,622 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,622 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,623 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,623 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,624 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,629 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,633 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,633 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,633 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,634 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,634 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,635 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,637 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,638 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,638 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,638 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,638 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,638 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,638 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,638 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,638 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:31:29,644 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 09:31:29,688 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 09:31:29,693 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 09:31:29,693 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 09:31:29,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 135 transitions, 286 flow [2022-01-19 09:31:29,764 INFO L129 PetriNetUnfolder]: 10/133 cut-off events. [2022-01-19 09:31:29,764 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 09:31:29,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 133 events. 10/133 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 140 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 85. Up to 3 conditions per place. [2022-01-19 09:31:29,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 135 transitions, 286 flow [2022-01-19 09:31:29,772 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 121 transitions, 254 flow [2022-01-19 09:31:29,805 INFO L129 PetriNetUnfolder]: 8/120 cut-off events. [2022-01-19 09:31:29,805 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 09:31:29,806 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:31:29,806 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:31:29,806 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:31:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:31:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash 546892702, now seen corresponding path program 1 times [2022-01-19 09:31:29,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:31:29,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985257245] [2022-01-19 09:31:29,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:29,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:31:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:30,024 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 09:31:30,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:31:30,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985257245] [2022-01-19 09:31:30,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985257245] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:31:30,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:31:30,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 09:31:30,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136154073] [2022-01-19 09:31:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:31:30,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 09:31:30,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:31:30,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 09:31:30,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 09:31:30,064 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 135 [2022-01-19 09:31:30,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 121 transitions, 254 flow. Second operand has 2 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,070 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:31:30,070 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 135 [2022-01-19 09:31:30,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:31:30,106 INFO L129 PetriNetUnfolder]: 4/117 cut-off events. [2022-01-19 09:31:30,106 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 09:31:30,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 117 events. 4/117 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 7/120 useless extension candidates. Maximal degree in co-relation 84. Up to 5 conditions per place. [2022-01-19 09:31:30,107 INFO L132 encePairwiseOnDemand]: 131/135 looper letters, 4 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2022-01-19 09:31:30,108 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 254 flow [2022-01-19 09:31:30,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 09:31:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 09:31:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2022-01-19 09:31:30,123 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2022-01-19 09:31:30,124 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2022-01-19 09:31:30,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2022-01-19 09:31:30,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:31:30,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2022-01-19 09:31:30,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,132 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,133 INFO L186 Difference]: Start difference. First operand has 120 places, 121 transitions, 254 flow. Second operand 2 states and 258 transitions. [2022-01-19 09:31:30,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 254 flow [2022-01-19 09:31:30,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 246 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 09:31:30,140 INFO L242 Difference]: Finished difference. Result has 117 places, 117 transitions, 238 flow [2022-01-19 09:31:30,141 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=238, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2022-01-19 09:31:30,144 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-01-19 09:31:30,145 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 238 flow [2022-01-19 09:31:30,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,145 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:31:30,145 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:31:30,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 09:31:30,146 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:31:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:31:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash -494092674, now seen corresponding path program 1 times [2022-01-19 09:31:30,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:31:30,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881960910] [2022-01-19 09:31:30,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:30,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:31:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:30,273 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 09:31:30,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:31:30,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881960910] [2022-01-19 09:31:30,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881960910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:31:30,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:31:30,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 09:31:30,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73264613] [2022-01-19 09:31:30,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:31:30,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 09:31:30,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:31:30,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 09:31:30,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 09:31:30,277 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 135 [2022-01-19 09:31:30,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:31:30,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 135 [2022-01-19 09:31:30,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:31:30,338 INFO L129 PetriNetUnfolder]: 18/200 cut-off events. [2022-01-19 09:31:30,338 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 09:31:30,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 200 events. 18/200 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 549 event pairs, 3 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 240. Up to 22 conditions per place. [2022-01-19 09:31:30,342 INFO L132 encePairwiseOnDemand]: 132/135 looper letters, 12 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-01-19 09:31:30,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 275 flow [2022-01-19 09:31:30,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 09:31:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 09:31:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-01-19 09:31:30,347 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9185185185185185 [2022-01-19 09:31:30,347 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2022-01-19 09:31:30,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2022-01-19 09:31:30,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:31:30,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2022-01-19 09:31:30,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,352 INFO L186 Difference]: Start difference. First operand has 117 places, 117 transitions, 238 flow. Second operand 3 states and 372 transitions. [2022-01-19 09:31:30,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 275 flow [2022-01-19 09:31:30,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 09:31:30,360 INFO L242 Difference]: Finished difference. Result has 120 places, 118 transitions, 250 flow [2022-01-19 09:31:30,360 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=120, PETRI_TRANSITIONS=118} [2022-01-19 09:31:30,361 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2022-01-19 09:31:30,361 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 118 transitions, 250 flow [2022-01-19 09:31:30,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,362 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:31:30,362 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:31:30,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 09:31:30,362 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:31:30,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:31:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash -963664370, now seen corresponding path program 1 times [2022-01-19 09:31:30,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:31:30,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714070627] [2022-01-19 09:31:30,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:30,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:31:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:30,476 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 09:31:30,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:31:30,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714070627] [2022-01-19 09:31:30,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714070627] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:31:30,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388886831] [2022-01-19 09:31:30,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:30,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:30,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:31:30,480 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 09:31:30,514 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 09:31:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:30,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 09:31:30,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:31:30,768 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 09:31:30,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 09:31:30,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388886831] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:31:30,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 09:31:30,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 09:31:30,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559959775] [2022-01-19 09:31:30,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:31:30,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 09:31:30,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:31:30,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 09:31:30,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 09:31:30,771 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 135 [2022-01-19 09:31:30,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 118 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:31:30,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 135 [2022-01-19 09:31:30,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:31:30,800 INFO L129 PetriNetUnfolder]: 20/195 cut-off events. [2022-01-19 09:31:30,800 INFO L130 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-01-19 09:31:30,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 195 events. 20/195 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 547 event pairs, 7 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 241. Up to 28 conditions per place. [2022-01-19 09:31:30,802 INFO L132 encePairwiseOnDemand]: 132/135 looper letters, 15 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2022-01-19 09:31:30,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 123 transitions, 295 flow [2022-01-19 09:31:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 09:31:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 09:31:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2022-01-19 09:31:30,803 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9111111111111111 [2022-01-19 09:31:30,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2022-01-19 09:31:30,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2022-01-19 09:31:30,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:31:30,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2022-01-19 09:31:30,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,805 INFO L186 Difference]: Start difference. First operand has 120 places, 118 transitions, 250 flow. Second operand 3 states and 369 transitions. [2022-01-19 09:31:30,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 123 transitions, 295 flow [2022-01-19 09:31:30,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 123 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 09:31:30,808 INFO L242 Difference]: Finished difference. Result has 122 places, 119 transitions, 260 flow [2022-01-19 09:31:30,808 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=122, PETRI_TRANSITIONS=119} [2022-01-19 09:31:30,808 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 2 predicate places. [2022-01-19 09:31:30,808 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 260 flow [2022-01-19 09:31:30,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:30,809 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:31:30,809 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:31:30,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 09:31:31,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:31,024 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:31:31,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:31:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash -786293827, now seen corresponding path program 1 times [2022-01-19 09:31:31,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:31:31,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055994612] [2022-01-19 09:31:31,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:31,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:31:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:31,083 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 09:31:31,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:31:31,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055994612] [2022-01-19 09:31:31,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055994612] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:31:31,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073308263] [2022-01-19 09:31:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:31,084 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:31,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:31:31,085 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 09:31:31,086 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 09:31:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:31,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 09:31:31,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:31:31,329 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 09:31:31,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:31:31,482 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 09:31:31,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073308263] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:31:31,482 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:31:31,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-01-19 09:31:31,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478964786] [2022-01-19 09:31:31,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:31:31,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 09:31:31,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:31:31,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 09:31:31,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 09:31:31,485 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 135 [2022-01-19 09:31:31,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 119 transitions, 260 flow. Second operand has 9 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:31,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:31:31,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 135 [2022-01-19 09:31:31,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:31:31,566 INFO L129 PetriNetUnfolder]: 26/229 cut-off events. [2022-01-19 09:31:31,566 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 09:31:31,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 229 events. 26/229 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 540 event pairs, 4 based on Foata normal form. 4/223 useless extension candidates. Maximal degree in co-relation 312. Up to 17 conditions per place. [2022-01-19 09:31:31,568 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 18 selfloop transitions, 9 changer transitions 0/134 dead transitions. [2022-01-19 09:31:31,568 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 134 transitions, 353 flow [2022-01-19 09:31:31,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 09:31:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 09:31:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1091 transitions. [2022-01-19 09:31:31,571 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8979423868312757 [2022-01-19 09:31:31,571 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1091 transitions. [2022-01-19 09:31:31,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1091 transitions. [2022-01-19 09:31:31,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:31:31,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1091 transitions. [2022-01-19 09:31:31,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.22222222222223) internal successors, (1091), 9 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:31,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:31,604 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:31,604 INFO L186 Difference]: Start difference. First operand has 122 places, 119 transitions, 260 flow. Second operand 9 states and 1091 transitions. [2022-01-19 09:31:31,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 134 transitions, 353 flow [2022-01-19 09:31:31,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 134 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 09:31:31,607 INFO L242 Difference]: Finished difference. Result has 132 places, 125 transitions, 308 flow [2022-01-19 09:31:31,608 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=308, PETRI_PLACES=132, PETRI_TRANSITIONS=125} [2022-01-19 09:31:31,609 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 12 predicate places. [2022-01-19 09:31:31,609 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 125 transitions, 308 flow [2022-01-19 09:31:31,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:31,610 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:31:31,610 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:31,635 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 09:31:31,819 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,SelfDestructingSolverStorable3 [2022-01-19 09:31:31,820 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:31:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:31:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 211684319, now seen corresponding path program 2 times [2022-01-19 09:31:31,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:31:31,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196457441] [2022-01-19 09:31:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:31,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:31:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 09:31:31,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:31:31,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196457441] [2022-01-19 09:31:31,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196457441] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:31:31,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404919669] [2022-01-19 09:31:31,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 09:31:31,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:31,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:31:31,873 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 09:31:31,900 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 09:31:31,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 09:31:31,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:31:31,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 09:31:31,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:31:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 09:31:32,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 09:31:32,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404919669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:31:32,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 09:31:32,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-01-19 09:31:32,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566562428] [2022-01-19 09:31:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:31:32,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 09:31:32,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:31:32,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 09:31:32,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-19 09:31:32,137 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 135 [2022-01-19 09:31:32,137 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 125 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:32,137 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:31:32,137 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 135 [2022-01-19 09:31:32,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:31:32,277 INFO L129 PetriNetUnfolder]: 307/1229 cut-off events. [2022-01-19 09:31:32,277 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-01-19 09:31:32,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 1229 events. 307/1229 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7018 event pairs, 41 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 1942. Up to 186 conditions per place. [2022-01-19 09:31:32,284 INFO L132 encePairwiseOnDemand]: 126/135 looper letters, 32 selfloop transitions, 18 changer transitions 0/160 dead transitions. [2022-01-19 09:31:32,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 160 transitions, 484 flow [2022-01-19 09:31:32,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 09:31:32,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 09:31:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions. [2022-01-19 09:31:32,286 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9005291005291005 [2022-01-19 09:31:32,286 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 851 transitions. [2022-01-19 09:31:32,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions. [2022-01-19 09:31:32,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:31:32,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions. [2022-01-19 09:31:32,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:32,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:32,290 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:32,290 INFO L186 Difference]: Start difference. First operand has 132 places, 125 transitions, 308 flow. Second operand 7 states and 851 transitions. [2022-01-19 09:31:32,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 160 transitions, 484 flow [2022-01-19 09:31:32,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 160 transitions, 478 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 09:31:32,296 INFO L242 Difference]: Finished difference. Result has 143 places, 143 transitions, 442 flow [2022-01-19 09:31:32,296 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=442, PETRI_PLACES=143, PETRI_TRANSITIONS=143} [2022-01-19 09:31:32,298 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 23 predicate places. [2022-01-19 09:31:32,298 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 143 transitions, 442 flow [2022-01-19 09:31:32,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:32,299 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:31:32,299 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:31:32,319 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 09:31:32,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:32,516 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:31:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:31:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1479845303, now seen corresponding path program 3 times [2022-01-19 09:31:32,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:31:32,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278255336] [2022-01-19 09:31:32,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:32,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:31:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 09:31:32,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:31:32,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278255336] [2022-01-19 09:31:32,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278255336] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:31:32,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009691266] [2022-01-19 09:31:32,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 09:31:32,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:32,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:31:32,581 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 09:31:32,582 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 09:31:32,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-19 09:31:32,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:31:32,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 09:31:32,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:31:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-19 09:31:32,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 09:31:32,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009691266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:31:32,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 09:31:32,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-01-19 09:31:32,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492581076] [2022-01-19 09:31:32,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:31:32,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 09:31:32,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:31:32,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 09:31:32,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-19 09:31:32,881 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 135 [2022-01-19 09:31:32,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 143 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:32,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:31:32,882 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 135 [2022-01-19 09:31:32,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:31:33,059 INFO L129 PetriNetUnfolder]: 325/1306 cut-off events. [2022-01-19 09:31:33,059 INFO L130 PetriNetUnfolder]: For 1252/1377 co-relation queries the response was YES. [2022-01-19 09:31:33,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3013 conditions, 1306 events. 325/1306 cut-off events. For 1252/1377 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7155 event pairs, 12 based on Foata normal form. 90/1392 useless extension candidates. Maximal degree in co-relation 2999. Up to 159 conditions per place. [2022-01-19 09:31:33,068 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 33 selfloop transitions, 44 changer transitions 0/186 dead transitions. [2022-01-19 09:31:33,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 186 transitions, 809 flow [2022-01-19 09:31:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 09:31:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 09:31:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1179 transitions. [2022-01-19 09:31:33,071 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8733333333333333 [2022-01-19 09:31:33,071 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1179 transitions. [2022-01-19 09:31:33,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1179 transitions. [2022-01-19 09:31:33,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:31:33,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1179 transitions. [2022-01-19 09:31:33,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.9) internal successors, (1179), 10 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:33,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:33,075 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 135.0) internal successors, (1485), 11 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:33,075 INFO L186 Difference]: Start difference. First operand has 143 places, 143 transitions, 442 flow. Second operand 10 states and 1179 transitions. [2022-01-19 09:31:33,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 186 transitions, 809 flow [2022-01-19 09:31:33,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 186 transitions, 809 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 09:31:33,081 INFO L242 Difference]: Finished difference. Result has 159 places, 169 transitions, 765 flow [2022-01-19 09:31:33,081 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=765, PETRI_PLACES=159, PETRI_TRANSITIONS=169} [2022-01-19 09:31:33,081 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 39 predicate places. [2022-01-19 09:31:33,081 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 169 transitions, 765 flow [2022-01-19 09:31:33,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:33,082 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:31:33,082 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:31:33,109 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 09:31:33,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:33,309 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:31:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:31:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash 186061792, now seen corresponding path program 4 times [2022-01-19 09:31:33,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:31:33,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547092606] [2022-01-19 09:31:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:33,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:31:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-19 09:31:33,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:31:33,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547092606] [2022-01-19 09:31:33,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547092606] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:31:33,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:31:33,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 09:31:33,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612652218] [2022-01-19 09:31:33,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:31:33,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 09:31:33,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:31:33,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 09:31:33,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 09:31:33,349 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 135 [2022-01-19 09:31:33,349 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 169 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:33,349 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:31:33,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 135 [2022-01-19 09:31:33,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:31:33,457 INFO L129 PetriNetUnfolder]: 78/626 cut-off events. [2022-01-19 09:31:33,457 INFO L130 PetriNetUnfolder]: For 563/563 co-relation queries the response was YES. [2022-01-19 09:31:33,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 626 events. 78/626 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2554 event pairs, 6 based on Foata normal form. 61/687 useless extension candidates. Maximal degree in co-relation 1416. Up to 90 conditions per place. [2022-01-19 09:31:33,460 INFO L132 encePairwiseOnDemand]: 127/135 looper letters, 16 selfloop transitions, 8 changer transitions 0/137 dead transitions. [2022-01-19 09:31:33,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 137 transitions, 525 flow [2022-01-19 09:31:33,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 09:31:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 09:31:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2022-01-19 09:31:33,462 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8617283950617284 [2022-01-19 09:31:33,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2022-01-19 09:31:33,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2022-01-19 09:31:33,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:31:33,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2022-01-19 09:31:33,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:33,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:33,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:33,463 INFO L186 Difference]: Start difference. First operand has 159 places, 169 transitions, 765 flow. Second operand 3 states and 349 transitions. [2022-01-19 09:31:33,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 137 transitions, 525 flow [2022-01-19 09:31:33,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 137 transitions, 463 flow, removed 12 selfloop flow, removed 12 redundant places. [2022-01-19 09:31:33,467 INFO L242 Difference]: Finished difference. Result has 146 places, 135 transitions, 425 flow [2022-01-19 09:31:33,468 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=146, PETRI_TRANSITIONS=135} [2022-01-19 09:31:33,468 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 26 predicate places. [2022-01-19 09:31:33,468 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 135 transitions, 425 flow [2022-01-19 09:31:33,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:33,468 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:31:33,469 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:31:33,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 09:31:33,469 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:31:33,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:31:33,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1561621710, now seen corresponding path program 5 times [2022-01-19 09:31:33,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:31:33,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839403360] [2022-01-19 09:31:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:33,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:31:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:31:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 09:31:33,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:31:33,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839403360] [2022-01-19 09:31:33,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839403360] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:31:33,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118205968] [2022-01-19 09:31:33,525 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 09:31:33,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:33,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:31:33,526 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 09:31:33,527 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 09:31:33,620 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-19 09:31:33,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:31:33,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 09:31:33,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:31:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 09:31:33,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:31:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 09:31:33,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118205968] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:31:33,913 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:31:33,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-01-19 09:31:33,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206380499] [2022-01-19 09:31:33,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:31:33,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 09:31:33,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:31:33,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 09:31:33,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 09:31:33,917 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 135 [2022-01-19 09:31:33,918 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 135 transitions, 425 flow. Second operand has 9 states, 9 states have (on average 118.55555555555556) internal successors, (1067), 9 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:33,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:31:33,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 135 [2022-01-19 09:31:33,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:31:34,030 INFO L129 PetriNetUnfolder]: 117/877 cut-off events. [2022-01-19 09:31:34,030 INFO L130 PetriNetUnfolder]: For 369/369 co-relation queries the response was YES. [2022-01-19 09:31:34,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 877 events. 117/877 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4446 event pairs, 5 based on Foata normal form. 11/881 useless extension candidates. Maximal degree in co-relation 1767. Up to 114 conditions per place. [2022-01-19 09:31:34,035 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 19 selfloop transitions, 9 changer transitions 0/149 dead transitions. [2022-01-19 09:31:34,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 149 transitions, 515 flow [2022-01-19 09:31:34,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 09:31:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 09:31:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1074 transitions. [2022-01-19 09:31:34,037 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8839506172839506 [2022-01-19 09:31:34,037 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1074 transitions. [2022-01-19 09:31:34,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1074 transitions. [2022-01-19 09:31:34,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:31:34,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1074 transitions. [2022-01-19 09:31:34,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.33333333333333) internal successors, (1074), 9 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:34,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:34,041 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:34,041 INFO L186 Difference]: Start difference. First operand has 146 places, 135 transitions, 425 flow. Second operand 9 states and 1074 transitions. [2022-01-19 09:31:34,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 149 transitions, 515 flow [2022-01-19 09:31:34,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 149 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 09:31:34,045 INFO L242 Difference]: Finished difference. Result has 156 places, 141 transitions, 467 flow [2022-01-19 09:31:34,045 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=467, PETRI_PLACES=156, PETRI_TRANSITIONS=141} [2022-01-19 09:31:34,046 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 36 predicate places. [2022-01-19 09:31:34,046 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 141 transitions, 467 flow [2022-01-19 09:31:34,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.55555555555556) internal successors, (1067), 9 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 09:31:34,047 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:31:34,048 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 09:31:34,064 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 09:31:34,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:31:34,261 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 09:31:34,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:31:34,261 INFO L85 PathProgramCache]: Analyzing trace with hash 459318713, now seen corresponding path program 6 times [2022-01-19 09:31:34,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:31:34,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739997761] [2022-01-19 09:31:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:31:34,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:31:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 09:31:34,294 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 09:31:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 09:31:34,347 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 09:31:34,347 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 09:31:34,348 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 09:31:34,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-19 09:31:34,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-19 09:31:34,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 09:31:34,351 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-01-19 09:31:34,354 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 09:31:34,354 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 09:31:34,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 09:31:34 BasicIcfg [2022-01-19 09:31:34,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 09:31:34,440 INFO L158 Benchmark]: Toolchain (without parser) took 5683.01ms. Allocated memory was 392.2MB in the beginning and 505.4MB in the end (delta: 113.2MB). Free memory was 333.5MB in the beginning and 295.1MB in the end (delta: 38.3MB). Peak memory consumption was 152.8MB. Max. memory is 16.0GB. [2022-01-19 09:31:34,440 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 392.2MB. Free memory is still 351.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 09:31:34,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.20ms. Allocated memory was 392.2MB in the beginning and 505.4MB in the end (delta: 113.2MB). Free memory was 333.2MB in the beginning and 457.3MB in the end (delta: -124.1MB). Peak memory consumption was 7.1MB. Max. memory is 16.0GB. [2022-01-19 09:31:34,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.51ms. Allocated memory is still 505.4MB. Free memory was 457.3MB in the beginning and 455.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 09:31:34,440 INFO L158 Benchmark]: Boogie Preprocessor took 17.52ms. Allocated memory is still 505.4MB. Free memory was 455.2MB in the beginning and 453.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 09:31:34,442 INFO L158 Benchmark]: RCFGBuilder took 381.99ms. Allocated memory is still 505.4MB. Free memory was 453.1MB in the beginning and 437.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 09:31:34,442 INFO L158 Benchmark]: TraceAbstraction took 4885.34ms. Allocated memory is still 505.4MB. Free memory was 436.3MB in the beginning and 295.1MB in the end (delta: 141.2MB). Peak memory consumption was 144.3MB. Max. memory is 16.0GB. [2022-01-19 09:31:34,443 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 392.2MB. Free memory is still 351.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 359.20ms. Allocated memory was 392.2MB in the beginning and 505.4MB in the end (delta: 113.2MB). Free memory was 333.2MB in the beginning and 457.3MB in the end (delta: -124.1MB). Peak memory consumption was 7.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.51ms. Allocated memory is still 505.4MB. Free memory was 457.3MB in the beginning and 455.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 17.52ms. Allocated memory is still 505.4MB. Free memory was 455.2MB in the beginning and 453.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 381.99ms. Allocated memory is still 505.4MB. Free memory was 453.1MB in the beginning and 437.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 4885.34ms. Allocated memory is still 505.4MB. Free memory was 436.3MB in the beginning and 295.1MB in the end (delta: 141.2MB). Peak memory consumption was 144.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 - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; VAL [num=0] [L871] 0 unsigned long total; VAL [num=0, total=0] [L872] 0 int flag; VAL [flag=0, num=0, total=0] [L873] 0 pthread_mutex_t m; VAL [flag=0, m={3:0}, num=0, total=0] [L874] 0 pthread_cond_t empty, full; VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0] [L907] 0 pthread_t t1, t2; VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L908] 0 num = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L909] 0 total = 0 VAL [empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=0] [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, pthread_create(&t1, 0, thread1, 0)=-2, t1={7:0}, t2={6:0}, total=0] [L876] 1 int i; VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, m={3:0}, num=0, total=0] [L877] 1 i = 0 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, pthread_create(&t2, 0, thread2, 0)=-1, t1={7:0}, t2={6:0}, total=0] [L890] 2 int j; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, m={3:0}, num=1, total=0] [L891] 2 j = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=1, total=0] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=0] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=0] [L896] 2 total = total + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=1, total=1] [L897] 2 num-- VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=1, j=1, m={3:0}, num=0, total=1] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=0, total=1] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=1, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=1, m={3:0}, num=1, total=1] [L878] COND FALSE 1 !(i < 3) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=1, m={3:0}, num=1, total=1] [L887] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=1, m={3:0}, num=1, total=1] [L915] 0 \read(t1) VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=1, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=1, m={3:0}, num=1, t1={7:0}, t2={6:0}, total=1] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L892] COND TRUE 2 j < 3 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=1] [L896] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=1, total=3] [L897] 2 num-- VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=3] [L902] 2 total = total + j VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L903] 2 flag = 1 VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L904] 2 return ((void *)0); VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, total=6] [L916] 0 \read(t2) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=-1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L917] COND TRUE 0 \read(flag) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] [L919] 0 reach_error() VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=1, full={5:0}, i=3, j=3, m={3:0}, num=0, t1={7:0}, t2={6:0}, total=6] - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 171 locations, 3 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: 4.7s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 333 IncrementalHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 45 mSDtfsCounter, 333 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 911 GetRequests, 861 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=765occurred in iteration=6, InterpolantAutomatonStates: 46, 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.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1692 NumberOfCodeBlocks, 1692 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1774 ConstructedInterpolants, 0 QuantifiedInterpolants, 2538 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1630 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 272/356 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-19 09:31:34,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...