./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_18-first-reads_true.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_true.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 3427cff38b27502f1724e7992c2bbd22dfeaf576101e50c5b78d18afb7a0563f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:02,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:02,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:02,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:02,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:02,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:02,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:02,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:02,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:02,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:02,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:02,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:02,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:02,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:02,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:02,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:02,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:02,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:02,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:02,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:02,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:02,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:02,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:02,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:02,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:02,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:02,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:02,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:02,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:02,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:02,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:02,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:02,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:02,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:02,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:02,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:02,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:02,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:02,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:02,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:02,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:02,290 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:02,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:02,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:02,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:02,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:02,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:02,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:02,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:02,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:02,306 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:02,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:02,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:02,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:02,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:02,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:02,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:02,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:02,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:02,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:02,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:02,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:02,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:02,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:02,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:02,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:02,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:02,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:02,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:02,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:02,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:02,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:02,309 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:02,310 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:02,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:02,310 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 -> 3427cff38b27502f1724e7992c2bbd22dfeaf576101e50c5b78d18afb7a0563f [2022-02-20 20:40:02,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:02,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:02,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:02,506 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:02,507 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:02,508 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_true.i [2022-02-20 20:40:02,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f41be81/6c69d0fbeb7a42bf87f5609ef043b308/FLAG2a4eed358 [2022-02-20 20:40:02,965 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:02,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_18-first-reads_true.i [2022-02-20 20:40:02,974 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f41be81/6c69d0fbeb7a42bf87f5609ef043b308/FLAG2a4eed358 [2022-02-20 20:40:02,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f41be81/6c69d0fbeb7a42bf87f5609ef043b308 [2022-02-20 20:40:02,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:02,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:02,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:02,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:02,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:02,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:02" (1/1) ... [2022-02-20 20:40:02,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756c9d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:02, skipping insertion in model container [2022-02-20 20:40:02,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:02" (1/1) ... [2022-02-20 20:40:02,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:03,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:03,161 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_true.i[1088,1101] [2022-02-20 20:40:03,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:03,311 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:03,319 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_true.i[1088,1101] [2022-02-20 20:40:03,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:03,376 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:03,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:03 WrapperNode [2022-02-20 20:40:03,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:03,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:03,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:03,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:03,382 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:03" (1/1) ... [2022-02-20 20:40:03,397 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:03" (1/1) ... [2022-02-20 20:40:03,410 INFO L137 Inliner]: procedures = 163, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2022-02-20 20:40:03,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:03,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:03,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:03,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:03,419 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:03" (1/1) ... [2022-02-20 20:40:03,420 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:03" (1/1) ... [2022-02-20 20:40:03,423 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:03" (1/1) ... [2022-02-20 20:40:03,424 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:03" (1/1) ... [2022-02-20 20:40:03,431 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:03" (1/1) ... [2022-02-20 20:40:03,439 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:03" (1/1) ... [2022-02-20 20:40:03,443 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:03" (1/1) ... [2022-02-20 20:40:03,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:03,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:03,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:03,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:03,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:03" (1/1) ... [2022-02-20 20:40:03,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:03,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:03,480 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:03,499 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:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:40:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:03,519 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:03,520 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:03,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:03,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:03,521 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:03,619 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:03,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:03,752 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:03,757 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:03,757 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:03,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:03 BoogieIcfgContainer [2022-02-20 20:40:03,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:03,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:03,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:03,761 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:03,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:02" (1/3) ... [2022-02-20 20:40:03,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b437600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:03, skipping insertion in model container [2022-02-20 20:40:03,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:03" (2/3) ... [2022-02-20 20:40:03,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b437600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:03, skipping insertion in model container [2022-02-20 20:40:03,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:03" (3/3) ... [2022-02-20 20:40:03,763 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_18-first-reads_true.i [2022-02-20 20:40:03,766 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:03,766 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:03,767 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:40:03,767 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:03,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,789 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,789 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,789 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,790 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,790 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,790 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,792 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,794 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,794 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,794 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,795 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,796 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,796 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,796 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,796 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,796 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,797 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,797 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,797 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,798 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,800 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,800 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,800 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,801 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,801 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:03,805 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:40:03,832 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:03,836 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:03,836 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:40:03,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 74 transitions, 156 flow [2022-02-20 20:40:03,880 INFO L129 PetriNetUnfolder]: 3/73 cut-off events. [2022-02-20 20:40:03,881 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:03,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 73 events. 3/73 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2022-02-20 20:40:03,883 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 74 transitions, 156 flow [2022-02-20 20:40:03,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 65 transitions, 133 flow [2022-02-20 20:40:03,890 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2022-02-20 20:40:03,890 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:03,891 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:03,899 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] [2022-02-20 20:40:03,899 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:03,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1283893648, now seen corresponding path program 1 times [2022-02-20 20:40:03,909 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:03,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594918080] [2022-02-20 20:40:03,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:03,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:04,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {78#true} [142] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78#true} is VALID [2022-02-20 20:40:04,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {78#true} [128] 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] {78#true} is VALID [2022-02-20 20:40:04,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {78#true} [149] 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[] {78#true} is VALID [2022-02-20 20:40:04,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {78#true} [153] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {78#true} is VALID [2022-02-20 20:40:04,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {78#true} [108] 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[] {78#true} is VALID [2022-02-20 20:40:04,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {78#true} [143] 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[] {78#true} is VALID [2022-02-20 20:40:04,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {78#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[] {78#true} is VALID [2022-02-20 20:40:04,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {78#true} [135] L18-3-->L18-4: Formula: (and (= 36 (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[] {78#true} is VALID [2022-02-20 20:40:04,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {78#true} [136] L18-4-->L683: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {80#(= ~glob1~0 0)} [96] 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] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {80#(= ~glob1~0 0)} [141] 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[] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {80#(= ~glob1~0 0)} [127] 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[] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {80#(= ~glob1~0 0)} [146] 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[] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {80#(= ~glob1~0 0)} [89] 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[] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {80#(= ~glob1~0 0)} [147] 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[] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {80#(= ~glob1~0 0)} [124] 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[] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {80#(= ~glob1~0 0)} [121] L683-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {80#(= ~glob1~0 0)} [156] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {80#(= ~glob1~0 0)} [134] 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] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {80#(= ~glob1~0 0)} [100] L-1-5-->L696: 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] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {80#(= ~glob1~0 0)} [137] L696-->L696-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] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {80#(= ~glob1~0 0)} [125] L696-1-->L697: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {80#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {80#(= ~glob1~0 0)} [119] L697-->L697-1: Formula: (= (ite (= v_~glob1~0_2 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {81#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:04,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {81#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [101] L697-1-->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] {81#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:04,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {81#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [118] 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] {82#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:04,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {82#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [103] 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[] {79#false} is VALID [2022-02-20 20:40:04,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {79#false} [122] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#false} is VALID [2022-02-20 20:40:04,113 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:04,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:04,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594918080] [2022-02-20 20:40:04,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594918080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:04,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:04,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:04,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621133360] [2022-02-20 20:40:04,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:04,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2022-02-20 20:40:04,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:04,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:04,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:04,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:04,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:04,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:04,177 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 74 [2022-02-20 20:40:04,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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:04,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:04,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 74 [2022-02-20 20:40:04,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:04,331 INFO L129 PetriNetUnfolder]: 28/152 cut-off events. [2022-02-20 20:40:04,331 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:04,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 152 events. 28/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 504 event pairs, 6 based on Foata normal form. 3/149 useless extension candidates. Maximal degree in co-relation 188. Up to 24 conditions per place. [2022-02-20 20:40:04,333 INFO L132 encePairwiseOnDemand]: 62/74 looper letters, 10 selfloop transitions, 9 changer transitions 21/81 dead transitions. [2022-02-20 20:40:04,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 237 flow [2022-02-20 20:40:04,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:40:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:40:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 527 transitions. [2022-02-20 20:40:04,364 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7912912912912913 [2022-02-20 20:40:04,365 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 527 transitions. [2022-02-20 20:40:04,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 527 transitions. [2022-02-20 20:40:04,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:04,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 527 transitions. [2022-02-20 20:40:04,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 58.55555555555556) internal successors, (527), 9 states have internal predecessors, (527), 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:04,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 74.0) internal successors, (740), 10 states have internal predecessors, (740), 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:04,380 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 74.0) internal successors, (740), 10 states have internal predecessors, (740), 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:04,381 INFO L186 Difference]: Start difference. First operand has 66 places, 65 transitions, 133 flow. Second operand 9 states and 527 transitions. [2022-02-20 20:40:04,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 237 flow [2022-02-20 20:40:04,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 81 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:04,391 INFO L242 Difference]: Finished difference. Result has 73 places, 56 transitions, 146 flow [2022-02-20 20:40:04,393 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=146, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2022-02-20 20:40:04,396 INFO L334 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2022-02-20 20:40:04,397 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 56 transitions, 146 flow [2022-02-20 20:40:04,412 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 121 states, 120 states have (on average 1.55) internal successors, (186), 120 states have internal predecessors, (186), 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:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 121 states, 120 states have (on average 1.55) internal successors, (186), 120 states have internal predecessors, (186), 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 27 [2022-02-20 20:40:04,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:04,415 INFO L470 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 146 flow [2022-02-20 20:40:04,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 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:04,416 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:04,416 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] [2022-02-20 20:40:04,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:04,416 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:04,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash -479425025, now seen corresponding path program 1 times [2022-02-20 20:40:04,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:04,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897778433] [2022-02-20 20:40:04,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:04,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:04,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#true} [142] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-02-20 20:40:04,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} [128] 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] {218#true} is VALID [2022-02-20 20:40:04,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} [149] 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[] {218#true} is VALID [2022-02-20 20:40:04,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {218#true} [153] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {218#true} is VALID [2022-02-20 20:40:04,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {218#true} [108] 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[] {218#true} is VALID [2022-02-20 20:40:04,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} [143] 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[] {218#true} is VALID [2022-02-20 20:40:04,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {218#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[] {218#true} is VALID [2022-02-20 20:40:04,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#true} [135] L18-3-->L18-4: Formula: (and (= 36 (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[] {218#true} is VALID [2022-02-20 20:40:04,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#true} [136] L18-4-->L683: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {218#true} is VALID [2022-02-20 20:40:04,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#true} [96] 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] {218#true} is VALID [2022-02-20 20:40:04,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#true} [141] 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[] {218#true} is VALID [2022-02-20 20:40:04,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#true} [127] 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[] {218#true} is VALID [2022-02-20 20:40:04,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {218#true} [146] 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[] {218#true} is VALID [2022-02-20 20:40:04,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {218#true} [89] 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[] {218#true} is VALID [2022-02-20 20:40:04,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {218#true} [147] 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[] {218#true} is VALID [2022-02-20 20:40:04,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {218#true} [124] 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[] {218#true} is VALID [2022-02-20 20:40:04,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {218#true} [121] L683-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-02-20 20:40:04,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {218#true} [156] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-02-20 20:40:04,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {218#true} [134] 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] {218#true} is VALID [2022-02-20 20:40:04,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {218#true} [100] L-1-5-->L696: 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] {218#true} is VALID [2022-02-20 20:40:04,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {218#true} [137] L696-->L696-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] {218#true} is VALID [2022-02-20 20:40:04,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {218#true} [125] L696-1-->L697: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-02-20 20:40:04,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {218#true} [119] L697-->L697-1: Formula: (= (ite (= v_~glob1~0_2 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {218#true} is VALID [2022-02-20 20:40:04,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {218#true} [101] L697-1-->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] {218#true} is VALID [2022-02-20 20:40:04,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {218#true} [118] 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] {218#true} is VALID [2022-02-20 20:40:04,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {218#true} [104] L19-1-->L19-5: Formula: (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_4| 0)) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} AuxVars[] AssignedVars[] {218#true} is VALID [2022-02-20 20:40:04,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {218#true} [155] L19-5-->L698: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218#true} is VALID [2022-02-20 20:40:04,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {218#true} [115] L698-->L698-1: 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] {218#true} is VALID [2022-02-20 20:40:04,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {218#true} [113] L698-1-->L698-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {218#true} is VALID [2022-02-20 20:40:04,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {218#true} [140] L698-2-->L698-3: 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] {218#true} is VALID [2022-02-20 20:40:04,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {218#true} [177] L698-3-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~t~0=v_t_funThread1of1ForFork0_~t~0_10, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_8|, 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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~t~0, 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] {218#true} is VALID [2022-02-20 20:40:04,537 INFO L290 TraceCheckUtils]: 31: Hoare triple {218#true} [114] L698-4-->L698-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {218#true} is VALID [2022-02-20 20:40:04,537 INFO L290 TraceCheckUtils]: 32: Hoare triple {218#true} [144] L698-5-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {218#true} is VALID [2022-02-20 20:40:04,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {218#true} [131] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#mutex1~0.base_7|))) (and (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#mutex1~0.base_7| (store .cse0 |v_~#mutex1~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= (select .cse0 |v_~#mutex1~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:04,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [102] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:04,539 INFO L290 TraceCheckUtils]: 35: Hoare triple {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [154] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:04,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [162] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:04,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [163] L685-->L685-1: Formula: (and (<= 0 (+ |v_t_funThread1of1ForFork0_#t~nondet1_1| 2147483648)) (<= |v_t_funThread1of1ForFork0_#t~nondet1_1| 2147483647)) InVars {t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[] {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:04,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [164] L685-1-->L685-2: Formula: (= |v_t_funThread1of1ForFork0_#t~nondet1_3| v_t_funThread1of1ForFork0_~t~0_1) InVars {t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} OutVars{t_funThread1of1ForFork0_~t~0=v_t_funThread1of1ForFork0_~t~0_1, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~t~0] {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:04,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [165] L685-2-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:04,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {220#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [166] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#mutex1~0.base_9|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= (select .cse0 |v_~#mutex1~0.offset_9|) 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex1~0.base_9| (store .cse0 |v_~#mutex1~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_9|, ~#mutex1~0.base=|v_~#mutex1~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_9|, ~#mutex1~0.base=|v_~#mutex1~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {219#false} is VALID [2022-02-20 20:40:04,542 INFO L290 TraceCheckUtils]: 41: Hoare triple {219#false} [167] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {219#false} is VALID [2022-02-20 20:40:04,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {219#false} [168] L687-->L688: Formula: (= 42 v_t_funThread1of1ForFork0_~t~0_3) InVars {t_funThread1of1ForFork0_~t~0=v_t_funThread1of1ForFork0_~t~0_3} OutVars{t_funThread1of1ForFork0_~t~0=v_t_funThread1of1ForFork0_~t~0_3} AuxVars[] AssignedVars[] {219#false} is VALID [2022-02-20 20:40:04,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {219#false} [170] L688-->L687-2: Formula: (= v_~glob1~0_4 1) InVars {} OutVars{~glob1~0=v_~glob1~0_4} AuxVars[] AssignedVars[~glob1~0] {221#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:04,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {221#(= ~glob1~0 0)} [158] L700-1-->L700-2: Formula: (= (ite (= v_~glob1~0_3 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|) InVars {~glob1~0=v_~glob1~0_3} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|, ~glob1~0=v_~glob1~0_3} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {222#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:04,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {222#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [110] L700-2-->L19-6: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {222#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:04,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {222#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [152] L19-6-->L19-7: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_6| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_6|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {223#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:04,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {223#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [91] L19-7-->L19-8: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_7| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] {219#false} is VALID [2022-02-20 20:40:04,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {219#false} [93] L19-8-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#false} is VALID [2022-02-20 20:40:04,545 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:04,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:04,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897778433] [2022-02-20 20:40:04,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897778433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:04,545 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:04,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:04,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877225627] [2022-02-20 20:40:04,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:04,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 49 [2022-02-20 20:40:04,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:04,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:04,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:04,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:04,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:04,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:04,580 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2022-02-20 20:40:04,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 47.166666666666664) internal successors, (283), 6 states have internal predecessors, (283), 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:04,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:04,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2022-02-20 20:40:04,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:04,655 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2022-02-20 20:40:04,655 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-02-20 20:40:04,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 45 events. 0/45 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 4/49 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-02-20 20:40:04,656 INFO L132 encePairwiseOnDemand]: 68/74 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2022-02-20 20:40:04,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 45 transitions, 137 flow [2022-02-20 20:40:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 327 transitions. [2022-02-20 20:40:04,660 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6312741312741312 [2022-02-20 20:40:04,660 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 327 transitions. [2022-02-20 20:40:04,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 327 transitions. [2022-02-20 20:40:04,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:04,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 327 transitions. [2022-02-20 20:40:04,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 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:04,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 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:04,663 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 74.0) internal successors, (592), 8 states have internal predecessors, (592), 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:04,663 INFO L186 Difference]: Start difference. First operand has 73 places, 56 transitions, 146 flow. Second operand 7 states and 327 transitions. [2022-02-20 20:40:04,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 45 transitions, 137 flow [2022-02-20 20:40:04,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 125 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-02-20 20:40:04,664 INFO L242 Difference]: Finished difference. Result has 56 places, 0 transitions, 0 flow [2022-02-20 20:40:04,665 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=56, PETRI_TRANSITIONS=0} [2022-02-20 20:40:04,665 INFO L334 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2022-02-20 20:40:04,665 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 0 transitions, 0 flow [2022-02-20 20:40:04,665 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:04,666 INFO L78 Accepts]: Start accepts. Automaton has has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 20:40:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:04,666 INFO L470 AbstractCegarLoop]: Abstraction has has 56 places, 0 transitions, 0 flow [2022-02-20 20:40:04,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.166666666666664) internal successors, (283), 6 states have internal predecessors, (283), 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:04,668 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 20:40:04,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-20 20:40:04,669 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 3 remaining) [2022-02-20 20:40:04,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:04,671 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 20:40:04,673 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:04,673 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:04,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:04 BasicIcfg [2022-02-20 20:40:04,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:04,676 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:04,676 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:04,676 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:04,676 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:03" (3/4) ... [2022-02-20 20:40:04,678 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:04,682 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:04,684 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-02-20 20:40:04,684 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:04,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:04,685 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:04,705 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:04,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:04,706 INFO L158 Benchmark]: Toolchain (without parser) took 1719.82ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 63.8MB in the beginning and 84.2MB in the end (delta: -20.4MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2022-02-20 20:40:04,706 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:04,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.30ms. Allocated memory is still 104.9MB. Free memory was 63.6MB in the beginning and 71.1MB in the end (delta: -7.5MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-02-20 20:40:04,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.25ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 69.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:04,707 INFO L158 Benchmark]: Boogie Preprocessor took 37.40ms. Allocated memory is still 104.9MB. Free memory was 69.0MB in the beginning and 67.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:04,707 INFO L158 Benchmark]: RCFGBuilder took 309.61ms. Allocated memory is still 104.9MB. Free memory was 67.6MB in the beginning and 55.0MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 20:40:04,708 INFO L158 Benchmark]: TraceAbstraction took 916.35ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 54.4MB in the beginning and 86.9MB in the end (delta: -32.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:04,708 INFO L158 Benchmark]: Witness Printer took 29.21ms. Allocated memory is still 134.2MB. Free memory was 86.9MB in the beginning and 84.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:04,709 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.17ms. Allocated memory is still 104.9MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.30ms. Allocated memory is still 104.9MB. Free memory was 63.6MB in the beginning and 71.1MB in the end (delta: -7.5MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.25ms. Allocated memory is still 104.9MB. Free memory was 71.1MB in the beginning and 69.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.40ms. Allocated memory is still 104.9MB. Free memory was 69.0MB in the beginning and 67.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 309.61ms. Allocated memory is still 104.9MB. Free memory was 67.6MB in the beginning and 55.0MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 916.35ms. Allocated memory was 104.9MB in the beginning and 134.2MB in the end (delta: 29.4MB). Free memory was 54.4MB in the beginning and 86.9MB in the end (delta: -32.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 29.21ms. Allocated memory is still 134.2MB. Free memory was 86.9MB in the beginning and 84.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 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.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 19 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=1, InterpolantAutomatonStates: 16, 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, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:40:04,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE