./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 16:57:04,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 16:57:04,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 16:57:04,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 16:57:05,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 16:57:05,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 16:57:05,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 16:57:05,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 16:57:05,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 16:57:05,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 16:57:05,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 16:57:05,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 16:57:05,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 16:57:05,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 16:57:05,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 16:57:05,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 16:57:05,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 16:57:05,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 16:57:05,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 16:57:05,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 16:57:05,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 16:57:05,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 16:57:05,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 16:57:05,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 16:57:05,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 16:57:05,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 16:57:05,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 16:57:05,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 16:57:05,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 16:57:05,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 16:57:05,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 16:57:05,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 16:57:05,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 16:57:05,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 16:57:05,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 16:57:05,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 16:57:05,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 16:57:05,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 16:57:05,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 16:57:05,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 16:57:05,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 16:57:05,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 16:57:05,066 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 16:57:05,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 16:57:05,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 16:57:05,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 16:57:05,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 16:57:05,069 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 16:57:05,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 16:57:05,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 16:57:05,070 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 16:57:05,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 16:57:05,070 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 16:57:05,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 16:57:05,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 16:57:05,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 16:57:05,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 16:57:05,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 16:57:05,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 16:57:05,072 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 16:57:05,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 16:57:05,072 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 16:57:05,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 16:57:05,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 16:57:05,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 16:57:05,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 16:57:05,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:57:05,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 16:57:05,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 16:57:05,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 16:57:05,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 16:57:05,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 16:57:05,074 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 16:57:05,075 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 16:57:05,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 16:57:05,075 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 16:57:05,075 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2021-12-14 16:57:05,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 16:57:05,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 16:57:05,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 16:57:05,264 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 16:57:05,264 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 16:57:05,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2021-12-14 16:57:05,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2461c40f4/6f9c8c4c12fd4983940feec18adea1b1/FLAG4489f6ee2 [2021-12-14 16:57:05,714 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 16:57:05,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2021-12-14 16:57:05,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2461c40f4/6f9c8c4c12fd4983940feec18adea1b1/FLAG4489f6ee2 [2021-12-14 16:57:05,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2461c40f4/6f9c8c4c12fd4983940feec18adea1b1 [2021-12-14 16:57:05,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 16:57:05,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 16:57:05,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 16:57:05,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 16:57:05,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 16:57:05,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:57:05" (1/1) ... [2021-12-14 16:57:05,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e74213f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:05, skipping insertion in model container [2021-12-14 16:57:05,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:57:05" (1/1) ... [2021-12-14 16:57:05,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 16:57:05,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 16:57:06,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2021-12-14 16:57:06,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:57:06,136 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 16:57:06,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2021-12-14 16:57:06,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 16:57:06,207 INFO L208 MainTranslator]: Completed translation [2021-12-14 16:57:06,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06 WrapperNode [2021-12-14 16:57:06,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 16:57:06,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 16:57:06,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 16:57:06,209 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 16:57:06,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (1/1) ... [2021-12-14 16:57:06,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (1/1) ... [2021-12-14 16:57:06,246 INFO L137 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2021-12-14 16:57:06,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 16:57:06,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 16:57:06,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 16:57:06,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 16:57:06,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (1/1) ... [2021-12-14 16:57:06,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (1/1) ... [2021-12-14 16:57:06,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (1/1) ... [2021-12-14 16:57:06,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (1/1) ... [2021-12-14 16:57:06,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (1/1) ... [2021-12-14 16:57:06,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (1/1) ... [2021-12-14 16:57:06,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (1/1) ... [2021-12-14 16:57:06,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 16:57:06,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 16:57:06,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 16:57:06,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 16:57:06,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (1/1) ... [2021-12-14 16:57:06,282 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 16:57:06,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:57:06,301 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) [2021-12-14 16:57:06,303 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 [2021-12-14 16:57:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 16:57:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 16:57:06,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 16:57:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 16:57:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-14 16:57:06,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-14 16:57:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-14 16:57:06,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-14 16:57:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 16:57:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-12-14 16:57:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 16:57:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 16:57:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 16:57:06,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 16:57:06,338 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-14 16:57:06,470 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 16:57:06,472 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 16:57:06,696 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 16:57:06,705 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 16:57:06,706 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-14 16:57:06,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:57:06 BoogieIcfgContainer [2021-12-14 16:57:06,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 16:57:06,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 16:57:06,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 16:57:06,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 16:57:06,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:57:05" (1/3) ... [2021-12-14 16:57:06,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230f7c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:57:06, skipping insertion in model container [2021-12-14 16:57:06,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:57:06" (2/3) ... [2021-12-14 16:57:06,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230f7c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:57:06, skipping insertion in model container [2021-12-14 16:57:06,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:57:06" (3/3) ... [2021-12-14 16:57:06,717 INFO L111 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2021-12-14 16:57:06,721 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-14 16:57:06,721 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 16:57:06,722 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 16:57:06,722 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-14 16:57:06,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,762 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,763 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,763 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,763 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,763 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,763 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,764 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,764 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,764 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,764 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,765 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,765 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,765 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,765 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,765 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,766 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,767 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,768 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,769 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,769 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,769 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,770 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,770 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,770 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,770 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,771 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,772 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,773 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,773 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,773 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,773 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,773 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,774 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,774 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,774 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,775 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,775 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,775 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,775 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,775 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,775 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,777 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,777 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,777 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,778 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,778 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,778 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,778 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,778 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,779 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,780 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,780 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,780 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,780 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,781 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,781 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,781 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,781 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,782 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,782 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,782 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,782 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,783 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,785 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,785 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,785 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,785 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,786 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,786 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,786 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,792 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,796 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,796 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,796 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,797 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,798 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,798 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,798 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,802 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,802 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,802 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,803 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,803 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-14 16:57:06,810 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-12-14 16:57:06,840 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 16:57:06,845 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=true, 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 [2021-12-14 16:57:06,845 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-12-14 16:57:06,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 135 transitions, 286 flow [2021-12-14 16:57:06,913 INFO L129 PetriNetUnfolder]: 10/133 cut-off events. [2021-12-14 16:57:06,914 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-14 16:57:06,917 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. [2021-12-14 16:57:06,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 135 transitions, 286 flow [2021-12-14 16:57:06,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 121 transitions, 254 flow [2021-12-14 16:57:06,949 INFO L129 PetriNetUnfolder]: 8/120 cut-off events. [2021-12-14 16:57:06,949 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-14 16:57:06,949 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:57:06,950 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] [2021-12-14 16:57:06,950 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-14 16:57:06,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:57:06,956 INFO L85 PathProgramCache]: Analyzing trace with hash 546892702, now seen corresponding path program 1 times [2021-12-14 16:57:06,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:57:06,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26367965] [2021-12-14 16:57:06,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:06,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:57:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:57:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:57:07,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:57:07,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26367965] [2021-12-14 16:57:07,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26367965] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:57:07,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:57:07,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 16:57:07,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153513596] [2021-12-14 16:57:07,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:57:07,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 16:57:07,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:57:07,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 16:57:07,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 16:57:07,188 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 135 [2021-12-14 16:57:07,190 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) [2021-12-14 16:57:07,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:57:07,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 135 [2021-12-14 16:57:07,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:57:07,228 INFO L129 PetriNetUnfolder]: 4/117 cut-off events. [2021-12-14 16:57:07,228 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-12-14 16:57:07,234 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. [2021-12-14 16:57:07,236 INFO L132 encePairwiseOnDemand]: 131/135 looper letters, 4 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2021-12-14 16:57:07,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 254 flow [2021-12-14 16:57:07,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 16:57:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-14 16:57:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2021-12-14 16:57:07,248 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2021-12-14 16:57:07,249 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2021-12-14 16:57:07,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2021-12-14 16:57:07,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:57:07,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2021-12-14 16:57:07,255 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) [2021-12-14 16:57:07,259 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) [2021-12-14 16:57:07,260 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) [2021-12-14 16:57:07,262 INFO L186 Difference]: Start difference. First operand has 120 places, 121 transitions, 254 flow. Second operand 2 states and 258 transitions. [2021-12-14 16:57:07,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 254 flow [2021-12-14 16:57:07,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 246 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-14 16:57:07,269 INFO L242 Difference]: Finished difference. Result has 117 places, 117 transitions, 238 flow [2021-12-14 16:57:07,270 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} [2021-12-14 16:57:07,273 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2021-12-14 16:57:07,273 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 238 flow [2021-12-14 16:57:07,274 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) [2021-12-14 16:57:07,274 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:57:07,274 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] [2021-12-14 16:57:07,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 16:57:07,275 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-14 16:57:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:57:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash -494092674, now seen corresponding path program 1 times [2021-12-14 16:57:07,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:57:07,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823838986] [2021-12-14 16:57:07,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:07,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:57:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:57:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:57:07,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:57:07,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823838986] [2021-12-14 16:57:07,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823838986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:57:07,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:57:07,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 16:57:07,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467814534] [2021-12-14 16:57:07,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:57:07,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:57:07,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:57:07,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:57:07,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 16:57:07,397 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 135 [2021-12-14 16:57:07,397 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) [2021-12-14 16:57:07,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:57:07,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 135 [2021-12-14 16:57:07,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:57:07,445 INFO L129 PetriNetUnfolder]: 18/200 cut-off events. [2021-12-14 16:57:07,445 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-14 16:57:07,446 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. [2021-12-14 16:57:07,446 INFO L132 encePairwiseOnDemand]: 132/135 looper letters, 12 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2021-12-14 16:57:07,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 275 flow [2021-12-14 16:57:07,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:57:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-14 16:57:07,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2021-12-14 16:57:07,450 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9185185185185185 [2021-12-14 16:57:07,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2021-12-14 16:57:07,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2021-12-14 16:57:07,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:57:07,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2021-12-14 16:57:07,452 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) [2021-12-14 16:57:07,453 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) [2021-12-14 16:57:07,454 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) [2021-12-14 16:57:07,454 INFO L186 Difference]: Start difference. First operand has 117 places, 117 transitions, 238 flow. Second operand 3 states and 372 transitions. [2021-12-14 16:57:07,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 275 flow [2021-12-14 16:57:07,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-14 16:57:07,456 INFO L242 Difference]: Finished difference. Result has 120 places, 118 transitions, 250 flow [2021-12-14 16:57:07,457 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} [2021-12-14 16:57:07,457 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2021-12-14 16:57:07,458 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 118 transitions, 250 flow [2021-12-14 16:57:07,458 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) [2021-12-14 16:57:07,458 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:57:07,458 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] [2021-12-14 16:57:07,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 16:57:07,459 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-14 16:57:07,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:57:07,459 INFO L85 PathProgramCache]: Analyzing trace with hash -963664370, now seen corresponding path program 1 times [2021-12-14 16:57:07,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:57:07,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551908038] [2021-12-14 16:57:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:07,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:57:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:57:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 16:57:07,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:57:07,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551908038] [2021-12-14 16:57:07,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551908038] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:57:07,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584252658] [2021-12-14 16:57:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:07,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:57:07,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:57:07,550 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) [2021-12-14 16:57:07,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 16:57:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:57:07,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 16:57:07,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:57:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 16:57:07,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:57:07,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584252658] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:57:07,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:57:07,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-12-14 16:57:07,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904917084] [2021-12-14 16:57:07,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:57:07,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:57:07,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:57:07,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:57:07,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 16:57:07,860 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 135 [2021-12-14 16:57:07,862 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) [2021-12-14 16:57:07,862 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:57:07,862 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 135 [2021-12-14 16:57:07,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:57:07,911 INFO L129 PetriNetUnfolder]: 20/195 cut-off events. [2021-12-14 16:57:07,911 INFO L130 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2021-12-14 16:57:07,914 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. [2021-12-14 16:57:07,915 INFO L132 encePairwiseOnDemand]: 132/135 looper letters, 15 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2021-12-14 16:57:07,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 123 transitions, 295 flow [2021-12-14 16:57:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:57:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-14 16:57:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2021-12-14 16:57:07,919 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9111111111111111 [2021-12-14 16:57:07,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2021-12-14 16:57:07,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2021-12-14 16:57:07,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:57:07,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2021-12-14 16:57:07,921 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) [2021-12-14 16:57:07,923 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) [2021-12-14 16:57:07,924 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) [2021-12-14 16:57:07,924 INFO L186 Difference]: Start difference. First operand has 120 places, 118 transitions, 250 flow. Second operand 3 states and 369 transitions. [2021-12-14 16:57:07,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 123 transitions, 295 flow [2021-12-14 16:57:07,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 123 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-14 16:57:07,930 INFO L242 Difference]: Finished difference. Result has 122 places, 119 transitions, 260 flow [2021-12-14 16:57:07,931 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} [2021-12-14 16:57:07,932 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 2 predicate places. [2021-12-14 16:57:07,932 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 260 flow [2021-12-14 16:57:07,933 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) [2021-12-14 16:57:07,933 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:57:07,933 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] [2021-12-14 16:57:07,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 16:57:08,136 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 [2021-12-14 16:57:08,136 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-14 16:57:08,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:57:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash -786293827, now seen corresponding path program 1 times [2021-12-14 16:57:08,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:57:08,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186868322] [2021-12-14 16:57:08,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:08,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:57:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:57:08,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 16:57:08,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:57:08,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186868322] [2021-12-14 16:57:08,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186868322] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:57:08,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594792394] [2021-12-14 16:57:08,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:08,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:57:08,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:57:08,266 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) [2021-12-14 16:57:08,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 16:57:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:57:08,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 16:57:08,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:57:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 16:57:08,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 16:57:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 16:57:08,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594792394] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 16:57:08,634 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 16:57:08,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-14 16:57:08,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767108052] [2021-12-14 16:57:08,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 16:57:08,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:57:08,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:57:08,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:57:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:57:08,637 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 135 [2021-12-14 16:57:08,638 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) [2021-12-14 16:57:08,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:57:08,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 135 [2021-12-14 16:57:08,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:57:08,713 INFO L129 PetriNetUnfolder]: 26/229 cut-off events. [2021-12-14 16:57:08,714 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-14 16:57:08,715 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. [2021-12-14 16:57:08,716 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 18 selfloop transitions, 9 changer transitions 0/134 dead transitions. [2021-12-14 16:57:08,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 134 transitions, 353 flow [2021-12-14 16:57:08,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:57:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:57:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1091 transitions. [2021-12-14 16:57:08,720 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8979423868312757 [2021-12-14 16:57:08,720 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1091 transitions. [2021-12-14 16:57:08,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1091 transitions. [2021-12-14 16:57:08,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:57:08,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1091 transitions. [2021-12-14 16:57:08,723 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) [2021-12-14 16:57:08,725 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) [2021-12-14 16:57:08,726 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) [2021-12-14 16:57:08,726 INFO L186 Difference]: Start difference. First operand has 122 places, 119 transitions, 260 flow. Second operand 9 states and 1091 transitions. [2021-12-14 16:57:08,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 134 transitions, 353 flow [2021-12-14 16:57:08,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 134 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-14 16:57:08,728 INFO L242 Difference]: Finished difference. Result has 132 places, 125 transitions, 308 flow [2021-12-14 16:57:08,728 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} [2021-12-14 16:57:08,729 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 12 predicate places. [2021-12-14 16:57:08,729 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 125 transitions, 308 flow [2021-12-14 16:57:08,730 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) [2021-12-14 16:57:08,730 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:57:08,730 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] [2021-12-14 16:57:08,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 16:57:08,943 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 [2021-12-14 16:57:08,944 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-14 16:57:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:57:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash 211684319, now seen corresponding path program 2 times [2021-12-14 16:57:08,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:57:08,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995692549] [2021-12-14 16:57:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:08,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:57:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:57:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 16:57:09,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:57:09,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995692549] [2021-12-14 16:57:09,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995692549] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:57:09,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395749226] [2021-12-14 16:57:09,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 16:57:09,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:57:09,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:57:09,008 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) [2021-12-14 16:57:09,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 16:57:09,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 16:57:09,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 16:57:09,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 16:57:09,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:57:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 16:57:09,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:57:09,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395749226] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:57:09,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:57:09,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2021-12-14 16:57:09,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761555177] [2021-12-14 16:57:09,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:57:09,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 16:57:09,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:57:09,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 16:57:09,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 16:57:09,299 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 135 [2021-12-14 16:57:09,299 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) [2021-12-14 16:57:09,300 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:57:09,300 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 135 [2021-12-14 16:57:09,300 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:57:09,470 INFO L129 PetriNetUnfolder]: 307/1229 cut-off events. [2021-12-14 16:57:09,471 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-12-14 16:57:09,474 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. [2021-12-14 16:57:09,479 INFO L132 encePairwiseOnDemand]: 126/135 looper letters, 32 selfloop transitions, 18 changer transitions 0/160 dead transitions. [2021-12-14 16:57:09,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 160 transitions, 484 flow [2021-12-14 16:57:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 16:57:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-14 16:57:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions. [2021-12-14 16:57:09,482 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9005291005291005 [2021-12-14 16:57:09,482 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 851 transitions. [2021-12-14 16:57:09,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions. [2021-12-14 16:57:09,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:57:09,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions. [2021-12-14 16:57:09,485 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) [2021-12-14 16:57:09,486 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) [2021-12-14 16:57:09,487 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) [2021-12-14 16:57:09,487 INFO L186 Difference]: Start difference. First operand has 132 places, 125 transitions, 308 flow. Second operand 7 states and 851 transitions. [2021-12-14 16:57:09,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 160 transitions, 484 flow [2021-12-14 16:57:09,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 160 transitions, 478 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-12-14 16:57:09,494 INFO L242 Difference]: Finished difference. Result has 143 places, 143 transitions, 442 flow [2021-12-14 16:57:09,494 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} [2021-12-14 16:57:09,496 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 23 predicate places. [2021-12-14 16:57:09,497 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 143 transitions, 442 flow [2021-12-14 16:57:09,497 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) [2021-12-14 16:57:09,497 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:57:09,497 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] [2021-12-14 16:57:09,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 16:57:09,703 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 [2021-12-14 16:57:09,704 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-14 16:57:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:57:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1479845303, now seen corresponding path program 3 times [2021-12-14 16:57:09,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:57:09,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717030872] [2021-12-14 16:57:09,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:09,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:57:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:57:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-14 16:57:09,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:57:09,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717030872] [2021-12-14 16:57:09,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717030872] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:57:09,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468859300] [2021-12-14 16:57:09,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 16:57:09,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:57:09,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:57:09,756 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) [2021-12-14 16:57:09,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 16:57:09,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-14 16:57:09,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 16:57:09,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 16:57:09,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:57:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 16:57:10,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 16:57:10,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468859300] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:57:10,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 16:57:10,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2021-12-14 16:57:10,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969989959] [2021-12-14 16:57:10,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:57:10,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 16:57:10,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:57:10,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 16:57:10,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:57:10,056 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 135 [2021-12-14 16:57:10,057 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) [2021-12-14 16:57:10,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:57:10,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 135 [2021-12-14 16:57:10,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:57:10,253 INFO L129 PetriNetUnfolder]: 325/1306 cut-off events. [2021-12-14 16:57:10,253 INFO L130 PetriNetUnfolder]: For 1252/1377 co-relation queries the response was YES. [2021-12-14 16:57:10,259 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. [2021-12-14 16:57:10,264 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 33 selfloop transitions, 44 changer transitions 0/186 dead transitions. [2021-12-14 16:57:10,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 186 transitions, 809 flow [2021-12-14 16:57:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 16:57:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-14 16:57:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1179 transitions. [2021-12-14 16:57:10,267 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8733333333333333 [2021-12-14 16:57:10,267 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1179 transitions. [2021-12-14 16:57:10,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1179 transitions. [2021-12-14 16:57:10,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:57:10,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1179 transitions. [2021-12-14 16:57:10,270 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) [2021-12-14 16:57:10,272 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) [2021-12-14 16:57:10,272 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) [2021-12-14 16:57:10,273 INFO L186 Difference]: Start difference. First operand has 143 places, 143 transitions, 442 flow. Second operand 10 states and 1179 transitions. [2021-12-14 16:57:10,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 186 transitions, 809 flow [2021-12-14 16:57:10,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 186 transitions, 809 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-14 16:57:10,281 INFO L242 Difference]: Finished difference. Result has 159 places, 169 transitions, 765 flow [2021-12-14 16:57:10,281 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} [2021-12-14 16:57:10,283 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 39 predicate places. [2021-12-14 16:57:10,283 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 169 transitions, 765 flow [2021-12-14 16:57:10,283 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) [2021-12-14 16:57:10,283 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:57:10,284 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] [2021-12-14 16:57:10,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 16:57:10,489 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 [2021-12-14 16:57:10,489 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-14 16:57:10,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:57:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash 186061792, now seen corresponding path program 4 times [2021-12-14 16:57:10,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:57:10,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405415563] [2021-12-14 16:57:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:10,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:57:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:57:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-14 16:57:10,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:57:10,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405415563] [2021-12-14 16:57:10,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405415563] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 16:57:10,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 16:57:10,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 16:57:10,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320105408] [2021-12-14 16:57:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 16:57:10,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 16:57:10,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:57:10,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 16:57:10,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 16:57:10,533 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 135 [2021-12-14 16:57:10,533 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) [2021-12-14 16:57:10,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:57:10,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 135 [2021-12-14 16:57:10,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:57:10,613 INFO L129 PetriNetUnfolder]: 78/626 cut-off events. [2021-12-14 16:57:10,613 INFO L130 PetriNetUnfolder]: For 563/563 co-relation queries the response was YES. [2021-12-14 16:57:10,615 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. [2021-12-14 16:57:10,617 INFO L132 encePairwiseOnDemand]: 127/135 looper letters, 16 selfloop transitions, 8 changer transitions 0/137 dead transitions. [2021-12-14 16:57:10,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 137 transitions, 525 flow [2021-12-14 16:57:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 16:57:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-14 16:57:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2021-12-14 16:57:10,618 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8617283950617284 [2021-12-14 16:57:10,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2021-12-14 16:57:10,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2021-12-14 16:57:10,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:57:10,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2021-12-14 16:57:10,620 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) [2021-12-14 16:57:10,620 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) [2021-12-14 16:57:10,621 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) [2021-12-14 16:57:10,621 INFO L186 Difference]: Start difference. First operand has 159 places, 169 transitions, 765 flow. Second operand 3 states and 349 transitions. [2021-12-14 16:57:10,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 137 transitions, 525 flow [2021-12-14 16:57:10,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 137 transitions, 463 flow, removed 12 selfloop flow, removed 12 redundant places. [2021-12-14 16:57:10,625 INFO L242 Difference]: Finished difference. Result has 146 places, 135 transitions, 425 flow [2021-12-14 16:57:10,626 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} [2021-12-14 16:57:10,626 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 26 predicate places. [2021-12-14 16:57:10,626 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 135 transitions, 425 flow [2021-12-14 16:57:10,627 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) [2021-12-14 16:57:10,627 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:57:10,627 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] [2021-12-14 16:57:10,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 16:57:10,627 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-14 16:57:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:57:10,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1561621710, now seen corresponding path program 5 times [2021-12-14 16:57:10,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:57:10,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528637964] [2021-12-14 16:57:10,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:10,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:57:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 16:57:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 16:57:10,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 16:57:10,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528637964] [2021-12-14 16:57:10,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528637964] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 16:57:10,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938988110] [2021-12-14 16:57:10,719 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-14 16:57:10,720 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 16:57:10,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 16:57:10,721 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) [2021-12-14 16:57:10,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 16:57:10,822 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-14 16:57:10,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 16:57:10,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 16:57:10,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 16:57:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 16:57:11,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 16:57:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-14 16:57:11,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938988110] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 16:57:11,209 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 16:57:11,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2021-12-14 16:57:11,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961474950] [2021-12-14 16:57:11,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 16:57:11,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 16:57:11,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 16:57:11,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 16:57:11,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-14 16:57:11,212 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 135 [2021-12-14 16:57:11,213 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) [2021-12-14 16:57:11,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-14 16:57:11,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 135 [2021-12-14 16:57:11,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-14 16:57:11,319 INFO L129 PetriNetUnfolder]: 117/877 cut-off events. [2021-12-14 16:57:11,319 INFO L130 PetriNetUnfolder]: For 369/369 co-relation queries the response was YES. [2021-12-14 16:57:11,322 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. [2021-12-14 16:57:11,325 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 19 selfloop transitions, 9 changer transitions 0/149 dead transitions. [2021-12-14 16:57:11,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 149 transitions, 515 flow [2021-12-14 16:57:11,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 16:57:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-14 16:57:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1074 transitions. [2021-12-14 16:57:11,327 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8839506172839506 [2021-12-14 16:57:11,327 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1074 transitions. [2021-12-14 16:57:11,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1074 transitions. [2021-12-14 16:57:11,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-14 16:57:11,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1074 transitions. [2021-12-14 16:57:11,329 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) [2021-12-14 16:57:11,331 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) [2021-12-14 16:57:11,331 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) [2021-12-14 16:57:11,331 INFO L186 Difference]: Start difference. First operand has 146 places, 135 transitions, 425 flow. Second operand 9 states and 1074 transitions. [2021-12-14 16:57:11,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 149 transitions, 515 flow [2021-12-14 16:57:11,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 149 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-14 16:57:11,335 INFO L242 Difference]: Finished difference. Result has 156 places, 141 transitions, 467 flow [2021-12-14 16:57:11,336 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} [2021-12-14 16:57:11,336 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 36 predicate places. [2021-12-14 16:57:11,336 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 141 transitions, 467 flow [2021-12-14 16:57:11,337 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) [2021-12-14 16:57:11,337 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-14 16:57:11,337 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] [2021-12-14 16:57:11,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 16:57:11,553 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 [2021-12-14 16:57:11,553 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-14 16:57:11,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 16:57:11,554 INFO L85 PathProgramCache]: Analyzing trace with hash 459318713, now seen corresponding path program 6 times [2021-12-14 16:57:11,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 16:57:11,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618034176] [2021-12-14 16:57:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 16:57:11,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 16:57:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:57:11,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-14 16:57:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-14 16:57:11,661 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-14 16:57:11,662 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-14 16:57:11,663 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-12-14 16:57:11,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2021-12-14 16:57:11,664 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2021-12-14 16:57:11,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 16:57:11,666 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2021-12-14 16:57:11,670 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-14 16:57:11,670 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 16:57:11,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:57:11 BasicIcfg [2021-12-14 16:57:11,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 16:57:11,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 16:57:11,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 16:57:11,767 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 16:57:11,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:57:06" (3/4) ... [2021-12-14 16:57:11,768 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-14 16:57:11,848 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 16:57:11,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 16:57:11,849 INFO L158 Benchmark]: Toolchain (without parser) took 6091.04ms. Allocated memory was 102.8MB in the beginning and 192.9MB in the end (delta: 90.2MB). Free memory was 72.7MB in the beginning and 131.5MB in the end (delta: -58.8MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2021-12-14 16:57:11,849 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory was 60.1MB in the beginning and 60.1MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:57:11,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.64ms. Allocated memory is still 102.8MB. Free memory was 72.4MB in the beginning and 63.5MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-14 16:57:11,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.36ms. Allocated memory is still 102.8MB. Free memory was 63.5MB in the beginning and 61.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-14 16:57:11,850 INFO L158 Benchmark]: Boogie Preprocessor took 22.04ms. Allocated memory is still 102.8MB. Free memory was 61.1MB in the beginning and 59.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 16:57:11,850 INFO L158 Benchmark]: RCFGBuilder took 438.07ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 59.6MB in the beginning and 103.2MB in the end (delta: -43.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2021-12-14 16:57:11,851 INFO L158 Benchmark]: TraceAbstraction took 5056.74ms. Allocated memory was 132.1MB in the beginning and 192.9MB in the end (delta: 60.8MB). Free memory was 102.0MB in the beginning and 155.6MB in the end (delta: -53.6MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2021-12-14 16:57:11,851 INFO L158 Benchmark]: Witness Printer took 82.05ms. Allocated memory is still 192.9MB. Free memory was 155.6MB in the beginning and 131.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-14 16:57:11,853 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.17ms. Allocated memory is still 102.8MB. Free memory was 60.1MB in the beginning and 60.1MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.64ms. Allocated memory is still 102.8MB. Free memory was 72.4MB in the beginning and 63.5MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.36ms. Allocated memory is still 102.8MB. Free memory was 63.5MB in the beginning and 61.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.04ms. Allocated memory is still 102.8MB. Free memory was 61.1MB in the beginning and 59.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 438.07ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 59.6MB in the beginning and 103.2MB in the end (delta: -43.6MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5056.74ms. Allocated memory was 132.1MB in the beginning and 192.9MB in the end (delta: 60.8MB). Free memory was 102.0MB in the beginning and 155.6MB in the end (delta: -53.6MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. * Witness Printer took 82.05ms. Allocated memory is still 192.9MB. Free memory was 155.6MB in the beginning and 131.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * 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.8s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, 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.2s 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.7s 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! [2021-12-14 16:57:11,903 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE