./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.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/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.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 36105814f7d14243ca8b55776979fcada1717aa30ae4c259b302358b1f244a48 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:44:35,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:44:35,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:44:35,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:44:35,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:44:35,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:44:35,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:44:35,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:44:35,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:44:35,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:44:35,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:44:35,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:44:35,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:44:35,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:44:35,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:44:35,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:44:35,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:44:35,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:44:35,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:44:35,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:44:35,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:44:35,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:44:35,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:44:35,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:44:35,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:44:35,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:44:35,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:44:35,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:44:35,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:44:35,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:44:35,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:44:35,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:44:35,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:44:35,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:44:35,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:44:35,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:44:35,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:44:35,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:44:35,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:44:35,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:44:35,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:44:35,921 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:44:35,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:44:35,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:44:35,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:44:35,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:44:35,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:44:35,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:44:35,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:44:35,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:44:35,940 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:44:35,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:44:35,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:44:35,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:44:35,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:44:35,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:44:35,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:44:35,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:44:35,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:44:35,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:44:35,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:44:35,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:44:35,942 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:44:35,942 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:44:35,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:44:35,943 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 -> 36105814f7d14243ca8b55776979fcada1717aa30ae4c259b302358b1f244a48 [2022-02-20 20:44:36,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:44:36,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:44:36,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:44:36,195 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:44:36,195 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:44:36,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2022-02-20 20:44:36,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1019e1c5/a9128d8aa8b34618898d5ea33a46f3f0/FLAG3963e11a5 [2022-02-20 20:44:36,651 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:44:36,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2022-02-20 20:44:36,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1019e1c5/a9128d8aa8b34618898d5ea33a46f3f0/FLAG3963e11a5 [2022-02-20 20:44:36,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1019e1c5/a9128d8aa8b34618898d5ea33a46f3f0 [2022-02-20 20:44:36,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:44:36,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:44:36,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:44:36,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:44:36,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:44:36,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:44:36" (1/1) ... [2022-02-20 20:44:36,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e369c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:36, skipping insertion in model container [2022-02-20 20:44:36,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:44:36" (1/1) ... [2022-02-20 20:44:36,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:44:36,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:44:36,872 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/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i[1098,1111] [2022-02-20 20:44:36,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:44:37,009 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:44:37,019 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/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i[1098,1111] [2022-02-20 20:44:37,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:44:37,083 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:44:37,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37 WrapperNode [2022-02-20 20:44:37,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:44:37,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:44:37,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:44:37,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:44:37,091 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:44:37" (1/1) ... [2022-02-20 20:44:37,099 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:44:37" (1/1) ... [2022-02-20 20:44:37,127 INFO L137 Inliner]: procedures = 163, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-02-20 20:44:37,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:44:37,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:44:37,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:44:37,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:44:37,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:44:37,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:44:37,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:44:37,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:44:37,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:44:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:44:37,187 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:44:37,210 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:44:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:44:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:44:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:44:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:44:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:44:37,222 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:44:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:44:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:44:37,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:44:37,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:44:37,223 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:44:37,342 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:44:37,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:44:37,514 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:44:37,520 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:44:37,520 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:44:37,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:44:37 BoogieIcfgContainer [2022-02-20 20:44:37,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:44:37,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:44:37,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:44:37,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:44:37,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:44:36" (1/3) ... [2022-02-20 20:44:37,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443ecfbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:44:37, skipping insertion in model container [2022-02-20 20:44:37,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (2/3) ... [2022-02-20 20:44:37,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443ecfbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:44:37, skipping insertion in model container [2022-02-20 20:44:37,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:44:37" (3/3) ... [2022-02-20 20:44:37,529 INFO L111 eAbstractionObserver]: Analyzing ICFG 36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2022-02-20 20:44:37,533 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:44:37,533 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:44:37,533 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:44:37,533 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:44:37,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,582 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,582 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,582 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,583 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,583 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,583 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,584 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,585 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,586 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,587 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,588 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,592 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,592 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,593 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,593 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:37,596 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:44:37,626 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:44:37,632 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:44:37,632 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:44:37,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 78 transitions, 161 flow [2022-02-20 20:44:37,680 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2022-02-20 20:44:37,680 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:44:37,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2022-02-20 20:44:37,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 78 transitions, 161 flow [2022-02-20 20:44:37,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 65 transitions, 133 flow [2022-02-20 20:44:37,706 INFO L129 PetriNetUnfolder]: 1/64 cut-off events. [2022-02-20 20:44:37,707 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:44:37,707 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:44:37,707 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:44:37,708 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:44:37,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:44:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash -280445477, now seen corresponding path program 1 times [2022-02-20 20:44:37,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:44:37,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139219080] [2022-02-20 20:44:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:44:37,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:44:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:44:38,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {83#true} [144] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-02-20 20:44:38,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {83#true} [127] 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] {83#true} is VALID [2022-02-20 20:44:38,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {83#true} [151] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {83#true} is VALID [2022-02-20 20:44:38,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {83#true} [153] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {83#true} is VALID [2022-02-20 20:44:38,025 INFO L290 TraceCheckUtils]: 4: Hoare triple {83#true} [109] L18-->L18-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {83#true} is VALID [2022-02-20 20:44:38,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {83#true} [145] L18-1-->L18-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[] {83#true} is VALID [2022-02-20 20:44:38,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {83#true} [133] L18-2-->L18-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[] {83#true} is VALID [2022-02-20 20:44:38,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {83#true} [136] L18-3-->L18-4: Formula: (and (= 46 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {83#true} is VALID [2022-02-20 20:44:38,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {83#true} [137] L18-4-->L683: Formula: (= 42 v_~g~0_1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {85#(<= 42 ~g~0)} [98] L683-->L683-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {85#(<= 42 ~g~0)} [143] L683-1-->L683-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {85#(<= 42 ~g~0)} [125] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {85#(<= 42 ~g~0)} [148] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {85#(<= 42 ~g~0)} [91] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {85#(<= 42 ~g~0)} [149] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {85#(<= 42 ~g~0)} [123] L683-6-->L683-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {85#(<= 42 ~g~0)} [120] L683-7-->L684: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {85#(<= 42 ~g~0)} [92] L684-->L684-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {85#(<= 42 ~g~0)} [118] L684-1-->L684-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {85#(<= 42 ~g~0)} [94] L684-2-->L684-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {85#(<= 42 ~g~0)} [162] L684-3-->L684-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {85#(<= 42 ~g~0)} [160] L684-4-->L684-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {85#(<= 42 ~g~0)} [161] L684-5-->L684-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {85#(<= 42 ~g~0)} [141] L684-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {85#(<= 42 ~g~0)} [158] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {85#(<= 42 ~g~0)} [135] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {85#(<= 42 ~g~0)} [100] L-1-5-->L694: Formula: true InVars {} OutVars{ULTIMATE.start_main_~r~0#1=|v_ULTIMATE.start_main_~r~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~r~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~t~0#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {85#(<= 42 ~g~0)} [103] L694-->L694-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {85#(<= 42 ~g~0)} [131] L694-1-->L694-2: Formula: (= |v_ULTIMATE.start_main_~r~0#1_2| |v_ULTIMATE.start_main_#t~nondet3#1_3|) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|, ULTIMATE.start_main_~r~0#1=|v_ULTIMATE.start_main_~r~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~r~0#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {85#(<= 42 ~g~0)} [163] L694-2-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {85#(<= 42 ~g~0)} [156] L695-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {85#(<= 42 ~g~0)} [138] L696-->L696-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,044 INFO L290 TraceCheckUtils]: 32: Hoare triple {85#(<= 42 ~g~0)} [124] L696-1-->L697: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {85#(<= 42 ~g~0)} [117] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {85#(<= 42 ~g~0)} [101] L697-1-->L697-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {85#(<= 42 ~g~0)} [176] L697-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {85#(<= 42 ~g~0)} [90] L697-3-->L697-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {85#(<= 42 ~g~0)} [111] L697-4-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {85#(<= 42 ~g~0)} [114] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0) (= (select .cse0 |v_~#A~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,050 INFO L290 TraceCheckUtils]: 39: Hoare triple {85#(<= 42 ~g~0)} [113] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {85#(<= 42 ~g~0)} [129] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#B~0.base_7|))) (and (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#B~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {85#(<= 42 ~g~0)} [102] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {85#(<= 42 ~g~0)} [155] L700-->L700-2: Formula: (= |v_ULTIMATE.start_main_~r~0#1_4| 0) InVars {ULTIMATE.start_main_~r~0#1=|v_ULTIMATE.start_main_~r~0#1_4|} OutVars{ULTIMATE.start_main_~r~0#1=|v_ULTIMATE.start_main_~r~0#1_4|} AuxVars[] AssignedVars[] {85#(<= 42 ~g~0)} is VALID [2022-02-20 20:44:38,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {85#(<= 42 ~g~0)} [110] L700-2-->L706: Formula: (= |v_ULTIMATE.start_main_~t~0#1_3| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1] {86#(<= 42 |ULTIMATE.start_main_~t~0#1|)} is VALID [2022-02-20 20:44:38,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {86#(<= 42 |ULTIMATE.start_main_~t~0#1|)} [130] L706-->L706-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#(<= 42 |ULTIMATE.start_main_~t~0#1|)} is VALID [2022-02-20 20:44:38,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {86#(<= 42 |ULTIMATE.start_main_~t~0#1|)} [126] L706-1-->L706-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (not (= |v_ULTIMATE.start_main_~t~0#1_4| 17)) 1 0)) InVars {ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {87#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:44:38,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {87#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [115] L706-2-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {87#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:44:38,057 INFO L290 TraceCheckUtils]: 47: Hoare triple {87#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [116] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {88#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:44:38,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {88#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [104] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {84#false} is VALID [2022-02-20 20:44:38,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {84#false} [121] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#false} is VALID [2022-02-20 20:44:38,060 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:44:38,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:44:38,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139219080] [2022-02-20 20:44:38,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139219080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:44:38,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:44:38,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:44:38,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743821816] [2022-02-20 20:44:38,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:44:38,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 20:44:38,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:44:38,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 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:44:38,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:44:38,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:44:38,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:44:38,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:44:38,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:44:38,150 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 78 [2022-02-20 20:44:38,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 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:44:38,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:44:38,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 78 [2022-02-20 20:44:38,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:44:38,280 INFO L129 PetriNetUnfolder]: 9/125 cut-off events. [2022-02-20 20:44:38,280 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:44:38,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 125 events. 9/125 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 298 event pairs, 0 based on Foata normal form. 2/124 useless extension candidates. Maximal degree in co-relation 125. Up to 15 conditions per place. [2022-02-20 20:44:38,282 INFO L132 encePairwiseOnDemand]: 71/78 looper letters, 13 selfloop transitions, 3 changer transitions 8/77 dead transitions. [2022-02-20 20:44:38,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 77 transitions, 203 flow [2022-02-20 20:44:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:44:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:44:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 408 transitions. [2022-02-20 20:44:38,297 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2022-02-20 20:44:38,297 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 408 transitions. [2022-02-20 20:44:38,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 408 transitions. [2022-02-20 20:44:38,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:44:38,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 408 transitions. [2022-02-20 20:44:38,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 0 states have call successors, (0), 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:44:38,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 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:44:38,307 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 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:44:38,309 INFO L186 Difference]: Start difference. First operand has 68 places, 65 transitions, 133 flow. Second operand 6 states and 408 transitions. [2022-02-20 20:44:38,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 77 transitions, 203 flow [2022-02-20 20:44:38,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 77 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:44:38,319 INFO L242 Difference]: Finished difference. Result has 77 places, 65 transitions, 154 flow [2022-02-20 20:44:38,320 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2022-02-20 20:44:38,323 INFO L334 CegarLoopForPetriNet]: 68 programPoint places, 9 predicate places. [2022-02-20 20:44:38,324 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 65 transitions, 154 flow [2022-02-20 20:44:38,337 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 300 states, 297 states have (on average 1.7272727272727273) internal successors, (513), 299 states have internal predecessors, (513), 0 states have call successors, (0), 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:44:38,339 INFO L78 Accepts]: Start accepts. Automaton has has 300 states, 297 states have (on average 1.7272727272727273) internal successors, (513), 299 states have internal predecessors, (513), 0 states have call successors, (0), 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 50 [2022-02-20 20:44:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:44:38,342 INFO L470 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 154 flow [2022-02-20 20:44:38,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 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:44:38,343 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:44:38,343 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:44:38,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:44:38,344 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:44:38,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:44:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash 687613271, now seen corresponding path program 1 times [2022-02-20 20:44:38,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:44:38,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494340] [2022-02-20 20:44:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:44:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:44:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:44:38,379 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:44:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:44:38,422 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:44:38,425 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:44:38,426 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 20:44:38,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 2 remaining) [2022-02-20 20:44:38,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:44:38,430 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 20:44:38,433 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:44:38,433 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:44:38,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:44:38 BasicIcfg [2022-02-20 20:44:38,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:44:38,463 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:44:38,463 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:44:38,463 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:44:38,464 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:44:37" (3/4) ... [2022-02-20 20:44:38,465 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 20:44:38,512 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:44:38,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:44:38,513 INFO L158 Benchmark]: Toolchain (without parser) took 1836.31ms. Allocated memory was 119.5MB in the beginning and 169.9MB in the end (delta: 50.3MB). Free memory was 78.9MB in the beginning and 83.4MB in the end (delta: -4.5MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-02-20 20:44:38,514 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory was 97.4MB in the beginning and 97.3MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:44:38,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.94ms. Allocated memory is still 119.5MB. Free memory was 78.8MB in the beginning and 83.3MB in the end (delta: -4.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 20:44:38,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.15ms. Allocated memory is still 119.5MB. Free memory was 83.3MB in the beginning and 81.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:44:38,515 INFO L158 Benchmark]: Boogie Preprocessor took 30.58ms. Allocated memory is still 119.5MB. Free memory was 81.3MB in the beginning and 79.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:44:38,519 INFO L158 Benchmark]: RCFGBuilder took 361.58ms. Allocated memory is still 119.5MB. Free memory was 79.7MB in the beginning and 66.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:44:38,520 INFO L158 Benchmark]: TraceAbstraction took 940.22ms. Allocated memory was 119.5MB in the beginning and 169.9MB in the end (delta: 50.3MB). Free memory was 66.1MB in the beginning and 90.8MB in the end (delta: -24.7MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2022-02-20 20:44:38,520 INFO L158 Benchmark]: Witness Printer took 49.46ms. Allocated memory is still 169.9MB. Free memory was 90.8MB in the beginning and 83.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 20:44:38,521 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.16ms. Allocated memory is still 119.5MB. Free memory was 97.4MB in the beginning and 97.3MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.94ms. Allocated memory is still 119.5MB. Free memory was 78.8MB in the beginning and 83.3MB in the end (delta: -4.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.15ms. Allocated memory is still 119.5MB. Free memory was 83.3MB in the beginning and 81.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.58ms. Allocated memory is still 119.5MB. Free memory was 81.3MB in the beginning and 79.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.58ms. Allocated memory is still 119.5MB. Free memory was 79.7MB in the beginning and 66.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 940.22ms. Allocated memory was 119.5MB in the beginning and 169.9MB in the end (delta: 50.3MB). Free memory was 66.1MB in the beginning and 90.8MB in the end (delta: -24.7MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 49.46ms. Allocated memory is still 169.9MB. Free memory was 90.8MB in the beginning and 83.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int g = 42; VAL [g=42] [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [A={3:0}, g=42] [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [A={3:0}, B={4:0}, g=42] [L694] 0 int r = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=1, A={3:0}, B={4:0}, g=42, r=1] [L695] 0 int t; VAL [A={3:0}, B={4:0}, g=42, r=1] [L696] 0 pthread_t id; VAL [A={3:0}, B={4:0}, g=42, id={5:0}, r=1] [L697] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, arg={0:0}, B={4:0}, g=42, id={5:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1, r=1] [L700] COND TRUE 0 \read(r) VAL [A={3:0}, arg={0:0}, B={4:0}, g=42, id={5:0}, r=1] [L701] 0 g = 17 VAL [A={3:0}, arg={0:0}, B={4:0}, g=17, id={5:0}, r=1] [L705] 0 t = g VAL [A={3:0}, arg={0:0}, B={4:0}, g=17, id={5:0}, r=1, t=17] [L706] CALL 0 __VERIFIER_assert(!(t == 17)) [L19] COND TRUE 0 !(cond) VAL [\old(cond)=0, A={3:0}, arg={0:0}, B={4:0}, cond=0, g=17] [L19] 0 reach_error() VAL [\old(cond)=0, A={3:0}, arg={0:0}, B={4:0}, cond=0, g=17] - UnprovableResult [Line: 697]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 89 locations, 2 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.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 11 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=1, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-20 20:44:38,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE