./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_19-publish-precision_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_19-publish-precision_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 c983783f5358911c3fbbb6a10a3bc1f70631f1803357161b1c0bc876f490a9b5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:11,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:11,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:11,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:11,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:11,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:11,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:11,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:11,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:11,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:11,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:11,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:11,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:11,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:11,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:11,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:11,763 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:11,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:11,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:11,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:11,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:11,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:11,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:11,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:11,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:11,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:11,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:11,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:11,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:11,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:11,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:11,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:11,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:11,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:11,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:11,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:11,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:11,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:11,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:11,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:11,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:11,784 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:11,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:11,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:11,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:11,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:11,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:11,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:11,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:11,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:11,809 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:11,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:11,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:11,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:11,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:11,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:11,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:11,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:11,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:11,811 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:11,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:11,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:11,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:11,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:11,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:11,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:11,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:11,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:11,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:11,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:11,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:11,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:11,814 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:11,814 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:11,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:11,815 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 -> c983783f5358911c3fbbb6a10a3bc1f70631f1803357161b1c0bc876f490a9b5 [2022-02-20 20:40:11,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:11,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:11,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:11,996 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:11,996 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:11,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_19-publish-precision_true.i [2022-02-20 20:40:12,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb878361/4116e38843db4cd59df19544f9741066/FLAGd0d05716a [2022-02-20 20:40:12,457 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:12,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_19-publish-precision_true.i [2022-02-20 20:40:12,470 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb878361/4116e38843db4cd59df19544f9741066/FLAGd0d05716a [2022-02-20 20:40:12,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb878361/4116e38843db4cd59df19544f9741066 [2022-02-20 20:40:12,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:12,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:12,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:12,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:12,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:12,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:12" (1/1) ... [2022-02-20 20:40:12,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29aa1da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:12, skipping insertion in model container [2022-02-20 20:40:12,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:12" (1/1) ... [2022-02-20 20:40:12,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:12,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:13,006 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_19-publish-precision_true.i[1094,1107] [2022-02-20 20:40:13,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:13,133 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:13,142 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_19-publish-precision_true.i[1094,1107] [2022-02-20 20:40:13,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:13,218 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:13,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:13 WrapperNode [2022-02-20 20:40:13,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:13,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:13,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:13,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:13,224 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:13" (1/1) ... [2022-02-20 20:40:13,250 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:13" (1/1) ... [2022-02-20 20:40:13,266 INFO L137 Inliner]: procedures = 162, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2022-02-20 20:40:13,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:13,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:13,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:13,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:13,272 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:13" (1/1) ... [2022-02-20 20:40:13,272 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:13" (1/1) ... [2022-02-20 20:40:13,276 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:13" (1/1) ... [2022-02-20 20:40:13,277 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:13" (1/1) ... [2022-02-20 20:40:13,291 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:13" (1/1) ... [2022-02-20 20:40:13,293 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:13" (1/1) ... [2022-02-20 20:40:13,294 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:13" (1/1) ... [2022-02-20 20:40:13,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:13,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:13,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:13,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:13,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:13" (1/1) ... [2022-02-20 20:40:13,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:13,322 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:13,340 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:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:40:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:13,366 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:13,458 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:13,459 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:13,636 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:13,643 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:13,643 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:13,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:13 BoogieIcfgContainer [2022-02-20 20:40:13,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:13,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:13,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:13,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:13,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:12" (1/3) ... [2022-02-20 20:40:13,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28761009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:13, skipping insertion in model container [2022-02-20 20:40:13,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:13" (2/3) ... [2022-02-20 20:40:13,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28761009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:13, skipping insertion in model container [2022-02-20 20:40:13,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:13" (3/3) ... [2022-02-20 20:40:13,655 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_19-publish-precision_true.i [2022-02-20 20:40:13,659 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:13,659 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:13,659 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:40:13,659 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:13,701 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,702 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,703 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,704 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,705 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,706 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,707 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,707 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,707 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,707 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,708 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,708 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,708 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,708 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,708 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,709 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,709 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,709 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,710 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,710 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,711 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,711 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,714 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,714 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,714 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,714 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,715 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,715 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,715 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,715 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,715 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:13,721 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:40:13,752 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:13,757 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:13,758 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 20:40:13,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 81 transitions, 170 flow [2022-02-20 20:40:13,802 INFO L129 PetriNetUnfolder]: 2/80 cut-off events. [2022-02-20 20:40:13,804 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:13,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 80 events. 2/80 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2022-02-20 20:40:13,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 81 transitions, 170 flow [2022-02-20 20:40:13,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 63 transitions, 129 flow [2022-02-20 20:40:13,825 INFO L129 PetriNetUnfolder]: 1/37 cut-off events. [2022-02-20 20:40:13,825 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:13,826 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:13,826 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] [2022-02-20 20:40:13,827 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:40:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1050706074, now seen corresponding path program 1 times [2022-02-20 20:40:13,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:13,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451011392] [2022-02-20 20:40:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:13,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:14,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} [152] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:40:14,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} [136] 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] {86#true} is VALID [2022-02-20 20:40:14,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {86#true} [160] 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[] {86#true} is VALID [2022-02-20 20:40:14,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {86#true} [164] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:40:14,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {86#true} [120] 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[] {86#true} is VALID [2022-02-20 20:40:14,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {86#true} [153] 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[] {86#true} is VALID [2022-02-20 20:40:14,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {86#true} [142] 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[] {86#true} is VALID [2022-02-20 20:40:14,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {86#true} [145] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 42 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:40:14,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {86#true} [146] L18-4-->L682: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {88#(= ~glob1~0 0)} [96] L682-->L682-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] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {88#(= ~glob1~0 0)} [121] L682-1-->L682-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[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {88#(= ~glob1~0 0)} [98] L682-2-->L682-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[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {88#(= ~glob1~0 0)} [163] L682-3-->L682-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[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {88#(= ~glob1~0 0)} [133] L682-4-->L682-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[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {88#(= ~glob1~0 0)} [168] L682-5-->L682-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[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {88#(= ~glob1~0 0)} [113] L682-6-->L682-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[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {88#(= ~glob1~0 0)} [156] L682-7-->L683: Formula: (and (= |v_~#mutex2~0.base_1| 4) (= |v_~#mutex2~0.offset_1| 0)) InVars {} OutVars{~#mutex2~0.base=|v_~#mutex2~0.base_1|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_1|} AuxVars[] AssignedVars[~#mutex2~0.offset, ~#mutex2~0.base] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {88#(= ~glob1~0 0)} [101] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {88#(= ~glob1~0 0)} [151] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex2~0.base_2|) |v_~#mutex2~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} AuxVars[] AssignedVars[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {88#(= ~glob1~0 0)} [135] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#mutex2~0.base_3|) (+ |v_~#mutex2~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} AuxVars[] AssignedVars[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {88#(= ~glob1~0 0)} [157] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#mutex2~0.base_4|) (+ |v_~#mutex2~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} AuxVars[] AssignedVars[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {88#(= ~glob1~0 0)} [95] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#mutex2~0.base_5|) (+ |v_~#mutex2~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} AuxVars[] AssignedVars[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {88#(= ~glob1~0 0)} [158] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#mutex2~0.base_6|) (+ 16 |v_~#mutex2~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} AuxVars[] AssignedVars[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {88#(= ~glob1~0 0)} [134] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {88#(= ~glob1~0 0)} [167] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {88#(= ~glob1~0 0)} [144] 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] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {88#(= ~glob1~0 0)} [105] L-1-5-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {88#(= ~glob1~0 0)} [129] L697-->L697-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {88#(= ~glob1~0 0)} [106] L697-1-->L698: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {88#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:14,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {88#(= ~glob1~0 0)} [125] L698-->L698-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] {89#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:14,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {89#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [124] L698-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] {89#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:14,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {89#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [128] 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] {90#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:14,143 INFO L290 TraceCheckUtils]: 32: Hoare triple {90#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [115] 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[] {87#false} is VALID [2022-02-20 20:40:14,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {87#false} [131] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#false} is VALID [2022-02-20 20:40:14,145 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:14,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:14,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451011392] [2022-02-20 20:40:14,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451011392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:14,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:14,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:14,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32419333] [2022-02-20 20:40:14,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:14,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2022-02-20 20:40:14,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:14,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:14,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:14,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:14,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:14,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:14,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:14,235 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 81 [2022-02-20 20:40:14,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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:14,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:14,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 81 [2022-02-20 20:40:14,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:14,283 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2022-02-20 20:40:14,283 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:14,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 59 events. 0/59 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-02-20 20:40:14,285 INFO L132 encePairwiseOnDemand]: 76/81 looper letters, 4 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2022-02-20 20:40:14,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 137 flow [2022-02-20 20:40:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:40:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:40:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 405 transitions. [2022-02-20 20:40:14,299 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-02-20 20:40:14,300 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 405 transitions. [2022-02-20 20:40:14,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 405 transitions. [2022-02-20 20:40:14,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:14,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 405 transitions. [2022-02-20 20:40:14,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:14,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 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:14,313 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 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:14,315 INFO L186 Difference]: Start difference. First operand has 66 places, 63 transitions, 129 flow. Second operand 6 states and 405 transitions. [2022-02-20 20:40:14,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 137 flow [2022-02-20 20:40:14,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 59 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:14,322 INFO L242 Difference]: Finished difference. Result has 67 places, 59 transitions, 128 flow [2022-02-20 20:40:14,324 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2022-02-20 20:40:14,327 INFO L334 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2022-02-20 20:40:14,328 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 59 transitions, 128 flow [2022-02-20 20:40:14,337 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 150 states, 149 states have (on average 1.604026845637584) internal successors, (239), 149 states have internal predecessors, (239), 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:14,338 INFO L78 Accepts]: Start accepts. Automaton has has 150 states, 149 states have (on average 1.604026845637584) internal successors, (239), 149 states have internal predecessors, (239), 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 34 [2022-02-20 20:40:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:14,339 INFO L470 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 128 flow [2022-02-20 20:40:14,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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:14,339 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:14,339 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:14,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:14,340 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:40:14,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash 63925959, now seen corresponding path program 1 times [2022-02-20 20:40:14,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:14,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429863439] [2022-02-20 20:40:14,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:14,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:14,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {249#true} [152] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#true} [136] 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] {249#true} is VALID [2022-02-20 20:40:14,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} [160] 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[] {249#true} is VALID [2022-02-20 20:40:14,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {249#true} [164] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {249#true} [120] 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[] {249#true} is VALID [2022-02-20 20:40:14,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#true} [153] 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[] {249#true} is VALID [2022-02-20 20:40:14,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {249#true} [142] 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[] {249#true} is VALID [2022-02-20 20:40:14,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#true} [145] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 42 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#true} [146] L18-4-->L682: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {249#true} is VALID [2022-02-20 20:40:14,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {249#true} [96] L682-->L682-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] {249#true} is VALID [2022-02-20 20:40:14,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#true} [121] L682-1-->L682-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[] {249#true} is VALID [2022-02-20 20:40:14,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {249#true} [98] L682-2-->L682-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[] {249#true} is VALID [2022-02-20 20:40:14,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#true} [163] L682-3-->L682-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[] {249#true} is VALID [2022-02-20 20:40:14,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {249#true} [133] L682-4-->L682-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[] {249#true} is VALID [2022-02-20 20:40:14,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {249#true} [168] L682-5-->L682-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[] {249#true} is VALID [2022-02-20 20:40:14,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {249#true} [113] L682-6-->L682-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[] {249#true} is VALID [2022-02-20 20:40:14,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {249#true} [156] L682-7-->L683: Formula: (and (= |v_~#mutex2~0.base_1| 4) (= |v_~#mutex2~0.offset_1| 0)) InVars {} OutVars{~#mutex2~0.base=|v_~#mutex2~0.base_1|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_1|} AuxVars[] AssignedVars[~#mutex2~0.offset, ~#mutex2~0.base] {249#true} is VALID [2022-02-20 20:40:14,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {249#true} [101] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {249#true} [151] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex2~0.base_2|) |v_~#mutex2~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {249#true} [135] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#mutex2~0.base_3|) (+ |v_~#mutex2~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {249#true} [157] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#mutex2~0.base_4|) (+ |v_~#mutex2~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {249#true} [95] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#mutex2~0.base_5|) (+ |v_~#mutex2~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {249#true} [158] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#mutex2~0.base_6|) (+ 16 |v_~#mutex2~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {249#true} [134] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {249#true} [167] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {249#true} [144] 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] {249#true} is VALID [2022-02-20 20:40:14,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {249#true} [105] L-1-5-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {249#true} is VALID [2022-02-20 20:40:14,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {249#true} [129] L697-->L697-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {249#true} is VALID [2022-02-20 20:40:14,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {249#true} [106] L697-1-->L698: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {249#true} [125] L698-->L698-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] {249#true} is VALID [2022-02-20 20:40:14,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {249#true} [124] L698-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] {249#true} is VALID [2022-02-20 20:40:14,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {249#true} [128] 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] {249#true} is VALID [2022-02-20 20:40:14,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {249#true} [116] 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[] {249#true} is VALID [2022-02-20 20:40:14,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {249#true} [166] L19-5-->L699: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:14,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {249#true} [140] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {249#true} is VALID [2022-02-20 20:40:14,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {249#true} [114] L699-1-->L699-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {249#true} is VALID [2022-02-20 20:40:14,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {249#true} [102] L699-2-->L699-3: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {249#true} is VALID [2022-02-20 20:40:14,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {249#true} [197] L699-3-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_6|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_6|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_6|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_10|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {249#true} is VALID [2022-02-20 20:40:14,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {249#true} [172] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {249#true} is VALID [2022-02-20 20:40:14,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {249#true} [173] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#mutex1~0.base_7|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 0) (= 0 (select .cse0 |v_~#mutex1~0.offset_7|)) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex1~0.base_7| (store .cse0 |v_~#mutex1~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1] {249#true} is VALID [2022-02-20 20:40:14,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {249#true} [174] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {249#true} is VALID [2022-02-20 20:40:14,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {249#true} [175] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#mutex2~0.base_9|))) (and (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#mutex2~0.base_9| (store .cse0 |v_~#mutex2~0.offset_9| 1))) (= (select .cse0 |v_~#mutex2~0.offset_9|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet2#1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_9|, ~#mutex2~0.base=|v_~#mutex2~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_9|, ~#mutex2~0.base=|v_~#mutex2~0.base_9|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2#1] {249#true} is VALID [2022-02-20 20:40:14,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {249#true} [176] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2#1] {249#true} is VALID [2022-02-20 20:40:14,447 INFO L290 TraceCheckUtils]: 43: Hoare triple {249#true} [177] L687-->L688: Formula: (= 5 v_~glob1~0_3) InVars {} OutVars{~glob1~0=v_~glob1~0_3} AuxVars[] AssignedVars[~glob1~0] {251#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:14,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {251#(= 5 ~glob1~0)} [178] L688-->L689: Formula: (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#mutex2~0.base_10| (store (select |v_#pthreadsMutex_10| |v_~#mutex2~0.base_10|) |v_~#mutex2~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_10|, ~#mutex2~0.base=|v_~#mutex2~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_10|, ~#mutex2~0.base=|v_~#mutex2~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex] {251#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:14,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {251#(= 5 ~glob1~0)} [179] L689-->L689-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#mutex2~0.base_11|))) (and (= (select .cse0 |v_~#mutex2~0.offset_11|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet3#1_1| 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#mutex2~0.base_11| (store .cse0 |v_~#mutex2~0.offset_11| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_11|, ~#mutex2~0.base=|v_~#mutex2~0.base_11|} OutVars{t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_1|, #pthreadsMutex=|v_#pthreadsMutex_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_11|, ~#mutex2~0.base=|v_~#mutex2~0.base_11|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet3#1] {251#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:14,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {251#(= 5 ~glob1~0)} [180] L689-1-->L690: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet3#1] {251#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:14,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {251#(= 5 ~glob1~0)} [181] L690-->L690-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:14,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {251#(= 5 ~glob1~0)} [182] L690-1-->L690-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (= 5 v_~glob1~0_4) 1 0)) InVars {~glob1~0=v_~glob1~0_4} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_4} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1] {252#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:14,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {252#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [183] L690-2-->L19: Formula: true InVars {} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {252#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:14,451 INFO L290 TraceCheckUtils]: 50: Hoare triple {252#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [184] L19-->L19-1: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {253#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:14,451 INFO L290 TraceCheckUtils]: 51: Hoare triple {253#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} [185] L19-1-->L19-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5| 0) InVars {t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {250#false} is VALID [2022-02-20 20:40:14,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {250#false} [187] L19-2-->t_funErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#false} is VALID [2022-02-20 20:40:14,452 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:14,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:14,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429863439] [2022-02-20 20:40:14,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429863439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:14,452 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:14,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:14,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216063026] [2022-02-20 20:40:14,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:14,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2022-02-20 20:40:14,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:14,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:14,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:14,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:14,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:14,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:14,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:14,512 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 81 [2022-02-20 20:40:14,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 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:14,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:14,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 81 [2022-02-20 20:40:14,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:14,557 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2022-02-20 20:40:14,557 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-02-20 20:40:14,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 57 events. 0/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 1/58 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-02-20 20:40:14,558 INFO L132 encePairwiseOnDemand]: 77/81 looper letters, 0 selfloop transitions, 0 changer transitions 57/57 dead transitions. [2022-02-20 20:40:14,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 57 transitions, 138 flow [2022-02-20 20:40:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2022-02-20 20:40:14,563 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8345679012345679 [2022-02-20 20:40:14,563 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 338 transitions. [2022-02-20 20:40:14,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 338 transitions. [2022-02-20 20:40:14,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:14,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 338 transitions. [2022-02-20 20:40:14,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 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:14,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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:14,566 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 81.0) internal successors, (486), 6 states have internal predecessors, (486), 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:14,567 INFO L186 Difference]: Start difference. First operand has 67 places, 59 transitions, 128 flow. Second operand 5 states and 338 transitions. [2022-02-20 20:40:14,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 57 transitions, 138 flow [2022-02-20 20:40:14,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 57 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:40:14,568 INFO L242 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2022-02-20 20:40:14,568 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2022-02-20 20:40:14,569 INFO L334 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2022-02-20 20:40:14,569 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 0 transitions, 0 flow [2022-02-20 20:40:14,569 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:14,569 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 53 [2022-02-20 20:40:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:14,569 INFO L470 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2022-02-20 20:40:14,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 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:14,572 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-02-20 20:40:14,573 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-02-20 20:40:14,573 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-02-20 20:40:14,574 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-02-20 20:40:14,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:14,577 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 20:40:14,579 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:14,579 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:14,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:14 BasicIcfg [2022-02-20 20:40:14,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:14,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:14,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:14,583 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:14,583 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:13" (3/4) ... [2022-02-20 20:40:14,584 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:14,588 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:14,590 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 20:40:14,590 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:14,590 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:14,590 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:14,611 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:14,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:14,612 INFO L158 Benchmark]: Toolchain (without parser) took 1766.28ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 67.1MB in the beginning and 67.6MB in the end (delta: -522.9kB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2022-02-20 20:40:14,613 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory was 56.0MB in the beginning and 55.9MB in the end (delta: 42.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:14,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.33ms. Allocated memory is still 98.6MB. Free memory was 66.9MB in the beginning and 64.0MB in the end (delta: 2.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 20:40:14,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.34ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 61.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:14,614 INFO L158 Benchmark]: Boogie Preprocessor took 28.66ms. Allocated memory is still 98.6MB. Free memory was 61.8MB in the beginning and 60.4MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:40:14,614 INFO L158 Benchmark]: RCFGBuilder took 349.24ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 60.1MB in the beginning and 108.0MB in the end (delta: -47.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-02-20 20:40:14,614 INFO L158 Benchmark]: TraceAbstraction took 930.62ms. Allocated memory is still 132.1MB. Free memory was 107.2MB in the beginning and 70.5MB in the end (delta: 36.8MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2022-02-20 20:40:14,614 INFO L158 Benchmark]: Witness Printer took 29.18ms. Allocated memory is still 132.1MB. Free memory was 70.5MB in the beginning and 67.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:40:14,616 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 98.6MB. Free memory was 56.0MB in the beginning and 55.9MB in the end (delta: 42.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.33ms. Allocated memory is still 98.6MB. Free memory was 66.9MB in the beginning and 64.0MB in the end (delta: 2.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.34ms. Allocated memory is still 98.6MB. Free memory was 64.0MB in the beginning and 61.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.66ms. Allocated memory is still 98.6MB. Free memory was 61.8MB in the beginning and 60.4MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 349.24ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 60.1MB in the beginning and 108.0MB in the end (delta: -47.9MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 930.62ms. Allocated memory is still 132.1MB. Free memory was 107.2MB in the beginning and 70.5MB in the end (delta: 36.8MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Witness Printer took 29.18ms. Allocated memory is still 132.1MB. Free memory was 70.5MB in the beginning and 67.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 105 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 8 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 155 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:14,643 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