./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/23_lu-fig2.fixed.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-ext/23_lu-fig2.fixed.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 1e7e50acdaac6c5347f0e6861619a1b564ff01a6e5e780f6d69a20f7f739312d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:11:06,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:11:06,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:11:06,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:11:06,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:11:06,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:11:06,970 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:11:06,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:11:06,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:11:06,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:11:06,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:11:06,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:11:06,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:11:06,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:11:06,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:11:06,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:11:06,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:11:06,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:11:06,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:11:06,991 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:11:06,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:11:06,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:11:06,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:11:06,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:11:06,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:11:06,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:11:06,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:11:06,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:11:06,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:11:06,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:11:06,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:11:06,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:11:06,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:11:06,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:11:06,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:11:07,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:11:07,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:11:07,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:11:07,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:11:07,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:11:07,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:11:07,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:11:07,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:11:07,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:11:07,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:11:07,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:11:07,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:11:07,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:11:07,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:11:07,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:11:07,020 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:11:07,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:11:07,021 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:11:07,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:11:07,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:11:07,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:11:07,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:11:07,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:11:07,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:11:07,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:11:07,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:11:07,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:11:07,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:11:07,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:11:07,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:11:07,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:11:07,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:11:07,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:11:07,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:11:07,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:11:07,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:11:07,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:11:07,025 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:11:07,025 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:11:07,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:11:07,025 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 -> 1e7e50acdaac6c5347f0e6861619a1b564ff01a6e5e780f6d69a20f7f739312d [2022-02-20 20:11:07,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:11:07,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:11:07,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:11:07,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:11:07,210 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:11:07,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/23_lu-fig2.fixed.i [2022-02-20 20:11:07,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b144895/9f00c162971f4aa893dae8d99b25ec1f/FLAG92a52278a [2022-02-20 20:11:07,597 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:11:07,597 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/23_lu-fig2.fixed.i [2022-02-20 20:11:07,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b144895/9f00c162971f4aa893dae8d99b25ec1f/FLAG92a52278a [2022-02-20 20:11:08,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b144895/9f00c162971f4aa893dae8d99b25ec1f [2022-02-20 20:11:08,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:11:08,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:11:08,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:11:08,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:11:08,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:11:08,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0caf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08, skipping insertion in model container [2022-02-20 20:11:08,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:11:08,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:11:08,371 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-ext/23_lu-fig2.fixed.i[30382,30395] [2022-02-20 20:11:08,377 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-ext/23_lu-fig2.fixed.i[30752,30765] [2022-02-20 20:11:08,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:11:08,390 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:11:08,422 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-ext/23_lu-fig2.fixed.i[30382,30395] [2022-02-20 20:11:08,428 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-ext/23_lu-fig2.fixed.i[30752,30765] [2022-02-20 20:11:08,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:11:08,465 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:11:08,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08 WrapperNode [2022-02-20 20:11:08,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:11:08,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:11:08,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:11:08,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:11:08,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,520 INFO L137 Inliner]: procedures = 172, calls = 20, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 88 [2022-02-20 20:11:08,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:11:08,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:11:08,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:11:08,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:11:08,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:11:08,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:11:08,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:11:08,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:11:08,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (1/1) ... [2022-02-20 20:11:08,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:11:08,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:11:08,595 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-02-20 20:11:08,597 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-02-20 20:11:08,622 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-02-20 20:11:08,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-02-20 20:11:08,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:11:08,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:11:08,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:11:08,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:11:08,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:11:08,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:11:08,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:11:08,625 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-20 20:11:08,716 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:11:08,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:11:08,882 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:11:08,944 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:11:08,948 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 20:11:08,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:11:08 BoogieIcfgContainer [2022-02-20 20:11:08,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:11:08,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:11:08,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:11:08,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:11:08,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:11:08" (1/3) ... [2022-02-20 20:11:08,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af36195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:11:08, skipping insertion in model container [2022-02-20 20:11:08,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:11:08" (2/3) ... [2022-02-20 20:11:08,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af36195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:11:08, skipping insertion in model container [2022-02-20 20:11:08,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:11:08" (3/3) ... [2022-02-20 20:11:08,958 INFO L111 eAbstractionObserver]: Analyzing ICFG 23_lu-fig2.fixed.i [2022-02-20 20:11:08,962 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:11:08,962 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:11:08,963 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:11:08,963 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:11:08,991 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,992 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,992 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,992 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,992 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,992 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,993 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,993 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,993 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,993 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,994 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,994 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,994 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,994 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,995 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,995 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,996 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,996 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,996 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,996 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,996 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,996 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,997 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,998 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,998 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:08,998 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,000 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,000 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,000 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,000 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,001 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,001 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,001 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,001 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,033 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,033 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,033 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,033 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,033 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,034 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,034 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,034 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,034 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:11:09,035 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:11:09,066 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:11:09,070 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 20:11:09,071 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 20:11:09,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 117 flow [2022-02-20 20:11:09,096 INFO L129 PetriNetUnfolder]: 2/55 cut-off events. [2022-02-20 20:11:09,096 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:11:09,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 55 events. 2/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2022-02-20 20:11:09,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 56 transitions, 117 flow [2022-02-20 20:11:09,101 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 55 transitions, 113 flow [2022-02-20 20:11:09,106 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2022-02-20 20:11:09,107 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:11:09,107 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:11:09,107 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:11:09,108 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 1 more)] === [2022-02-20 20:11:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:11:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 33523167, now seen corresponding path program 1 times [2022-02-20 20:11:09,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:11:09,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993952670] [2022-02-20 20:11:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:11:09,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:11:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:11:09,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#true} [277] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {61#true} is VALID [2022-02-20 20:11:09,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#true} [269] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {61#true} is VALID [2022-02-20 20:11:09,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {61#true} [282] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {61#true} is VALID [2022-02-20 20:11:09,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {61#true} [284] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {61#true} is VALID [2022-02-20 20:11:09,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {61#true} [262] L16-->L16-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {61#true} is VALID [2022-02-20 20:11:09,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {61#true} [237] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {61#true} is VALID [2022-02-20 20:11:09,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {61#true} [288] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {61#true} is VALID [2022-02-20 20:11:09,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {61#true} [275] L16-3-->L16-4: Formula: (and (= 19 (select |v_#length_2| 2)) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {61#true} is VALID [2022-02-20 20:11:09,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {61#true} [276] L16-4-->L689: Formula: (= v_~mThread~0_2 0) InVars {} OutVars{~mThread~0=v_~mThread~0_2} AuxVars[] AssignedVars[~mThread~0] {61#true} is VALID [2022-02-20 20:11:09,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {61#true} [244] L689-->L690: Formula: (= v_~start_main~0_2 0) InVars {} OutVars{~start_main~0=v_~start_main~0_2} AuxVars[] AssignedVars[~start_main~0] {61#true} is VALID [2022-02-20 20:11:09,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {61#true} [279] L690-->L691: Formula: (= v_~mStartLock~0_6 0) InVars {} OutVars{~mStartLock~0=v_~mStartLock~0_6} AuxVars[] AssignedVars[~mStartLock~0] {61#true} is VALID [2022-02-20 20:11:09,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {61#true} [266] L691-->L-1-3: Formula: (= v_~__COUNT__~0_9 0) InVars {} OutVars{~__COUNT__~0=v_~__COUNT__~0_9} AuxVars[] AssignedVars[~__COUNT__~0] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {63#(= ~__COUNT__~0 0)} [285] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {63#(= ~__COUNT__~0 0)} [274] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {63#(= ~__COUNT__~0 0)} [248] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {63#(= ~__COUNT__~0 0)} [273] L-1-6-->L733: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~ret5#1.base=|v_ULTIMATE.start_main_#t~ret5#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, ULTIMATE.start_main_#t~ret5#1.offset=|v_ULTIMATE.start_main_#t~ret5#1.offset_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~ret5#1.base, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~ret5#1.offset, ULTIMATE.start_main_~#t~0#1.base, ULTIMATE.start_main_#t~pre3#1] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {63#(= ~__COUNT__~0 0)} [258] L733-->L733-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_4| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_4|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_4| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_4|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_4| 4) |v_#length_3|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_4| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_4|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {63#(= ~__COUNT__~0 0)} [239] L733-1-->L734: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {63#(= ~__COUNT__~0 0)} [259] L734-->L734-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {63#(= ~__COUNT__~0 0)} [263] L734-1-->L734-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_5|) |v_ULTIMATE.start_main_~#t~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {63#(= ~__COUNT__~0 0)} [302] L734-2-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_thr1Thread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_8|, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_4|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_4|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_4|, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1_6|, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1_6|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#in~arg#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_#in~arg#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {63#(= ~__COUNT__~0 0)} [292] thr1ENTRY-->L710: Formula: (and (= |v_thr1Thread1of1ForFork0_~arg#1.offset_1| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_1|) (= |v_thr1Thread1of1ForFork0_~arg#1.base_1| |v_thr1Thread1of1ForFork0_#in~arg#1.base_1|)) InVars {thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_1|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_1|} OutVars{thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_1|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_1|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_1|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {63#(= ~__COUNT__~0 0)} [293] L710-->L711: Formula: (= |v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_1| 1) InVars {} OutVars{thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {63#(= ~__COUNT__~0 0)} [294] L711-->L711-1: Formula: (and (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~mStartLock~0_54 1) (= (ite (= v_~mStartLock~0_55 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|)) InVars {~mStartLock~0=v_~mStartLock~0_55} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~mStartLock~0=v_~mStartLock~0_54} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~mStartLock~0] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {63#(= ~__COUNT__~0 0)} [295] L711-1-->L713: Formula: (= v_~start_main~0_1 1) InVars {} OutVars{~start_main~0=v_~start_main~0_1} AuxVars[] AssignedVars[~start_main~0] {63#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {63#(= ~__COUNT__~0 0)} [296] L713-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1_1| |v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_3|) (= |v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1_1| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1_1|) (not (= v_~__COUNT__~0_42 0))) InVars {~__COUNT__~0=v_~__COUNT__~0_42, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_3|} OutVars{thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1_1|, ~__COUNT__~0=v_~__COUNT__~0_42, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1_1|, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_3|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1] {62#false} is VALID [2022-02-20 20:11:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:11:09,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:11:09,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993952670] [2022-02-20 20:11:09,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993952670] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:11:09,307 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:11:09,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:11:09,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359715826] [2022-02-20 20:11:09,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:11:09,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 20:11:09,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:11:09,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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-02-20 20:11:09,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:11:09,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:11:09,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:11:09,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:11:09,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:11:09,374 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 56 [2022-02-20 20:11:09,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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-02-20 20:11:09,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:11:09,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 56 [2022-02-20 20:11:09,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:11:09,438 INFO L129 PetriNetUnfolder]: 11/86 cut-off events. [2022-02-20 20:11:09,438 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:11:09,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 86 events. 11/86 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs, 7 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 92. Up to 18 conditions per place. [2022-02-20 20:11:09,440 INFO L132 encePairwiseOnDemand]: 51/56 looper letters, 9 selfloop transitions, 2 changer transitions 11/56 dead transitions. [2022-02-20 20:11:09,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 139 flow [2022-02-20 20:11:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:11:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:11:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-20 20:11:09,462 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8988095238095238 [2022-02-20 20:11:09,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 151 transitions. [2022-02-20 20:11:09,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 151 transitions. [2022-02-20 20:11:09,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:11:09,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 151 transitions. [2022-02-20 20:11:09,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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-02-20 20:11:09,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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-02-20 20:11:09,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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-02-20 20:11:09,474 INFO L186 Difference]: Start difference. First operand has 57 places, 55 transitions, 113 flow. Second operand 3 states and 151 transitions. [2022-02-20 20:11:09,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 139 flow [2022-02-20 20:11:09,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:11:09,482 INFO L242 Difference]: Finished difference. Result has 57 places, 42 transitions, 90 flow [2022-02-20 20:11:09,484 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2022-02-20 20:11:09,487 INFO L334 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2022-02-20 20:11:09,488 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 42 transitions, 90 flow [2022-02-20 20:11:09,503 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 138 states, 137 states have (on average 1.7664233576642336) internal successors, (242), 137 states have internal predecessors, (242), 0 states have call successors, (0), 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-02-20 20:11:09,506 INFO L78 Accepts]: Start accepts. Automaton has has 138 states, 137 states have (on average 1.7664233576642336) internal successors, (242), 137 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 20:11:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:11:09,506 INFO L470 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 90 flow [2022-02-20 20:11:09,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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-02-20 20:11:09,507 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:11:09,507 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:11:09,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:11:09,507 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 1 more)] === [2022-02-20 20:11:09,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:11:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2076482913, now seen corresponding path program 1 times [2022-02-20 20:11:09,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:11:09,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611050005] [2022-02-20 20:11:09,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:11:09,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:11:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:11:09,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {204#true} [277] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {204#true} is VALID [2022-02-20 20:11:09,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} [269] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {204#true} is VALID [2022-02-20 20:11:09,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} [282] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {204#true} is VALID [2022-02-20 20:11:09,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {204#true} [284] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {204#true} is VALID [2022-02-20 20:11:09,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {204#true} [262] L16-->L16-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {204#true} is VALID [2022-02-20 20:11:09,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#true} [237] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {204#true} is VALID [2022-02-20 20:11:09,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {204#true} [288] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {204#true} is VALID [2022-02-20 20:11:09,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#true} [275] L16-3-->L16-4: Formula: (and (= 19 (select |v_#length_2| 2)) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {204#true} is VALID [2022-02-20 20:11:09,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#true} [276] L16-4-->L689: Formula: (= v_~mThread~0_2 0) InVars {} OutVars{~mThread~0=v_~mThread~0_2} AuxVars[] AssignedVars[~mThread~0] {204#true} is VALID [2022-02-20 20:11:09,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#true} [244] L689-->L690: Formula: (= v_~start_main~0_2 0) InVars {} OutVars{~start_main~0=v_~start_main~0_2} AuxVars[] AssignedVars[~start_main~0] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {206#(= ~start_main~0 0)} [279] L690-->L691: Formula: (= v_~mStartLock~0_6 0) InVars {} OutVars{~mStartLock~0=v_~mStartLock~0_6} AuxVars[] AssignedVars[~mStartLock~0] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {206#(= ~start_main~0 0)} [266] L691-->L-1-3: Formula: (= v_~__COUNT__~0_9 0) InVars {} OutVars{~__COUNT__~0=v_~__COUNT__~0_9} AuxVars[] AssignedVars[~__COUNT__~0] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {206#(= ~start_main~0 0)} [285] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {206#(= ~start_main~0 0)} [274] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {206#(= ~start_main~0 0)} [248] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {206#(= ~start_main~0 0)} [273] L-1-6-->L733: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~ret5#1.base=|v_ULTIMATE.start_main_#t~ret5#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, ULTIMATE.start_main_#t~ret5#1.offset=|v_ULTIMATE.start_main_#t~ret5#1.offset_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~ret5#1.base, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~ret5#1.offset, ULTIMATE.start_main_~#t~0#1.base, ULTIMATE.start_main_#t~pre3#1] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {206#(= ~start_main~0 0)} [258] L733-->L733-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_4| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_4|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_4| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_4|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_4| 4) |v_#length_3|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_4| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_4|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {206#(= ~start_main~0 0)} [239] L733-1-->L734: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {206#(= ~start_main~0 0)} [259] L734-->L734-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {206#(= ~start_main~0 0)} [263] L734-1-->L734-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_5|) |v_ULTIMATE.start_main_~#t~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {206#(= ~start_main~0 0)} [302] L734-2-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_thr1Thread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_8|, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_4|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_4|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_4|, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1_6|, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1_6|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#in~arg#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_#in~arg#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {206#(= ~start_main~0 0)} [260] L734-3-->L734-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {206#(= ~start_main~0 0)} [268] L734-4-->L735: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {206#(= ~start_main~0 0)} [283] L735-->L735-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {206#(= ~start_main~0 0)} [289] L735-1-->L735-2: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_1| 0) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_1| 0)) InVars {} OutVars{ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_1|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_#in~arg#1.base, ULTIMATE.start_thr2_#in~arg#1.offset] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {206#(= ~start_main~0 0)} [280] L735-2-->L735-3: Formula: true InVars {} OutVars{ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_3|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_#res#1.base, ULTIMATE.start_thr2_#res#1.offset] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {206#(= ~start_main~0 0)} [278] L735-3-->L723: Formula: true InVars {} OutVars{ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_1|, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_1|, ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_~self~0#1] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {206#(= ~start_main~0 0)} [286] L723-->L724: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_2| |v_ULTIMATE.start_thr2_~arg#1.offset_2|) (= |v_ULTIMATE.start_thr2_~arg#1.base_2| |v_ULTIMATE.start_thr2_#in~arg#1.base_2|)) InVars {ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_2|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_2|} OutVars{ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_2|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_2|, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_2|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_~arg#1.base] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {206#(= ~start_main~0 0)} [255] L724-->L725-2: Formula: (= |v_ULTIMATE.start_thr2_~self~0#1_3| v_~mThread~0_3) InVars {~mThread~0=v_~mThread~0_3} OutVars{ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_3|, ~mThread~0=v_~mThread~0_3} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~self~0#1] {206#(= ~start_main~0 0)} is VALID [2022-02-20 20:11:09,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {206#(= ~start_main~0 0)} [250] L725-2-->L725-3: Formula: (not (= v_~start_main~0_3 0)) InVars {~start_main~0=v_~start_main~0_3} OutVars{~start_main~0=v_~start_main~0_3} AuxVars[] AssignedVars[] {205#false} is VALID [2022-02-20 20:11:09,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {205#false} [241] L725-3-->L726: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (ite (= v_~mStartLock~0_73 0) 1 0)) (= v_~mStartLock~0_72 1)) InVars {~mStartLock~0=v_~mStartLock~0_73} OutVars{~mStartLock~0=v_~mStartLock~0_72, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ~mStartLock~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] {205#false} is VALID [2022-02-20 20:11:09,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {205#false} [256] L726-->L727: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| 0)) (= v_~mStartLock~0_66 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (= v_~mStartLock~0_67 1) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|)) InVars {~mStartLock~0=v_~mStartLock~0_67} OutVars{~mStartLock~0=v_~mStartLock~0_66, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ~mStartLock~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] {205#false} is VALID [2022-02-20 20:11:09,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {205#false} [246] L727-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1_15| |v_ULTIMATE.start_thr2_~self~0#1_16|) (= |v_ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1_15| |v_ULTIMATE.start___VERIFIER_atomic_thr2_~self#1_17|) (not (= v_~__COUNT__~0_46 1))) InVars {~__COUNT__~0=v_~__COUNT__~0_46, ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_16|} OutVars{~__COUNT__~0=v_~__COUNT__~0_46, ULTIMATE.start___VERIFIER_atomic_thr2_~self#1=|v_ULTIMATE.start___VERIFIER_atomic_thr2_~self#1_17|, ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1=|v_ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1_15|, ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_atomic_thr2_~self#1, ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1] {205#false} is VALID [2022-02-20 20:11:09,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:11:09,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:11:09,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611050005] [2022-02-20 20:11:09,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611050005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:11:09,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:11:09,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:11:09,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979903789] [2022-02-20 20:11:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:11:09,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 20:11:09,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:11:09,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-02-20 20:11:09,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:11:09,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:11:09,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:11:09,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:11:09,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:11:09,601 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 56 [2022-02-20 20:11:09,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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-02-20 20:11:09,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:11:09,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 56 [2022-02-20 20:11:09,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:11:09,633 INFO L129 PetriNetUnfolder]: 21/81 cut-off events. [2022-02-20 20:11:09,634 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-02-20 20:11:09,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 81 events. 21/81 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 123 event pairs, 8 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 111. Up to 30 conditions per place. [2022-02-20 20:11:09,634 INFO L132 encePairwiseOnDemand]: 52/56 looper letters, 9 selfloop transitions, 2 changer transitions 3/45 dead transitions. [2022-02-20 20:11:09,635 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 126 flow [2022-02-20 20:11:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:11:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:11:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2022-02-20 20:11:09,637 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2022-02-20 20:11:09,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2022-02-20 20:11:09,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2022-02-20 20:11:09,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:11:09,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2022-02-20 20:11:09,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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-02-20 20:11:09,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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-02-20 20:11:09,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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-02-20 20:11:09,639 INFO L186 Difference]: Start difference. First operand has 57 places, 42 transitions, 90 flow. Second operand 3 states and 141 transitions. [2022-02-20 20:11:09,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 126 flow [2022-02-20 20:11:09,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:11:09,641 INFO L242 Difference]: Finished difference. Result has 48 places, 42 transitions, 98 flow [2022-02-20 20:11:09,641 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2022-02-20 20:11:09,641 INFO L334 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2022-02-20 20:11:09,641 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 42 transitions, 98 flow [2022-02-20 20:11:09,645 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 122 states, 121 states have (on average 1.6942148760330578) internal successors, (205), 121 states have internal predecessors, (205), 0 states have call successors, (0), 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-02-20 20:11:09,645 INFO L78 Accepts]: Start accepts. Automaton has has 122 states, 121 states have (on average 1.6942148760330578) internal successors, (205), 121 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 20:11:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:11:09,645 INFO L470 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 98 flow [2022-02-20 20:11:09,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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-02-20 20:11:09,646 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:11:09,646 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:11:09,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:11:09,646 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 1 more)] === [2022-02-20 20:11:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:11:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1459735523, now seen corresponding path program 1 times [2022-02-20 20:11:09,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:11:09,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081729368] [2022-02-20 20:11:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:11:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:11:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:11:09,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#true} [277] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#true} is VALID [2022-02-20 20:11:09,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#true} [269] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {333#true} is VALID [2022-02-20 20:11:09,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {333#true} [282] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {333#true} is VALID [2022-02-20 20:11:09,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {333#true} [284] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {333#true} is VALID [2022-02-20 20:11:09,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {333#true} [262] L16-->L16-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {333#true} is VALID [2022-02-20 20:11:09,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {333#true} [237] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {333#true} is VALID [2022-02-20 20:11:09,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {333#true} [288] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {333#true} is VALID [2022-02-20 20:11:09,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {333#true} [275] L16-3-->L16-4: Formula: (and (= 19 (select |v_#length_2| 2)) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {333#true} is VALID [2022-02-20 20:11:09,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#true} [276] L16-4-->L689: Formula: (= v_~mThread~0_2 0) InVars {} OutVars{~mThread~0=v_~mThread~0_2} AuxVars[] AssignedVars[~mThread~0] {333#true} is VALID [2022-02-20 20:11:09,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {333#true} [244] L689-->L690: Formula: (= v_~start_main~0_2 0) InVars {} OutVars{~start_main~0=v_~start_main~0_2} AuxVars[] AssignedVars[~start_main~0] {333#true} is VALID [2022-02-20 20:11:09,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {333#true} [279] L690-->L691: Formula: (= v_~mStartLock~0_6 0) InVars {} OutVars{~mStartLock~0=v_~mStartLock~0_6} AuxVars[] AssignedVars[~mStartLock~0] {333#true} is VALID [2022-02-20 20:11:09,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {333#true} [266] L691-->L-1-3: Formula: (= v_~__COUNT__~0_9 0) InVars {} OutVars{~__COUNT__~0=v_~__COUNT__~0_9} AuxVars[] AssignedVars[~__COUNT__~0] {333#true} is VALID [2022-02-20 20:11:09,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {333#true} [285] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#true} is VALID [2022-02-20 20:11:09,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {333#true} [274] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#true} is VALID [2022-02-20 20:11:09,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {333#true} [248] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {333#true} is VALID [2022-02-20 20:11:09,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {333#true} [273] L-1-6-->L733: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~ret5#1.base=|v_ULTIMATE.start_main_#t~ret5#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, ULTIMATE.start_main_#t~ret5#1.offset=|v_ULTIMATE.start_main_#t~ret5#1.offset_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~ret5#1.base, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~ret5#1.offset, ULTIMATE.start_main_~#t~0#1.base, ULTIMATE.start_main_#t~pre3#1] {333#true} is VALID [2022-02-20 20:11:09,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {333#true} [258] L733-->L733-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_4| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_4|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_4| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_4|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_4| 4) |v_#length_3|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_4| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_4|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {333#true} is VALID [2022-02-20 20:11:09,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {333#true} [239] L733-1-->L734: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {333#true} is VALID [2022-02-20 20:11:09,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {333#true} [259] L734-->L734-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {333#true} is VALID [2022-02-20 20:11:09,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {333#true} [263] L734-1-->L734-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_5|) |v_ULTIMATE.start_main_~#t~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {333#true} is VALID [2022-02-20 20:11:09,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {333#true} [302] L734-2-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_thr1Thread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_8|, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_4|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_4|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_4|, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1_6|, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1_6|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#in~arg#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_#in~arg#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1] {333#true} is VALID [2022-02-20 20:11:09,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {333#true} [292] thr1ENTRY-->L710: Formula: (and (= |v_thr1Thread1of1ForFork0_~arg#1.offset_1| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_1|) (= |v_thr1Thread1of1ForFork0_~arg#1.base_1| |v_thr1Thread1of1ForFork0_#in~arg#1.base_1|)) InVars {thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_1|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_1|} OutVars{thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_1|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_1|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_1|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base] {333#true} is VALID [2022-02-20 20:11:09,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {333#true} [293] L710-->L711: Formula: (= |v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_1| 1) InVars {} OutVars{thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1] {333#true} is VALID [2022-02-20 20:11:09,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {333#true} [294] L711-->L711-1: Formula: (and (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~mStartLock~0_54 1) (= (ite (= v_~mStartLock~0_55 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|)) InVars {~mStartLock~0=v_~mStartLock~0_55} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~mStartLock~0=v_~mStartLock~0_54} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~mStartLock~0] {335#(not (= ~mStartLock~0 0))} is VALID [2022-02-20 20:11:09,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {335#(not (= ~mStartLock~0 0))} [295] L711-1-->L713: Formula: (= v_~start_main~0_1 1) InVars {} OutVars{~start_main~0=v_~start_main~0_1} AuxVars[] AssignedVars[~start_main~0] {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} is VALID [2022-02-20 20:11:09,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} [260] L734-3-->L734-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} is VALID [2022-02-20 20:11:09,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} [268] L734-4-->L735: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} is VALID [2022-02-20 20:11:09,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} [283] L735-->L735-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} is VALID [2022-02-20 20:11:09,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} [289] L735-1-->L735-2: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_1| 0) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_1| 0)) InVars {} OutVars{ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_1|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_#in~arg#1.base, ULTIMATE.start_thr2_#in~arg#1.offset] {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} is VALID [2022-02-20 20:11:09,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} [280] L735-2-->L735-3: Formula: true InVars {} OutVars{ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_3|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_#res#1.base, ULTIMATE.start_thr2_#res#1.offset] {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} is VALID [2022-02-20 20:11:09,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} [278] L735-3-->L723: Formula: true InVars {} OutVars{ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_1|, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_1|, ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_~self~0#1] {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} is VALID [2022-02-20 20:11:09,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} [286] L723-->L724: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_2| |v_ULTIMATE.start_thr2_~arg#1.offset_2|) (= |v_ULTIMATE.start_thr2_~arg#1.base_2| |v_ULTIMATE.start_thr2_#in~arg#1.base_2|)) InVars {ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_2|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_2|} OutVars{ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_2|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_2|, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_2|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_~arg#1.base] {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} is VALID [2022-02-20 20:11:09,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} [255] L724-->L725-2: Formula: (= |v_ULTIMATE.start_thr2_~self~0#1_3| v_~mThread~0_3) InVars {~mThread~0=v_~mThread~0_3} OutVars{ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_3|, ~mThread~0=v_~mThread~0_3} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~self~0#1] {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} is VALID [2022-02-20 20:11:09,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {336#(or (not (= ~mStartLock~0 0)) (= ~mStartLock~0 ~start_main~0))} [250] L725-2-->L725-3: Formula: (not (= v_~start_main~0_3 0)) InVars {~start_main~0=v_~start_main~0_3} OutVars{~start_main~0=v_~start_main~0_3} AuxVars[] AssignedVars[] {335#(not (= ~mStartLock~0 0))} is VALID [2022-02-20 20:11:09,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {335#(not (= ~mStartLock~0 0))} [241] L725-3-->L726: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (ite (= v_~mStartLock~0_73 0) 1 0)) (= v_~mStartLock~0_72 1)) InVars {~mStartLock~0=v_~mStartLock~0_73} OutVars{~mStartLock~0=v_~mStartLock~0_72, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ~mStartLock~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] {334#false} is VALID [2022-02-20 20:11:09,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {334#false} [256] L726-->L727: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| 0)) (= v_~mStartLock~0_66 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (= v_~mStartLock~0_67 1) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|)) InVars {~mStartLock~0=v_~mStartLock~0_67} OutVars{~mStartLock~0=v_~mStartLock~0_66, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ~mStartLock~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] {334#false} is VALID [2022-02-20 20:11:09,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {334#false} [246] L727-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1_15| |v_ULTIMATE.start_thr2_~self~0#1_16|) (= |v_ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1_15| |v_ULTIMATE.start___VERIFIER_atomic_thr2_~self#1_17|) (not (= v_~__COUNT__~0_46 1))) InVars {~__COUNT__~0=v_~__COUNT__~0_46, ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_16|} OutVars{~__COUNT__~0=v_~__COUNT__~0_46, ULTIMATE.start___VERIFIER_atomic_thr2_~self#1=|v_ULTIMATE.start___VERIFIER_atomic_thr2_~self#1_17|, ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1=|v_ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1_15|, ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_atomic_thr2_~self#1, ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1] {334#false} is VALID [2022-02-20 20:11:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:11:09,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:11:09,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081729368] [2022-02-20 20:11:09,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081729368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:11:09,730 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:11:09,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 20:11:09,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118560257] [2022-02-20 20:11:09,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:11:09,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 20:11:09,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:11:09,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-02-20 20:11:09,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:11:09,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 20:11:09,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:11:09,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 20:11:09,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 20:11:09,759 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 56 [2022-02-20 20:11:09,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 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-02-20 20:11:09,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:11:09,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 56 [2022-02-20 20:11:09,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:11:09,804 INFO L129 PetriNetUnfolder]: 8/60 cut-off events. [2022-02-20 20:11:09,804 INFO L130 PetriNetUnfolder]: For 12/17 co-relation queries the response was YES. [2022-02-20 20:11:09,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 60 events. 8/60 cut-off events. For 12/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 1 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 76. Up to 14 conditions per place. [2022-02-20 20:11:09,805 INFO L132 encePairwiseOnDemand]: 49/56 looper letters, 8 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2022-02-20 20:11:09,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 144 flow [2022-02-20 20:11:09,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 20:11:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-02-20 20:11:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-02-20 20:11:09,807 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8080357142857143 [2022-02-20 20:11:09,807 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 181 transitions. [2022-02-20 20:11:09,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 181 transitions. [2022-02-20 20:11:09,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:11:09,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 181 transitions. [2022-02-20 20:11:09,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 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-02-20 20:11:09,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 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-02-20 20:11:09,809 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 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-02-20 20:11:09,809 INFO L186 Difference]: Start difference. First operand has 48 places, 42 transitions, 98 flow. Second operand 4 states and 181 transitions. [2022-02-20 20:11:09,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 144 flow [2022-02-20 20:11:09,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:11:09,811 INFO L242 Difference]: Finished difference. Result has 50 places, 44 transitions, 125 flow [2022-02-20 20:11:09,811 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-02-20 20:11:09,812 INFO L334 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2022-02-20 20:11:09,812 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 44 transitions, 125 flow [2022-02-20 20:11:09,814 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 119 states, 118 states have (on average 1.6864406779661016) internal successors, (199), 118 states have internal predecessors, (199), 0 states have call successors, (0), 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-02-20 20:11:09,815 INFO L78 Accepts]: Start accepts. Automaton has has 119 states, 118 states have (on average 1.6864406779661016) internal successors, (199), 118 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-02-20 20:11:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:11:09,815 INFO L470 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 125 flow [2022-02-20 20:11:09,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 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-02-20 20:11:09,815 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:11:09,816 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:11:09,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:11:09,816 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 1 more)] === [2022-02-20 20:11:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:11:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1330142114, now seen corresponding path program 1 times [2022-02-20 20:11:09,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:11:09,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472436457] [2022-02-20 20:11:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:11:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:11:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:11:09,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {459#true} [277] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {459#true} is VALID [2022-02-20 20:11:09,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {459#true} [269] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {459#true} is VALID [2022-02-20 20:11:09,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {459#true} [282] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {459#true} is VALID [2022-02-20 20:11:09,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {459#true} [284] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {459#true} is VALID [2022-02-20 20:11:09,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {459#true} [262] L16-->L16-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {459#true} is VALID [2022-02-20 20:11:09,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {459#true} [237] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {459#true} is VALID [2022-02-20 20:11:09,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {459#true} [288] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {459#true} is VALID [2022-02-20 20:11:09,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {459#true} [275] L16-3-->L16-4: Formula: (and (= 19 (select |v_#length_2| 2)) (= (select |v_#valid_5| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {459#true} is VALID [2022-02-20 20:11:09,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#true} [276] L16-4-->L689: Formula: (= v_~mThread~0_2 0) InVars {} OutVars{~mThread~0=v_~mThread~0_2} AuxVars[] AssignedVars[~mThread~0] {459#true} is VALID [2022-02-20 20:11:09,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#true} [244] L689-->L690: Formula: (= v_~start_main~0_2 0) InVars {} OutVars{~start_main~0=v_~start_main~0_2} AuxVars[] AssignedVars[~start_main~0] {459#true} is VALID [2022-02-20 20:11:09,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {459#true} [279] L690-->L691: Formula: (= v_~mStartLock~0_6 0) InVars {} OutVars{~mStartLock~0=v_~mStartLock~0_6} AuxVars[] AssignedVars[~mStartLock~0] {459#true} is VALID [2022-02-20 20:11:09,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {459#true} [266] L691-->L-1-3: Formula: (= v_~__COUNT__~0_9 0) InVars {} OutVars{~__COUNT__~0=v_~__COUNT__~0_9} AuxVars[] AssignedVars[~__COUNT__~0] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {461#(= ~__COUNT__~0 0)} [285] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {461#(= ~__COUNT__~0 0)} [274] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {461#(= ~__COUNT__~0 0)} [248] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {461#(= ~__COUNT__~0 0)} [273] L-1-6-->L733: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~ret5#1.base=|v_ULTIMATE.start_main_#t~ret5#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|, ULTIMATE.start_main_#t~ret5#1.offset=|v_ULTIMATE.start_main_#t~ret5#1.offset_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~ret5#1.base, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~ret5#1.offset, ULTIMATE.start_main_~#t~0#1.base, ULTIMATE.start_main_#t~pre3#1] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {461#(= ~__COUNT__~0 0)} [258] L733-->L733-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_4| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_4|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_4| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_4|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_4| 4) |v_#length_3|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_4| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_4|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_4|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {461#(= ~__COUNT__~0 0)} [239] L733-1-->L734: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {461#(= ~__COUNT__~0 0)} [259] L734-->L734-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {461#(= ~__COUNT__~0 0)} [263] L734-1-->L734-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_5|) |v_ULTIMATE.start_main_~#t~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {461#(= ~__COUNT__~0 0)} [302] L734-2-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_thr1Thread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thr1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_4|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_8|, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_4|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_4|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_4|, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1_6|, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1_6|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of1ForFork0_#in~arg#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_#in~arg#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~arg#1.base, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {461#(= ~__COUNT__~0 0)} [260] L734-3-->L734-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {461#(= ~__COUNT__~0 0)} [268] L734-4-->L735: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {461#(= ~__COUNT__~0 0)} [283] L735-->L735-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {461#(= ~__COUNT__~0 0)} [289] L735-1-->L735-2: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_1| 0) (= |v_ULTIMATE.start_thr2_#in~arg#1.base_1| 0)) InVars {} OutVars{ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_1|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_#in~arg#1.base, ULTIMATE.start_thr2_#in~arg#1.offset] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {461#(= ~__COUNT__~0 0)} [280] L735-2-->L735-3: Formula: true InVars {} OutVars{ULTIMATE.start_thr2_#res#1.base=|v_ULTIMATE.start_thr2_#res#1.base_3|, ULTIMATE.start_thr2_#res#1.offset=|v_ULTIMATE.start_thr2_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_#res#1.base, ULTIMATE.start_thr2_#res#1.offset] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {461#(= ~__COUNT__~0 0)} [278] L735-3-->L723: Formula: true InVars {} OutVars{ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_1|, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_1|, ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_~arg#1.base, ULTIMATE.start_thr2_~self~0#1] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {461#(= ~__COUNT__~0 0)} [286] L723-->L724: Formula: (and (= |v_ULTIMATE.start_thr2_#in~arg#1.offset_2| |v_ULTIMATE.start_thr2_~arg#1.offset_2|) (= |v_ULTIMATE.start_thr2_~arg#1.base_2| |v_ULTIMATE.start_thr2_#in~arg#1.base_2|)) InVars {ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_2|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_2|} OutVars{ULTIMATE.start_thr2_#in~arg#1.base=|v_ULTIMATE.start_thr2_#in~arg#1.base_2|, ULTIMATE.start_thr2_~arg#1.offset=|v_ULTIMATE.start_thr2_~arg#1.offset_2|, ULTIMATE.start_thr2_~arg#1.base=|v_ULTIMATE.start_thr2_~arg#1.base_2|, ULTIMATE.start_thr2_#in~arg#1.offset=|v_ULTIMATE.start_thr2_#in~arg#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~arg#1.offset, ULTIMATE.start_thr2_~arg#1.base] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {461#(= ~__COUNT__~0 0)} [255] L724-->L725-2: Formula: (= |v_ULTIMATE.start_thr2_~self~0#1_3| v_~mThread~0_3) InVars {~mThread~0=v_~mThread~0_3} OutVars{ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_3|, ~mThread~0=v_~mThread~0_3} AuxVars[] AssignedVars[ULTIMATE.start_thr2_~self~0#1] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {461#(= ~__COUNT__~0 0)} [292] thr1ENTRY-->L710: Formula: (and (= |v_thr1Thread1of1ForFork0_~arg#1.offset_1| |v_thr1Thread1of1ForFork0_#in~arg#1.offset_1|) (= |v_thr1Thread1of1ForFork0_~arg#1.base_1| |v_thr1Thread1of1ForFork0_#in~arg#1.base_1|)) InVars {thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_1|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_1|} OutVars{thr1Thread1of1ForFork0_#in~arg#1.offset=|v_thr1Thread1of1ForFork0_#in~arg#1.offset_1|, thr1Thread1of1ForFork0_#in~arg#1.base=|v_thr1Thread1of1ForFork0_#in~arg#1.base_1|, thr1Thread1of1ForFork0_~arg#1.offset=|v_thr1Thread1of1ForFork0_~arg#1.offset_1|, thr1Thread1of1ForFork0_~arg#1.base=|v_thr1Thread1of1ForFork0_~arg#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~arg#1.offset, thr1Thread1of1ForFork0_~arg#1.base] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {461#(= ~__COUNT__~0 0)} [293] L710-->L711: Formula: (= |v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_1| 1) InVars {} OutVars{thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {461#(= ~__COUNT__~0 0)} [294] L711-->L711-1: Formula: (and (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~mStartLock~0_54 1) (= (ite (= v_~mStartLock~0_55 0) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|)) InVars {~mStartLock~0=v_~mStartLock~0_55} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~mStartLock~0=v_~mStartLock~0_54} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~mStartLock~0] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {461#(= ~__COUNT__~0 0)} [295] L711-1-->L713: Formula: (= v_~start_main~0_1 1) InVars {} OutVars{~start_main~0=v_~start_main~0_1} AuxVars[] AssignedVars[~start_main~0] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {461#(= ~__COUNT__~0 0)} [250] L725-2-->L725-3: Formula: (not (= v_~start_main~0_3 0)) InVars {~start_main~0=v_~start_main~0_3} OutVars{~start_main~0=v_~start_main~0_3} AuxVars[] AssignedVars[] {461#(= ~__COUNT__~0 0)} is VALID [2022-02-20 20:11:09,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {461#(= ~__COUNT__~0 0)} [297] L713-->L713-3: Formula: (and (= |v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1_3| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1_3|) (= |v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1_3| v_~mThread~0_Out_2) (= (+ v_~__COUNT__~0_In_1 1) v_~__COUNT__~0_Out_2) (= v_~__COUNT__~0_In_1 0) (= |v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1_3| |v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_5|)) InVars {~__COUNT__~0=v_~__COUNT__~0_In_1, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_5|} OutVars{thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1_3|, ~__COUNT__~0=v_~__COUNT__~0_Out_2, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1=|v_thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1_3|, thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1=|v_thr1Thread1of1ForFork0_~PR_CreateThread__RES~0#1_5|, ~mThread~0=v_~mThread~0_Out_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_~PR_CreateThread__RES#1, ~__COUNT__~0, thr1Thread1of1ForFork0___VERIFIER_atomic_thr1_#in~PR_CreateThread__RES#1, ~mThread~0] {462#(and (<= ~__COUNT__~0 1) (< 0 ~__COUNT__~0))} is VALID [2022-02-20 20:11:09,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {462#(and (<= ~__COUNT__~0 1) (< 0 ~__COUNT__~0))} [298] L713-3-->L714: Formula: (and (= v_~mStartLock~0_60 0) (not (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (ite (= v_~mStartLock~0_61 1) 1 0) |v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~mStartLock~0=v_~mStartLock~0_61} OutVars{thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~mStartLock~0=v_~mStartLock~0_60} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~mStartLock~0] {462#(and (<= ~__COUNT__~0 1) (< 0 ~__COUNT__~0))} is VALID [2022-02-20 20:11:09,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {462#(and (<= ~__COUNT__~0 1) (< 0 ~__COUNT__~0))} [241] L725-3-->L726: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_33| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (ite (= v_~mStartLock~0_73 0) 1 0)) (= v_~mStartLock~0_72 1)) InVars {~mStartLock~0=v_~mStartLock~0_73} OutVars{~mStartLock~0=v_~mStartLock~0_72, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ~mStartLock~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] {462#(and (<= ~__COUNT__~0 1) (< 0 ~__COUNT__~0))} is VALID [2022-02-20 20:11:09,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {462#(and (<= ~__COUNT__~0 1) (< 0 ~__COUNT__~0))} [256] L726-->L727: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| 0)) (= v_~mStartLock~0_66 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_29| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (= v_~mStartLock~0_67 1) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|)) InVars {~mStartLock~0=v_~mStartLock~0_67} OutVars{~mStartLock~0=v_~mStartLock~0_66, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_29|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ~mStartLock~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] {462#(and (<= ~__COUNT__~0 1) (< 0 ~__COUNT__~0))} is VALID [2022-02-20 20:11:09,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {462#(and (<= ~__COUNT__~0 1) (< 0 ~__COUNT__~0))} [246] L727-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1_15| |v_ULTIMATE.start_thr2_~self~0#1_16|) (= |v_ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1_15| |v_ULTIMATE.start___VERIFIER_atomic_thr2_~self#1_17|) (not (= v_~__COUNT__~0_46 1))) InVars {~__COUNT__~0=v_~__COUNT__~0_46, ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_16|} OutVars{~__COUNT__~0=v_~__COUNT__~0_46, ULTIMATE.start___VERIFIER_atomic_thr2_~self#1=|v_ULTIMATE.start___VERIFIER_atomic_thr2_~self#1_17|, ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1=|v_ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1_15|, ULTIMATE.start_thr2_~self~0#1=|v_ULTIMATE.start_thr2_~self~0#1_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_atomic_thr2_~self#1, ULTIMATE.start___VERIFIER_atomic_thr2_#in~self#1] {460#false} is VALID [2022-02-20 20:11:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:11:09,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:11:09,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472436457] [2022-02-20 20:11:09,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472436457] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:11:09,882 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:11:09,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:11:09,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664271774] [2022-02-20 20:11:09,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:11:09,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 20:11:09,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:11:09,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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-02-20 20:11:09,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:11:09,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 20:11:09,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:11:09,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 20:11:09,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 20:11:09,911 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 56 [2022-02-20 20:11:09,912 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 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-02-20 20:11:09,912 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:11:09,912 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 56 [2022-02-20 20:11:09,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:11:09,933 INFO L129 PetriNetUnfolder]: 4/51 cut-off events. [2022-02-20 20:11:09,933 INFO L130 PetriNetUnfolder]: For 8/11 co-relation queries the response was YES. [2022-02-20 20:11:09,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 51 events. 4/51 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 2/53 useless extension candidates. Maximal degree in co-relation 59. Up to 7 conditions per place. [2022-02-20 20:11:09,934 INFO L132 encePairwiseOnDemand]: 53/56 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2022-02-20 20:11:09,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 139 flow [2022-02-20 20:11:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 20:11:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-02-20 20:11:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2022-02-20 20:11:09,936 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2022-02-20 20:11:09,936 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 188 transitions. [2022-02-20 20:11:09,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 188 transitions. [2022-02-20 20:11:09,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:11:09,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 188 transitions. [2022-02-20 20:11:09,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 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-02-20 20:11:09,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 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-02-20 20:11:09,938 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 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-02-20 20:11:09,938 INFO L186 Difference]: Start difference. First operand has 50 places, 44 transitions, 125 flow. Second operand 4 states and 188 transitions. [2022-02-20 20:11:09,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 139 flow [2022-02-20 20:11:09,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:11:09,947 INFO L242 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2022-02-20 20:11:09,948 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2022-02-20 20:11:09,948 INFO L334 CegarLoopForPetriNet]: 57 programPoint places, -6 predicate places. [2022-02-20 20:11:09,948 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 0 transitions, 0 flow [2022-02-20 20:11:09,949 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-02-20 20:11:09,949 INFO L78 Accepts]: Start accepts. Automaton has has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 20:11:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:11:09,949 INFO L470 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2022-02-20 20:11:09,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.0) internal successors, (188), 4 states have internal predecessors, (188), 0 states have call successors, (0), 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-02-20 20:11:09,951 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-02-20 20:11:09,951 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-02-20 20:11:09,952 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 4 remaining) [2022-02-20 20:11:09,952 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-02-20 20:11:09,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:11:09,954 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 20:11:09,957 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:11:09,957 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:11:09,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:11:09 BasicIcfg [2022-02-20 20:11:09,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:11:09,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:11:09,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:11:09,960 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:11:09,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:11:08" (3/4) ... [2022-02-20 20:11:09,961 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:11:09,965 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2022-02-20 20:11:09,968 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2022-02-20 20:11:09,968 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-02-20 20:11:09,968 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 20:11:09,968 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:11:09,989 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:11:09,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:11:09,990 INFO L158 Benchmark]: Toolchain (without parser) took 1973.63ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 73.7MB in the beginning and 98.9MB in the end (delta: -25.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:11:09,990 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:11:09,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.65ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 73.4MB in the beginning and 93.2MB in the end (delta: -19.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 20:11:09,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.62ms. Allocated memory is still 130.0MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:11:09,991 INFO L158 Benchmark]: Boogie Preprocessor took 42.80ms. Allocated memory is still 130.0MB. Free memory was 91.1MB in the beginning and 89.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:11:09,991 INFO L158 Benchmark]: RCFGBuilder took 386.73ms. Allocated memory is still 130.0MB. Free memory was 89.4MB in the beginning and 72.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 20:11:09,991 INFO L158 Benchmark]: TraceAbstraction took 1007.11ms. Allocated memory is still 130.0MB. Free memory was 71.7MB in the beginning and 102.1MB in the end (delta: -30.4MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2022-02-20 20:11:09,991 INFO L158 Benchmark]: Witness Printer took 29.39ms. Allocated memory is still 130.0MB. Free memory was 102.1MB in the beginning and 98.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:11:09,993 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.65ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 73.4MB in the beginning and 93.2MB in the end (delta: -19.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.62ms. Allocated memory is still 130.0MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.80ms. Allocated memory is still 130.0MB. Free memory was 91.1MB in the beginning and 89.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 386.73ms. Allocated memory is still 130.0MB. Free memory was 89.4MB in the beginning and 72.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1007.11ms. Allocated memory is still 130.0MB. Free memory was 71.7MB in the beginning and 102.1MB in the end (delta: -30.4MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Witness Printer took 29.39ms. Allocated memory is still 130.0MB. Free memory was 102.1MB in the beginning and 98.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 707]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 721]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 66 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 10 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:11:10,018 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 Result: TRUE