./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_18-first-reads_unknown_2_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/13-privatized_18-first-reads_unknown_2_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 9466f27e00e9305501eee0377198b5d988616fcd0740d7b6b046dc1579fad0d0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:06,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:06,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:06,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:06,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:06,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:06,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:06,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:06,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:06,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:06,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:06,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:06,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:06,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:06,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:06,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:06,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:06,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:06,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:06,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:06,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:06,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:06,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:06,941 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:06,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:06,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:06,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:06,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:06,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:06,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:06,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:06,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:06,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:06,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:06,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:06,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:06,952 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:06,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:06,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:06,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:06,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:06,954 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:40:06,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:06,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:06,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:06,969 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:06,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:06,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:06,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:06,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:06,972 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:06,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:06,972 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:06,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:06,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:06,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:06,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:06,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:06,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:06,974 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:06,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:06,975 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:06,975 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:06,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:06,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:06,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:06,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:06,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:06,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:06,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:06,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:06,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:06,977 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:06,977 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:06,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:06,978 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 -> 9466f27e00e9305501eee0377198b5d988616fcd0740d7b6b046dc1579fad0d0 [2022-02-20 20:40:07,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:07,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:07,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:07,202 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:07,202 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:07,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i [2022-02-20 20:40:07,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/051d8a0c3/e2b53aba741b48d6a2df48775e8bf637/FLAGc9795b2bb [2022-02-20 20:40:07,681 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:07,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_18-first-reads_unknown_2_neg.i [2022-02-20 20:40:07,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/051d8a0c3/e2b53aba741b48d6a2df48775e8bf637/FLAGc9795b2bb [2022-02-20 20:40:07,703 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/051d8a0c3/e2b53aba741b48d6a2df48775e8bf637 [2022-02-20 20:40:07,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:07,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:07,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:07,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:07,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:07,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:07" (1/1) ... [2022-02-20 20:40:07,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e4bb6ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:07, skipping insertion in model container [2022-02-20 20:40:07,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:07" (1/1) ... [2022-02-20 20:40:07,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:07,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:07,866 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/13-privatized_18-first-reads_unknown_2_neg.i[1097,1110] [2022-02-20 20:40:07,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:07,979 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:07,989 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/13-privatized_18-first-reads_unknown_2_neg.i[1097,1110] [2022-02-20 20:40:08,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:08,065 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:08,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:08 WrapperNode [2022-02-20 20:40:08,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:08,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:08,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:08,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:08,072 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:40:08" (1/1) ... [2022-02-20 20:40:08,085 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:40:08" (1/1) ... [2022-02-20 20:40:08,107 INFO L137 Inliner]: procedures = 163, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2022-02-20 20:40:08,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:08,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:08,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:08,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:08,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:08" (1/1) ... [2022-02-20 20:40:08,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:08" (1/1) ... [2022-02-20 20:40:08,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:08" (1/1) ... [2022-02-20 20:40:08,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:08" (1/1) ... [2022-02-20 20:40:08,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:08" (1/1) ... [2022-02-20 20:40:08,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:08" (1/1) ... [2022-02-20 20:40:08,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:08" (1/1) ... [2022-02-20 20:40:08,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:08,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:08,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:08,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:08,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:08" (1/1) ... [2022-02-20 20:40:08,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:08,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:08,175 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:40:08,192 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:40:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:40:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:08,203 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:08,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:08,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:08,205 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:40:08,310 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:08,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:08,415 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:08,419 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:08,420 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:08,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:08 BoogieIcfgContainer [2022-02-20 20:40:08,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:08,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:08,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:08,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:08,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:07" (1/3) ... [2022-02-20 20:40:08,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a180449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:08, skipping insertion in model container [2022-02-20 20:40:08,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:08" (2/3) ... [2022-02-20 20:40:08,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a180449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:08, skipping insertion in model container [2022-02-20 20:40:08,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:08" (3/3) ... [2022-02-20 20:40:08,428 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_18-first-reads_unknown_2_neg.i [2022-02-20 20:40:08,431 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:08,431 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:08,431 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:40:08,431 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:08,461 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,462 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,463 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,463 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,469 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,470 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,472 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,474 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,474 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,474 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,474 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,474 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,474 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,475 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,475 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,475 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,475 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,476 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,476 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,476 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,476 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,476 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,477 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,477 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,477 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,477 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,477 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,478 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,478 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,478 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,478 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,478 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,478 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,478 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,479 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,479 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,479 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,480 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,480 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,480 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,480 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,483 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,483 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,483 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,483 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~t~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,484 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:08,489 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:40:08,526 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:08,530 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:40:08,530 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:40:08,537 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 136 flow [2022-02-20 20:40:08,558 INFO L129 PetriNetUnfolder]: 2/63 cut-off events. [2022-02-20 20:40:08,558 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:08,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 63 events. 2/63 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2022-02-20 20:40:08,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 64 transitions, 136 flow [2022-02-20 20:40:08,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 47 transitions, 97 flow [2022-02-20 20:40:08,573 INFO L129 PetriNetUnfolder]: 1/46 cut-off events. [2022-02-20 20:40:08,579 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:08,579 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:08,580 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:40:08,581 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:40:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash -392670942, now seen corresponding path program 1 times [2022-02-20 20:40:08,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:08,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604505512] [2022-02-20 20:40:08,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:08,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:08,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#true} [120] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {69#true} is VALID [2022-02-20 20:40:08,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#true} [107] 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] {69#true} is VALID [2022-02-20 20:40:08,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {69#true} [126] 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[] {69#true} is VALID [2022-02-20 20:40:08,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {69#true} [129] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {69#true} is VALID [2022-02-20 20:40:08,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {69#true} [94] 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[] {69#true} is VALID [2022-02-20 20:40:08,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {69#true} [121] 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[] {69#true} is VALID [2022-02-20 20:40:08,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {69#true} [112] 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[] {69#true} is VALID [2022-02-20 20:40:08,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {69#true} [114] L18-3-->L18-4: Formula: (and (= 45 (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[] {69#true} is VALID [2022-02-20 20:40:08,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {69#true} [115] L18-4-->L683: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {71#(= ~glob1~0 0)} [79] L683-->L683-1: Formula: (and (= |v_~#mutex1~0.offset_1| 0) (= 3 |v_~#mutex1~0.base_1|)) InVars {} OutVars{~#mutex1~0.offset=|v_~#mutex1~0.offset_1|, ~#mutex1~0.base=|v_~#mutex1~0.base_1|} AuxVars[] AssignedVars[~#mutex1~0.offset, ~#mutex1~0.base] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {71#(= ~glob1~0 0)} [119] 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[] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {71#(= ~glob1~0 0)} [106] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_3| |v_~#mutex1~0.base_2|) |v_~#mutex1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_2|} AuxVars[] AssignedVars[] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {71#(= ~glob1~0 0)} [123] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex1~0.base_3|) (+ |v_~#mutex1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_3|, ~#mutex1~0.base=|v_~#mutex1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_3|, ~#mutex1~0.base=|v_~#mutex1~0.base_3|} AuxVars[] AssignedVars[] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {71#(= ~glob1~0 0)} [76] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex1~0.base_4|) (+ |v_~#mutex1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_4|, ~#mutex1~0.base=|v_~#mutex1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_4|, ~#mutex1~0.base=|v_~#mutex1~0.base_4|} AuxVars[] AssignedVars[] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {71#(= ~glob1~0 0)} [124] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex1~0.base_5|) (+ |v_~#mutex1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_5|, ~#mutex1~0.base=|v_~#mutex1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_5|, ~#mutex1~0.base=|v_~#mutex1~0.base_5|} AuxVars[] AssignedVars[] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {71#(= ~glob1~0 0)} [105] L683-6-->L683-7: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex1~0.base_6|) (+ 16 |v_~#mutex1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_6|, ~#mutex1~0.base=|v_~#mutex1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_6|, ~#mutex1~0.base=|v_~#mutex1~0.base_6|} AuxVars[] AssignedVars[] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {71#(= ~glob1~0 0)} [104] L683-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {71#(= ~glob1~0 0)} [131] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {71#(= ~glob1~0 0)} [113] 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] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {71#(= ~glob1~0 0)} [83] L-1-5-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#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_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, 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~mem6#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {71#(= ~glob1~0 0)} [103] L697-->L697-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {71#(= ~glob1~0 0)} [84] L697-1-->L698: 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] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {71#(= ~glob1~0 0)} [100] L698-->L698-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {71#(= ~glob1~0 0)} [98] L698-1-->L698-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, 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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{#memory_int=|v_#memory_int_8|, 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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {71#(= ~glob1~0 0)} [162] L698-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_8|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_6|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_12|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_10|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~t~0#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {71#(= ~glob1~0 0)} [137] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {71#(= ~glob1~0 0)} [138] L685-->L685-1: Formula: (and (<= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 2147483647) (<= 0 (+ |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 2147483648))) InVars {t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|} AuxVars[] AssignedVars[] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {71#(= ~glob1~0 0)} [139] L685-1-->L685-2: Formula: (= |v_t_funThread1of1ForFork0_#t~nondet1#1_3| |v_t_funThread1of1ForFork0_~t~0#1_1|) InVars {t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_1|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0#1] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {71#(= ~glob1~0 0)} [140] L685-2-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_5|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {71#(= ~glob1~0 0)} [141] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#mutex1~0.base_10|))) (and (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#mutex1~0.base_10| (store .cse0 |v_~#mutex1~0.offset_10| 1))) (= 0 (select .cse0 |v_~#mutex1~0.offset_10|)) (= |v_t_funThread1of1ForFork0_#t~nondet2#1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_10|, ~#mutex1~0.base=|v_~#mutex1~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_10|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_1|, ~#mutex1~0.base=|v_~#mutex1~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2#1] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {71#(= ~glob1~0 0)} [142] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2#1] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {71#(= ~glob1~0 0)} [144] L687-->L687-2: Formula: (not (= 42 |v_t_funThread1of1ForFork0_~t~0#1_5|)) InVars {t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_5|} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_5|} AuxVars[] AssignedVars[] {71#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:08,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {71#(= ~glob1~0 0)} [146] L687-2-->L691: Formula: (= v_~glob1~0_4 |v_t_funThread1of1ForFork0_~t~0#1_7|) InVars {~glob1~0=v_~glob1~0_4} OutVars{t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_7|, ~glob1~0=v_~glob1~0_4} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0#1] {72#(= |t_funThread1of1ForFork0_~t~0#1| 0)} is VALID [2022-02-20 20:40:08,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {72#(= |t_funThread1of1ForFork0_~t~0#1| 0)} [147] L691-->L691-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72#(= |t_funThread1of1ForFork0_~t~0#1| 0)} is VALID [2022-02-20 20:40:08,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {72#(= |t_funThread1of1ForFork0_~t~0#1| 0)} [148] L691-1-->L691-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (not (= |v_t_funThread1of1ForFork0_~t~0#1_9| 1)) 1 0)) InVars {t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_9|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, t_funThread1of1ForFork0_~t~0#1=|v_t_funThread1of1ForFork0_~t~0#1_9|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1] {73#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:08,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {73#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [149] L691-2-->L19: Formula: true InVars {} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {73#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:08,851 INFO L290 TraceCheckUtils]: 36: Hoare triple {73#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [150] L19-->L19-1: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {74#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:08,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {74#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} [151] L19-1-->L19-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5| 0) InVars {t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {70#false} is VALID [2022-02-20 20:40:08,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {70#false} [153] L19-2-->t_funErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {70#false} is VALID [2022-02-20 20:40:08,853 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:40:08,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:08,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604505512] [2022-02-20 20:40:08,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604505512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:08,854 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:08,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:08,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383021987] [2022-02-20 20:40:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:08,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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:40:08,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:08,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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:40:08,928 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:40:08,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:08,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:08,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:08,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:08,956 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 64 [2022-02-20 20:40:08,961 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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:40:08,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:08,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 64 [2022-02-20 20:40:08,963 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:09,066 INFO L129 PetriNetUnfolder]: 0/52 cut-off events. [2022-02-20 20:40:09,068 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:09,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 52 events. 0/52 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 22 event pairs, 0 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-02-20 20:40:09,069 INFO L132 encePairwiseOnDemand]: 58/64 looper letters, 8 selfloop transitions, 2 changer transitions 5/51 dead transitions. [2022-02-20 20:40:09,070 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 135 flow [2022-02-20 20:40:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:40:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:40:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 304 transitions. [2022-02-20 20:40:09,088 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2022-02-20 20:40:09,088 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 304 transitions. [2022-02-20 20:40:09,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 304 transitions. [2022-02-20 20:40:09,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:09,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 304 transitions. [2022-02-20 20:40:09,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 50.666666666666664) internal successors, (304), 6 states have internal predecessors, (304), 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:40:09,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 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:40:09,096 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 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:40:09,097 INFO L186 Difference]: Start difference. First operand has 50 places, 47 transitions, 97 flow. Second operand 6 states and 304 transitions. [2022-02-20 20:40:09,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 135 flow [2022-02-20 20:40:09,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:09,101 INFO L242 Difference]: Finished difference. Result has 58 places, 46 transitions, 108 flow [2022-02-20 20:40:09,102 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-02-20 20:40:09,106 INFO L334 CegarLoopForPetriNet]: 50 programPoint places, 8 predicate places. [2022-02-20 20:40:09,106 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 46 transitions, 108 flow [2022-02-20 20:40:09,115 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 137 states, 136 states have (on average 1.661764705882353) internal successors, (226), 136 states have internal predecessors, (226), 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:40:09,116 INFO L78 Accepts]: Start accepts. Automaton has has 137 states, 136 states have (on average 1.661764705882353) internal successors, (226), 136 states have internal predecessors, (226), 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:40:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:09,116 INFO L470 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 108 flow [2022-02-20 20:40:09,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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:40:09,117 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:09,117 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] [2022-02-20 20:40:09,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:09,117 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:40:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash -140340200, now seen corresponding path program 1 times [2022-02-20 20:40:09,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:09,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281731010] [2022-02-20 20:40:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:09,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:40:09,141 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:40:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:40:09,188 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:40:09,188 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:40:09,189 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 20:40:09,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-20 20:40:09,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-02-20 20:40:09,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:09,196 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 20:40:09,200 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:09,200 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:09,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:09 BasicIcfg [2022-02-20 20:40:09,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:09,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:09,251 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:09,251 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:09,252 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:08" (3/4) ... [2022-02-20 20:40:09,253 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 20:40:09,307 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:09,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:09,309 INFO L158 Benchmark]: Toolchain (without parser) took 1602.68ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 54.9MB in the beginning and 88.9MB in the end (delta: -34.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:09,309 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory was 60.1MB in the beginning and 60.1MB in the end (delta: 25.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:09,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.03ms. Allocated memory is still 90.2MB. Free memory was 54.8MB in the beginning and 55.8MB in the end (delta: -994.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 20:40:09,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.09ms. Allocated memory is still 90.2MB. Free memory was 55.8MB in the beginning and 53.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:09,313 INFO L158 Benchmark]: Boogie Preprocessor took 14.06ms. Allocated memory is still 90.2MB. Free memory was 53.7MB in the beginning and 52.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:09,313 INFO L158 Benchmark]: RCFGBuilder took 297.80ms. Allocated memory is still 90.2MB. Free memory was 52.2MB in the beginning and 40.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:40:09,313 INFO L158 Benchmark]: TraceAbstraction took 828.92ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 39.9MB in the beginning and 95.1MB in the end (delta: -55.2MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2022-02-20 20:40:09,314 INFO L158 Benchmark]: Witness Printer took 56.42ms. Allocated memory is still 119.5MB. Free memory was 95.1MB in the beginning and 88.9MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 20:40:09,315 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 90.2MB. Free memory was 60.1MB in the beginning and 60.1MB in the end (delta: 25.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.03ms. Allocated memory is still 90.2MB. Free memory was 54.8MB in the beginning and 55.8MB in the end (delta: -994.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.09ms. Allocated memory is still 90.2MB. Free memory was 55.8MB in the beginning and 53.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.06ms. Allocated memory is still 90.2MB. Free memory was 53.7MB in the beginning and 52.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 297.80ms. Allocated memory is still 90.2MB. Free memory was 52.2MB in the beginning and 40.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 828.92ms. Allocated memory was 90.2MB in the beginning and 119.5MB in the end (delta: 29.4MB). Free memory was 39.9MB in the beginning and 95.1MB in the end (delta: -55.2MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * Witness Printer took 56.42ms. Allocated memory is still 119.5MB. Free memory was 95.1MB in the beginning and 88.9MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. 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 glob1 = 0; VAL [glob1=0] [L683] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [glob1=0, mutex1={3:0}] [L697] 0 pthread_t id; VAL [glob1=0, id={5:0}, mutex1={3:0}] [L698] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [glob1=0, id={5:0}, mutex1={3:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1] [L685] 1 int t = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=42, arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L687] COND TRUE 1 t == 42 VAL [arg={0:0}, arg={0:0}, glob1=0, mutex1={3:0}, t=42] [L688] 1 glob1 = 1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=42] [L690] 1 t = glob1 VAL [arg={0:0}, arg={0:0}, glob1=1, mutex1={3:0}, t=1] [L691] CALL 1 __VERIFIER_assert(!(t == 1)) [L19] COND TRUE 1 !(cond) VAL [\old(cond)=0, cond=0, glob1=1, mutex1={3:0}] [L19] 1 reach_error() VAL [\old(cond)=0, cond=0, glob1=1, mutex1={3:0}] - UnprovableResult [Line: 698]: 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, 87 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.7s, OverallIterations: 2, 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, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 7 mSDtfsCounter, 22 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.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 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:40:09,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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