./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 eb692b52 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-?-eb692b5 [2022-07-19 21:48:05,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:48:05,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:48:05,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:48:05,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:48:05,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:48:05,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:48:05,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:48:05,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:48:05,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:48:05,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:48:05,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:48:05,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:48:05,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:48:05,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:48:05,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:48:05,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:48:05,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:48:05,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:48:05,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:48:05,455 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:48:05,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:48:05,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:48:05,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:48:05,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:48:05,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:48:05,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:48:05,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:48:05,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:48:05,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:48:05,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:48:05,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:48:05,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:48:05,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:48:05,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:48:05,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:48:05,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:48:05,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:48:05,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:48:05,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:48:05,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:48:05,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:48:05,472 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:48:05,495 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:48:05,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:48:05,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:48:05,496 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:48:05,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:48:05,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:48:05,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:48:05,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:48:05,498 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:48:05,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:48:05,499 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:48:05,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:48:05,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:48:05,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:48:05,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:48:05,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:48:05,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:48:05,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:48:05,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:48:05,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:48:05,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:48:05,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:48:05,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:48:05,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:48:05,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:48:05,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:48:05,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:48:05,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:48:05,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:48:05,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:48:05,502 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:48:05,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:48:05,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:48:05,502 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 [2022-07-19 21:48:05,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:48:05,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:48:05,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:48:05,683 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:48:05,688 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:48:05,689 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 [2022-07-19 21:48:05,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511d95d90/1d336c40d0f64dbab9687f7841c30d9c/FLAG68dd2067f [2022-07-19 21:48:06,187 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:48:06,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2022-07-19 21:48:06,223 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511d95d90/1d336c40d0f64dbab9687f7841c30d9c/FLAG68dd2067f [2022-07-19 21:48:06,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511d95d90/1d336c40d0f64dbab9687f7841c30d9c [2022-07-19 21:48:06,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:48:06,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:48:06,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:48:06,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:48:06,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:48:06,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:48:06" (1/1) ... [2022-07-19 21:48:06,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd6af23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:06, skipping insertion in model container [2022-07-19 21:48:06,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:48:06" (1/1) ... [2022-07-19 21:48:06,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:48:06,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:48:07,068 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] [2022-07-19 21:48:07,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:48:07,086 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:48:07,113 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] [2022-07-19 21:48:07,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:48:07,148 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:48:07,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07 WrapperNode [2022-07-19 21:48:07,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:48:07,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:48:07,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:48:07,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:48:07,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (1/1) ... [2022-07-19 21:48:07,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (1/1) ... [2022-07-19 21:48:07,184 INFO L137 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-07-19 21:48:07,185 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:48:07,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:48:07,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:48:07,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:48:07,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (1/1) ... [2022-07-19 21:48:07,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (1/1) ... [2022-07-19 21:48:07,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (1/1) ... [2022-07-19 21:48:07,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (1/1) ... [2022-07-19 21:48:07,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (1/1) ... [2022-07-19 21:48:07,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (1/1) ... [2022-07-19 21:48:07,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (1/1) ... [2022-07-19 21:48:07,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:48:07,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:48:07,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:48:07,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:48:07,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (1/1) ... [2022-07-19 21:48:07,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:48:07,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:48:07,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 21:48:07,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 21:48:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:48:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:48:07,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 21:48:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:48:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-19 21:48:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-19 21:48:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-19 21:48:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-19 21:48:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:48:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-19 21:48:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:48:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:48:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:48:07,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:48:07,287 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:48:07,360 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:48:07,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:48:07,553 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:48:07,559 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:48:07,559 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-19 21:48:07,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:48:07 BoogieIcfgContainer [2022-07-19 21:48:07,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:48:07,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:48:07,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:48:07,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:48:07,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:48:06" (1/3) ... [2022-07-19 21:48:07,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7867af3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:48:07, skipping insertion in model container [2022-07-19 21:48:07,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:48:07" (2/3) ... [2022-07-19 21:48:07,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7867af3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:48:07, skipping insertion in model container [2022-07-19 21:48:07,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:48:07" (3/3) ... [2022-07-19 21:48:07,567 INFO L111 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2022-07-19 21:48:07,571 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:48:07,577 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:48:07,577 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:48:07,577 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:48:07,621 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-19 21:48:07,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 135 transitions, 286 flow [2022-07-19 21:48:07,708 INFO L129 PetriNetUnfolder]: 10/133 cut-off events. [2022-07-19 21:48:07,708 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 21:48:07,711 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 141 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 85. Up to 3 conditions per place. [2022-07-19 21:48:07,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 135 transitions, 286 flow [2022-07-19 21:48:07,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 121 transitions, 254 flow [2022-07-19 21:48:07,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:48:07,726 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@517750b6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34192879 [2022-07-19 21:48:07,726 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-07-19 21:48:07,746 INFO L129 PetriNetUnfolder]: 8/120 cut-off events. [2022-07-19 21:48:07,747 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 21:48:07,747 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:48:07,747 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:48:07,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:48:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:48:07,751 INFO L85 PathProgramCache]: Analyzing trace with hash 350379197, now seen corresponding path program 1 times [2022-07-19 21:48:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:48:07,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9729963] [2022-07-19 21:48:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:48:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:48:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:48:07,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:48:07,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9729963] [2022-07-19 21:48:07,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9729963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:48:07,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:48:07,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:48:07,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725204148] [2022-07-19 21:48:07,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:48:07,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 21:48:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:48:07,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 21:48:07,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 21:48:07,992 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 135 [2022-07-19 21:48:07,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 121 transitions, 254 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:07,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:48:07,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 135 [2022-07-19 21:48:07,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:48:08,053 INFO L129 PetriNetUnfolder]: 4/117 cut-off events. [2022-07-19 21:48:08,053 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-07-19 21:48:08,055 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 129 event pairs, 0 based on Foata normal form. 7/120 useless extension candidates. Maximal degree in co-relation 84. Up to 5 conditions per place. [2022-07-19 21:48:08,057 INFO L132 encePairwiseOnDemand]: 131/135 looper letters, 4 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2022-07-19 21:48:08,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 254 flow [2022-07-19 21:48:08,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 21:48:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-19 21:48:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2022-07-19 21:48:08,075 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2022-07-19 21:48:08,076 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2022-07-19 21:48:08,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2022-07-19 21:48:08,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:48:08,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2022-07-19 21:48:08,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,093 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,094 INFO L186 Difference]: Start difference. First operand has 120 places, 121 transitions, 254 flow. Second operand 2 states and 258 transitions. [2022-07-19 21:48:08,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 254 flow [2022-07-19 21:48:08,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 246 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-19 21:48:08,104 INFO L242 Difference]: Finished difference. Result has 117 places, 117 transitions, 238 flow [2022-07-19 21:48:08,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=238, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2022-07-19 21:48:08,108 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-07-19 21:48:08,109 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 238 flow [2022-07-19 21:48:08,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,110 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:48:08,110 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:48:08,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:48:08,110 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:48:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:48:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash -494092674, now seen corresponding path program 1 times [2022-07-19 21:48:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:48:08,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587022639] [2022-07-19 21:48:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:08,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:48:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:48:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:48:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:48:08,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587022639] [2022-07-19 21:48:08,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587022639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:48:08,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:48:08,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:48:08,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054435207] [2022-07-19 21:48:08,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:48:08,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:48:08,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:48:08,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:48:08,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:48:08,278 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 135 [2022-07-19 21:48:08,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:48:08,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 135 [2022-07-19 21:48:08,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:48:08,344 INFO L129 PetriNetUnfolder]: 18/200 cut-off events. [2022-07-19 21:48:08,344 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 21:48:08,345 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 551 event pairs, 3 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 240. Up to 22 conditions per place. [2022-07-19 21:48:08,346 INFO L132 encePairwiseOnDemand]: 132/135 looper letters, 12 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-07-19 21:48:08,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 275 flow [2022-07-19 21:48:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:48:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:48:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-07-19 21:48:08,348 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9185185185185185 [2022-07-19 21:48:08,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2022-07-19 21:48:08,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2022-07-19 21:48:08,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:48:08,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2022-07-19 21:48:08,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,352 INFO L186 Difference]: Start difference. First operand has 117 places, 117 transitions, 238 flow. Second operand 3 states and 372 transitions. [2022-07-19 21:48:08,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 275 flow [2022-07-19 21:48:08,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:48:08,356 INFO L242 Difference]: Finished difference. Result has 120 places, 118 transitions, 250 flow [2022-07-19 21:48:08,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=120, PETRI_TRANSITIONS=118} [2022-07-19 21:48:08,357 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2022-07-19 21:48:08,357 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 118 transitions, 250 flow [2022-07-19 21:48:08,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,358 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:48:08,358 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:48:08,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:48:08,358 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:48:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:48:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash -963664370, now seen corresponding path program 1 times [2022-07-19 21:48:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:48:08,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649267940] [2022-07-19 21:48:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:48:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:48:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:48:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:48:08,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649267940] [2022-07-19 21:48:08,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649267940] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:48:08,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286035230] [2022-07-19 21:48:08,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:08,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:48:08,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:48:08,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:48:08,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 21:48:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:48:08,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 21:48:08,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:48:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:48:08,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:48:08,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286035230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:48:08,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:48:08,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-19 21:48:08,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424163945] [2022-07-19 21:48:08,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:48:08,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:48:08,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:48:08,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:48:08,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:48:08,705 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 135 [2022-07-19 21:48:08,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 118 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:48:08,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 135 [2022-07-19 21:48:08,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:48:08,758 INFO L129 PetriNetUnfolder]: 20/195 cut-off events. [2022-07-19 21:48:08,758 INFO L130 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-07-19 21:48:08,761 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 545 event pairs, 7 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 241. Up to 28 conditions per place. [2022-07-19 21:48:08,762 INFO L132 encePairwiseOnDemand]: 132/135 looper letters, 15 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2022-07-19 21:48:08,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 123 transitions, 295 flow [2022-07-19 21:48:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:48:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:48:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2022-07-19 21:48:08,764 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9111111111111111 [2022-07-19 21:48:08,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2022-07-19 21:48:08,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2022-07-19 21:48:08,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:48:08,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2022-07-19 21:48:08,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,767 INFO L186 Difference]: Start difference. First operand has 120 places, 118 transitions, 250 flow. Second operand 3 states and 369 transitions. [2022-07-19 21:48:08,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 123 transitions, 295 flow [2022-07-19 21:48:08,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 123 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:48:08,772 INFO L242 Difference]: Finished difference. Result has 122 places, 119 transitions, 260 flow [2022-07-19 21:48:08,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=122, PETRI_TRANSITIONS=119} [2022-07-19 21:48:08,774 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 2 predicate places. [2022-07-19 21:48:08,774 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 260 flow [2022-07-19 21:48:08,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:08,774 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:48:08,775 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:48:08,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 21:48:08,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:48:08,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:48:08,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:48:08,992 INFO L85 PathProgramCache]: Analyzing trace with hash -786293827, now seen corresponding path program 1 times [2022-07-19 21:48:08,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:48:08,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061521245] [2022-07-19 21:48:08,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:08,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:48:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:48:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:48:09,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:48:09,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061521245] [2022-07-19 21:48:09,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061521245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:48:09,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276699502] [2022-07-19 21:48:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:09,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:48:09,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:48:09,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:48:09,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 21:48:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:48:09,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 21:48:09,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:48:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:48:09,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:48:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:48:09,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276699502] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:48:09,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:48:09,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-19 21:48:09,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225405310] [2022-07-19 21:48:09,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:48:09,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:48:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:48:09,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:48:09,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:48:09,288 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 135 [2022-07-19 21:48:09,292 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 119 transitions, 260 flow. Second operand has 9 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:09,292 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:48:09,292 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 135 [2022-07-19 21:48:09,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:48:09,396 INFO L129 PetriNetUnfolder]: 26/229 cut-off events. [2022-07-19 21:48:09,396 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-19 21:48:09,398 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 541 event pairs, 4 based on Foata normal form. 4/223 useless extension candidates. Maximal degree in co-relation 312. Up to 17 conditions per place. [2022-07-19 21:48:09,398 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 18 selfloop transitions, 9 changer transitions 0/134 dead transitions. [2022-07-19 21:48:09,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 134 transitions, 353 flow [2022-07-19 21:48:09,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:48:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:48:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1091 transitions. [2022-07-19 21:48:09,402 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8979423868312757 [2022-07-19 21:48:09,402 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1091 transitions. [2022-07-19 21:48:09,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1091 transitions. [2022-07-19 21:48:09,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:48:09,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1091 transitions. [2022-07-19 21:48:09,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.22222222222223) internal successors, (1091), 9 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:09,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:09,407 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:09,407 INFO L186 Difference]: Start difference. First operand has 122 places, 119 transitions, 260 flow. Second operand 9 states and 1091 transitions. [2022-07-19 21:48:09,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 134 transitions, 353 flow [2022-07-19 21:48:09,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 134 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:48:09,410 INFO L242 Difference]: Finished difference. Result has 132 places, 125 transitions, 308 flow [2022-07-19 21:48:09,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=308, PETRI_PLACES=132, PETRI_TRANSITIONS=125} [2022-07-19 21:48:09,411 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 12 predicate places. [2022-07-19 21:48:09,411 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 125 transitions, 308 flow [2022-07-19 21:48:09,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:09,412 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:48:09,412 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:48:09,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 21:48:09,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 21:48:09,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:48:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:48:09,633 INFO L85 PathProgramCache]: Analyzing trace with hash 211684319, now seen corresponding path program 2 times [2022-07-19 21:48:09,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:48:09,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860775455] [2022-07-19 21:48:09,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:09,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:48:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:48:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:48:09,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:48:09,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860775455] [2022-07-19 21:48:09,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860775455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:48:09,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947644165] [2022-07-19 21:48:09,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:48:09,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:48:09,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:48:09,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:48:09,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 21:48:09,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:48:09,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:48:09,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 21:48:09,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:48:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 21:48:09,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:48:09,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947644165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:48:09,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:48:09,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-07-19 21:48:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346986266] [2022-07-19 21:48:09,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:48:09,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 21:48:09,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:48:09,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 21:48:09,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:48:09,828 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 135 [2022-07-19 21:48:09,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 125 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:09,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:48:09,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 135 [2022-07-19 21:48:09,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:48:09,985 INFO L129 PetriNetUnfolder]: 307/1229 cut-off events. [2022-07-19 21:48:09,985 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-07-19 21:48:09,987 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 7002 event pairs, 41 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 1942. Up to 186 conditions per place. [2022-07-19 21:48:09,992 INFO L132 encePairwiseOnDemand]: 126/135 looper letters, 32 selfloop transitions, 18 changer transitions 0/160 dead transitions. [2022-07-19 21:48:09,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 160 transitions, 484 flow [2022-07-19 21:48:09,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:48:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:48:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions. [2022-07-19 21:48:09,994 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9005291005291005 [2022-07-19 21:48:09,994 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 851 transitions. [2022-07-19 21:48:09,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions. [2022-07-19 21:48:09,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:48:09,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions. [2022-07-19 21:48:09,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:09,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:09,999 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:09,999 INFO L186 Difference]: Start difference. First operand has 132 places, 125 transitions, 308 flow. Second operand 7 states and 851 transitions. [2022-07-19 21:48:09,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 160 transitions, 484 flow [2022-07-19 21:48:10,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 160 transitions, 478 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-19 21:48:10,005 INFO L242 Difference]: Finished difference. Result has 143 places, 143 transitions, 442 flow [2022-07-19 21:48:10,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=442, PETRI_PLACES=143, PETRI_TRANSITIONS=143} [2022-07-19 21:48:10,007 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 23 predicate places. [2022-07-19 21:48:10,008 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 143 transitions, 442 flow [2022-07-19 21:48:10,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:10,008 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:48:10,008 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:48:10,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 21:48:10,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:48:10,209 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:48:10,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:48:10,210 INFO L85 PathProgramCache]: Analyzing trace with hash -319465841, now seen corresponding path program 3 times [2022-07-19 21:48:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:48:10,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353309585] [2022-07-19 21:48:10,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:48:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:48:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 21:48:10,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:48:10,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353309585] [2022-07-19 21:48:10,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353309585] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:48:10,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414950501] [2022-07-19 21:48:10,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:48:10,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:48:10,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:48:10,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:48:10,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 21:48:10,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 21:48:10,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:48:10,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 21:48:10,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:48:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 21:48:10,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:48:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 21:48:10,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414950501] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:48:10,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:48:10,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-19 21:48:10,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819838126] [2022-07-19 21:48:10,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:48:10,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:48:10,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:48:10,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:48:10,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-19 21:48:10,507 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 135 [2022-07-19 21:48:10,508 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 143 transitions, 442 flow. Second operand has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:10,508 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:48:10,508 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 135 [2022-07-19 21:48:10,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:48:10,709 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([366] thread1EXIT-->L915-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem16#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][152], [26#L897true, 1953#(< thread2Thread1of1ForFork0_~j~0 3), 1116#(<= 1 ~num~0), Black: 1112#true, Black: 1264#(<= 0 ~num~0), Black: 1510#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1512#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), 119#L915-2true, Black: 1325#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), Black: 863#(< thread1Thread1of1ForFork1_~i~0 3), Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), 135#true, 439#true]) [2022-07-19 21:48:10,709 INFO L384 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-07-19 21:48:10,709 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-07-19 21:48:10,709 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-07-19 21:48:10,709 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-07-19 21:48:10,751 INFO L129 PetriNetUnfolder]: 329/1517 cut-off events. [2022-07-19 21:48:10,751 INFO L130 PetriNetUnfolder]: For 826/917 co-relation queries the response was YES. [2022-07-19 21:48:10,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 1517 events. 329/1517 cut-off events. For 826/917 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10186 event pairs, 29 based on Foata normal form. 58/1527 useless extension candidates. Maximal degree in co-relation 3130. Up to 171 conditions per place. [2022-07-19 21:48:10,760 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 22 selfloop transitions, 9 changer transitions 0/160 dead transitions. [2022-07-19 21:48:10,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 160 transitions, 547 flow [2022-07-19 21:48:10,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:48:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:48:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1077 transitions. [2022-07-19 21:48:10,762 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8864197530864197 [2022-07-19 21:48:10,762 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1077 transitions. [2022-07-19 21:48:10,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1077 transitions. [2022-07-19 21:48:10,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:48:10,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1077 transitions. [2022-07-19 21:48:10,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:10,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:10,765 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:10,765 INFO L186 Difference]: Start difference. First operand has 143 places, 143 transitions, 442 flow. Second operand 9 states and 1077 transitions. [2022-07-19 21:48:10,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 160 transitions, 547 flow [2022-07-19 21:48:10,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 160 transitions, 547 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:48:10,770 INFO L242 Difference]: Finished difference. Result has 154 places, 149 transitions, 492 flow [2022-07-19 21:48:10,771 INFO L262 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=492, PETRI_PLACES=154, PETRI_TRANSITIONS=149} [2022-07-19 21:48:10,771 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 34 predicate places. [2022-07-19 21:48:10,771 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 149 transitions, 492 flow [2022-07-19 21:48:10,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:10,772 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:48:10,772 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:48:10,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 21:48:10,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:48:10,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:48:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:48:10,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1389684193, now seen corresponding path program 4 times [2022-07-19 21:48:10,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:48:10,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060978223] [2022-07-19 21:48:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:10,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:48:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:48:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-19 21:48:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:48:11,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060978223] [2022-07-19 21:48:11,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060978223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:48:11,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:48:11,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:48:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173050519] [2022-07-19 21:48:11,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:48:11,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:48:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:48:11,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:48:11,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:48:11,025 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 135 [2022-07-19 21:48:11,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 149 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:11,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:48:11,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 135 [2022-07-19 21:48:11,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:48:11,134 INFO L129 PetriNetUnfolder]: 125/887 cut-off events. [2022-07-19 21:48:11,135 INFO L130 PetriNetUnfolder]: For 300/300 co-relation queries the response was YES. [2022-07-19 21:48:11,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 887 events. 125/887 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4606 event pairs, 14 based on Foata normal form. 92/979 useless extension candidates. Maximal degree in co-relation 1759. Up to 127 conditions per place. [2022-07-19 21:48:11,139 INFO L132 encePairwiseOnDemand]: 127/135 looper letters, 16 selfloop transitions, 8 changer transitions 0/141 dead transitions. [2022-07-19 21:48:11,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 141 transitions, 488 flow [2022-07-19 21:48:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:48:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:48:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2022-07-19 21:48:11,140 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8617283950617284 [2022-07-19 21:48:11,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2022-07-19 21:48:11,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2022-07-19 21:48:11,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:48:11,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2022-07-19 21:48:11,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:11,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:11,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:11,141 INFO L186 Difference]: Start difference. First operand has 154 places, 149 transitions, 492 flow. Second operand 3 states and 349 transitions. [2022-07-19 21:48:11,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 141 transitions, 488 flow [2022-07-19 21:48:11,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 141 transitions, 468 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-07-19 21:48:11,145 INFO L242 Difference]: Finished difference. Result has 152 places, 139 transitions, 430 flow [2022-07-19 21:48:11,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=152, PETRI_TRANSITIONS=139} [2022-07-19 21:48:11,146 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 32 predicate places. [2022-07-19 21:48:11,146 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 139 transitions, 430 flow [2022-07-19 21:48:11,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:11,146 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:48:11,146 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:48:11,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 21:48:11,146 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:48:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:48:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash -475481099, now seen corresponding path program 5 times [2022-07-19 21:48:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:48:11,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934940749] [2022-07-19 21:48:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:48:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:48:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 21:48:11,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:48:11,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934940749] [2022-07-19 21:48:11,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934940749] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:48:11,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296722573] [2022-07-19 21:48:11,244 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 21:48:11,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:48:11,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:48:11,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:48:11,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 21:48:11,388 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-19 21:48:11,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:48:11,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 21:48:11,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:48:11,467 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 21:48:11,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:48:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 21:48:11,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296722573] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:48:11,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:48:11,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 7 [2022-07-19 21:48:11,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892843639] [2022-07-19 21:48:11,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:48:11,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:48:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:48:11,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:48:11,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 21:48:11,533 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 135 [2022-07-19 21:48:11,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 139 transitions, 430 flow. Second operand has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:11,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:48:11,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 135 [2022-07-19 21:48:11,534 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:48:11,622 INFO L129 PetriNetUnfolder]: 43/438 cut-off events. [2022-07-19 21:48:11,622 INFO L130 PetriNetUnfolder]: For 181/181 co-relation queries the response was YES. [2022-07-19 21:48:11,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 881 conditions, 438 events. 43/438 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1301 event pairs, 3 based on Foata normal form. 26/462 useless extension candidates. Maximal degree in co-relation 865. Up to 57 conditions per place. [2022-07-19 21:48:11,624 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 18 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2022-07-19 21:48:11,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 144 transitions, 497 flow [2022-07-19 21:48:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:48:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-19 21:48:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 931 transitions. [2022-07-19 21:48:11,626 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.862037037037037 [2022-07-19 21:48:11,626 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 931 transitions. [2022-07-19 21:48:11,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 931 transitions. [2022-07-19 21:48:11,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:48:11,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 931 transitions. [2022-07-19 21:48:11,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:11,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 135.0) internal successors, (1215), 9 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:11,629 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 135.0) internal successors, (1215), 9 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:11,629 INFO L186 Difference]: Start difference. First operand has 152 places, 139 transitions, 430 flow. Second operand 8 states and 931 transitions. [2022-07-19 21:48:11,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 144 transitions, 497 flow [2022-07-19 21:48:11,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 144 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:48:11,632 INFO L242 Difference]: Finished difference. Result has 160 places, 137 transitions, 447 flow [2022-07-19 21:48:11,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=447, PETRI_PLACES=160, PETRI_TRANSITIONS=137} [2022-07-19 21:48:11,633 INFO L279 CegarLoopForPetriNet]: 120 programPoint places, 40 predicate places. [2022-07-19 21:48:11,633 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 137 transitions, 447 flow [2022-07-19 21:48:11,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 21:48:11,633 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:48:11,633 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:48:11,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-19 21:48:11,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:48:11,848 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-07-19 21:48:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:48:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1450931163, now seen corresponding path program 6 times [2022-07-19 21:48:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:48:11,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058155671] [2022-07-19 21:48:11,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:48:11,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:48:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:48:11,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 21:48:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:48:11,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 21:48:11,931 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 21:48:11,931 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-07-19 21:48:11,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-07-19 21:48:11,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-07-19 21:48:11,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 21:48:11,933 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-07-19 21:48:11,947 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-19 21:48:11,948 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 21:48:12,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:48:12 BasicIcfg [2022-07-19 21:48:12,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 21:48:12,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 21:48:12,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 21:48:12,038 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 21:48:12,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:48:07" (3/4) ... [2022-07-19 21:48:12,040 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 21:48:12,124 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 21:48:12,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 21:48:12,125 INFO L158 Benchmark]: Toolchain (without parser) took 5401.92ms. Allocated memory was 88.1MB in the beginning and 174.1MB in the end (delta: 86.0MB). Free memory was 51.5MB in the beginning and 92.7MB in the end (delta: -41.2MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2022-07-19 21:48:12,125 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 57.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 21:48:12,126 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.03ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 51.3MB in the beginning and 65.1MB in the end (delta: -13.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 21:48:12,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.22ms. Allocated memory is still 107.0MB. Free memory was 65.1MB in the beginning and 63.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:48:12,126 INFO L158 Benchmark]: Boogie Preprocessor took 24.65ms. Allocated memory is still 107.0MB. Free memory was 63.0MB in the beginning and 60.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 21:48:12,126 INFO L158 Benchmark]: RCFGBuilder took 350.22ms. Allocated memory is still 107.0MB. Free memory was 60.9MB in the beginning and 46.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 21:48:12,126 INFO L158 Benchmark]: TraceAbstraction took 4475.93ms. Allocated memory was 107.0MB in the beginning and 174.1MB in the end (delta: 67.1MB). Free memory was 45.9MB in the beginning and 115.7MB in the end (delta: -69.8MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2022-07-19 21:48:12,127 INFO L158 Benchmark]: Witness Printer took 86.72ms. Allocated memory is still 174.1MB. Free memory was 115.7MB in the beginning and 92.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-19 21:48:12,128 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.21ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 57.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.03ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 51.3MB in the beginning and 65.1MB in the end (delta: -13.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.22ms. Allocated memory is still 107.0MB. Free memory was 65.1MB in the beginning and 63.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.65ms. Allocated memory is still 107.0MB. Free memory was 63.0MB in the beginning and 60.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 350.22ms. Allocated memory is still 107.0MB. Free memory was 60.9MB in the beginning and 46.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4475.93ms. Allocated memory was 107.0MB in the beginning and 174.1MB in the end (delta: 67.1MB). Free memory was 45.9MB in the beginning and 115.7MB in the end (delta: -69.8MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * Witness Printer took 86.72ms. Allocated memory is still 174.1MB. Free memory was 115.7MB in the beginning and 92.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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)=9, 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] [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=0, m={3:0}, num=0, pthread_create(&t2, 0, thread2, 0)=10, t1={7:0}, t2={6:0}, total=0] [L882] 1 num++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, m={3:0}, num=0, num++=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=0, m={3:0}, num=0, num++=0, 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=0, j=0, m={3:0}, num=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=0, j=0, m={3:0}, num=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=0, 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=0, 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=0, 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=0, 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=0, j=1, j++=0, m={3:0}, num=0, total=0] [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=1, j=1, j++=0, m={3:0}, num=0, total=0] [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=1, j=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=1, j++=0, 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, 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=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] [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=2, m={3:0}, num=0, total=1] [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=2, 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=2, 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=2, 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=2, 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=2, m={3:0}, num=1, total=1] [L915] 0 \read(t1) VAL [\read(t1)=9, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=2, j=2, m={3:0}, num=1, t1={7:0}, t2={6: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=3, j=2, 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=2, 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=2, m={3:0}, num=1, total=1] [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=9, \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, t1={7:0}, t2={6:0}, 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)=10, \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)=10, \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.3s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 41 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1064 GetRequests, 1011 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=492occurred in iteration=6, InterpolantAutomatonStates: 44, 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, 0.9s InterpolantComputationTime, 1728 NumberOfCodeBlocks, 1728 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1952 ConstructedInterpolants, 0 QuantifiedInterpolants, 2928 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1657 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 470/493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 21:48:12,172 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