./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-1_1-join.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/ldv-races/race-1_1-join.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 ab598119c4148bae0d8b880ae1fca3b30d4f7d9a1b46bb07e7f3565fa04f9e72 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:36:18,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:36:18,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:36:18,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:36:18,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:36:18,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:36:18,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:36:18,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:36:18,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:36:18,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:36:18,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:36:18,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:36:18,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:36:18,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:36:18,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:36:18,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:36:18,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:36:18,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:36:18,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:36:18,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:36:18,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:36:18,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:36:18,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:36:18,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:36:18,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:36:18,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:36:18,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:36:18,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:36:18,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:36:18,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:36:18,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:36:18,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:36:18,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:36:18,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:36:18,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:36:18,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:36:18,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:36:18,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:36:18,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:36:18,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:36:18,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:36:18,955 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:36:18,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:36:18,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:36:18,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:36:18,969 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:36:18,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:36:18,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:36:18,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:36:18,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:36:18,970 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:36:18,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:36:18,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:36:18,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:36:18,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:36:18,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:36:18,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:36:18,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:36:18,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:36:18,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:36:18,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:36:18,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:36:18,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:36:18,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:36:18,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:36:18,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:36:18,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:36:18,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:36:18,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:36:18,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:36:18,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:36:18,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:36:18,974 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:36:18,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:36:18,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:36:18,975 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 -> ab598119c4148bae0d8b880ae1fca3b30d4f7d9a1b46bb07e7f3565fa04f9e72 [2022-02-20 20:36:19,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:36:19,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:36:19,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:36:19,157 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:36:19,159 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:36:19,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-1_1-join.i [2022-02-20 20:36:19,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b78b96d/38388bc019ea415aa8fac1065a36b585/FLAGc186d229a [2022-02-20 20:36:19,593 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:36:19,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_1-join.i [2022-02-20 20:36:19,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b78b96d/38388bc019ea415aa8fac1065a36b585/FLAGc186d229a [2022-02-20 20:36:19,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4b78b96d/38388bc019ea415aa8fac1065a36b585 [2022-02-20 20:36:19,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:36:19,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:36:19,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:36:19,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:36:19,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:36:19,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:36:19" (1/1) ... [2022-02-20 20:36:19,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fdd9f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:19, skipping insertion in model container [2022-02-20 20:36:19,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:36:19" (1/1) ... [2022-02-20 20:36:19,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:36:19,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:36:20,419 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/ldv-races/race-1_1-join.i[76068,76081] [2022-02-20 20:36:20,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:36:20,459 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:36:20,511 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/ldv-races/race-1_1-join.i[76068,76081] [2022-02-20 20:36:20,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:36:20,595 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:36:20,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:20 WrapperNode [2022-02-20 20:36:20,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:36:20,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:36:20,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:36:20,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:36:20,604 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:36:20" (1/1) ... [2022-02-20 20:36:20,628 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:36:20" (1/1) ... [2022-02-20 20:36:20,660 INFO L137 Inliner]: procedures = 480, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2022-02-20 20:36:20,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:36:20,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:36:20,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:36:20,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:36:20,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:20" (1/1) ... [2022-02-20 20:36:20,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:20" (1/1) ... [2022-02-20 20:36:20,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:20" (1/1) ... [2022-02-20 20:36:20,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:20" (1/1) ... [2022-02-20 20:36:20,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:20" (1/1) ... [2022-02-20 20:36:20,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:20" (1/1) ... [2022-02-20 20:36:20,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:20" (1/1) ... [2022-02-20 20:36:20,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:36:20,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:36:20,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:36:20,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:36:20,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:20" (1/1) ... [2022-02-20 20:36:20,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:36:20,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:36:20,728 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:36:20,729 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:36:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:36:20,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:36:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:36:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:36:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 20:36:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:36:20,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:36:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:36:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-20 20:36:20,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-20 20:36:20,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:36:20,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:36:20,763 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:36:20,950 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:36:20,951 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:36:21,097 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:36:21,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:36:21,102 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:36:21,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:36:21 BoogieIcfgContainer [2022-02-20 20:36:21,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:36:21,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:36:21,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:36:21,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:36:21,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:36:19" (1/3) ... [2022-02-20 20:36:21,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590b7d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:36:21, skipping insertion in model container [2022-02-20 20:36:21,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:36:20" (2/3) ... [2022-02-20 20:36:21,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590b7d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:36:21, skipping insertion in model container [2022-02-20 20:36:21,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:36:21" (3/3) ... [2022-02-20 20:36:21,119 INFO L111 eAbstractionObserver]: Analyzing ICFG race-1_1-join.i [2022-02-20 20:36:21,122 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:36:21,122 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:36:21,122 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 20:36:21,122 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:36:21,163 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,163 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,164 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,165 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,166 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,167 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,167 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,167 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,167 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,167 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,167 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,168 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,168 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,168 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,168 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,168 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,171 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,171 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,171 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_ldv_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,171 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,171 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,172 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,172 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:36:21,176 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:36:21,210 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:36:21,215 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:36:21,215 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-20 20:36:21,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 113 transitions, 234 flow [2022-02-20 20:36:21,274 INFO L129 PetriNetUnfolder]: 5/127 cut-off events. [2022-02-20 20:36:21,274 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:36:21,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 5/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 212 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 73. Up to 3 conditions per place. [2022-02-20 20:36:21,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 113 transitions, 234 flow [2022-02-20 20:36:21,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 100 transitions, 206 flow [2022-02-20 20:36:21,290 INFO L129 PetriNetUnfolder]: 1/37 cut-off events. [2022-02-20 20:36:21,291 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:36:21,291 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:21,292 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:36:21,292 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 20:36:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:21,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1512384952, now seen corresponding path program 1 times [2022-02-20 20:36:21,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:21,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003876213] [2022-02-20 20:36:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:21,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:36:21,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {114#true} [245] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#true} [184] 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] {114#true} is VALID [2022-02-20 20:36:21,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {114#true} [252] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {114#true} [253] L-1-2-->L1691: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {114#true} [161] L1691-->L1691-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {114#true} [230] L1691-1-->L1691-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[] {114#true} is VALID [2022-02-20 20:36:21,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {114#true} [149] L1691-2-->L1691-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[] {114#true} is VALID [2022-02-20 20:36:21,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {114#true} [210] L1691-3-->L1691-4: Formula: (and (= (select |v_#valid_5| 2) 1) (= 16 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {114#true} [216] L1691-4-->L1694: Formula: (and (= |v_~#t1~0.offset_1| 0) (= |v_~#t1~0.base_1| 3)) InVars {} OutVars{~#t1~0.offset=|v_~#t1~0.offset_1|, ~#t1~0.base=|v_~#t1~0.base_1|} AuxVars[] AssignedVars[~#t1~0.base, ~#t1~0.offset] {114#true} is VALID [2022-02-20 20:36:21,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {114#true} [238] L1694-->L1694-1: Formula: (and (= (select |v_#valid_6| 3) 1) (= 4 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {114#true} [229] L1694-1-->L1694-2: Formula: (= (select (select |v_#memory_int_3| |v_~#t1~0.base_2|) |v_~#t1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {114#true} [232] L1694-2-->L1695: Formula: (and (= 4 |v_~#mutex~0.base_3|) (= |v_~#mutex~0.offset_3| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_3|, ~#mutex~0.offset=|v_~#mutex~0.offset_3|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {114#true} is VALID [2022-02-20 20:36:21,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {114#true} [235] L1695-->L1695-1: Formula: (and (= (select |v_#length_4| 4) 24) (= 1 (select |v_#valid_7| 4))) InVars {#length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {114#true} [147] L1695-1-->L1695-2: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_4|) |v_~#mutex~0.offset_4|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {114#true} [150] L1695-2-->L1695-3: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_5|) (+ |v_~#mutex~0.offset_5| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {114#true} [208] L1695-3-->L1695-4: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_6|) (+ |v_~#mutex~0.offset_6| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {114#true} [178] L1695-4-->L1695-5: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_7|) (+ |v_~#mutex~0.offset_7| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {114#true} [176] L1695-5-->L1695-6: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex~0.base_8|) (+ |v_~#mutex~0.offset_8| 16)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {114#true} [248] L1695-6-->L-1-3: Formula: (= v_~pdev~0_3 0) InVars {} OutVars{~pdev~0=v_~pdev~0_3} AuxVars[] AssignedVars[~pdev~0] {114#true} is VALID [2022-02-20 20:36:21,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {114#true} [254] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {114#true} [185] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {114#true} [163] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {114#true} is VALID [2022-02-20 20:36:21,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {114#true} [240] L-1-6-->L1725: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret37#1] {114#true} is VALID [2022-02-20 20:36:21,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {114#true} [190] L1725-->L1725-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {114#true} is VALID [2022-02-20 20:36:21,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {114#true} [165] L1725-1-->L1725-2: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#res#1] {114#true} is VALID [2022-02-20 20:36:21,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {114#true} [246] L1725-2-->L1705: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_1|, ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] {114#true} is VALID [2022-02-20 20:36:21,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {114#true} [193] L1705-->L1706: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex~0.base_9| (store (select |v_#pthreadsMutex_6| |v_~#mutex~0.base_9|) |v_~#mutex~0.offset_9| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_5|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex] {114#true} is VALID [2022-02-20 20:36:21,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {114#true} [236] L1706-->L1707: Formula: (= v_~pdev~0_4 1) InVars {} OutVars{~pdev~0=v_~pdev~0_4} AuxVars[] AssignedVars[~pdev~0] {116#(= ~pdev~0 1)} is VALID [2022-02-20 20:36:21,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {116#(= ~pdev~0 1)} [228] L1707-->L1707-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(= ~pdev~0 1)} is VALID [2022-02-20 20:36:21,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {116#(= ~pdev~0 1)} [186] L1707-1-->L1707-2: Formula: (= (ite (= v_~pdev~0_5 1) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_1|) InVars {~pdev~0=v_~pdev~0_5} OutVars{~pdev~0=v_~pdev~0_5, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_#in~expression#1] {117#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:21,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {117#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} [207] L1707-2-->L1693: Formula: true InVars {} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {117#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:21,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {117#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} [237] L1693-->L1693-1: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_3| |v_ULTIMATE.start_ldv_assert_#in~expression#1_2|) InVars {ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|} OutVars{ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {118#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))} is VALID [2022-02-20 20:36:21,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {118#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))} [249] L1693-1-->L1693-2: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_4| 0) InVars {ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_4|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_4|} AuxVars[] AssignedVars[] {115#false} is VALID [2022-02-20 20:36:21,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {115#false} [211] L1693-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#false} is VALID [2022-02-20 20:36:21,687 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:36:21,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:36:21,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003876213] [2022-02-20 20:36:21,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003876213] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:36:21,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:36:21,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:36:21,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964084568] [2022-02-20 20:36:21,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:36:21,699 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:36:21,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:36:21,704 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:36:21,737 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:36:21,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:36:21,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:36:21,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:36:21,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:36:21,759 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2022-02-20 20:36:21,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 100 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 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:36:21,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:36:21,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2022-02-20 20:36:21,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:36:21,867 INFO L129 PetriNetUnfolder]: 0/94 cut-off events. [2022-02-20 20:36:21,867 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-02-20 20:36:21,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 94 events. 0/94 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-02-20 20:36:21,868 INFO L132 encePairwiseOnDemand]: 102/113 looper letters, 11 selfloop transitions, 9 changer transitions 0/94 dead transitions. [2022-02-20 20:36:21,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 94 transitions, 234 flow [2022-02-20 20:36:21,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:36:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:36:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 596 transitions. [2022-02-20 20:36:21,896 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7534766118836915 [2022-02-20 20:36:21,897 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 596 transitions. [2022-02-20 20:36:21,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 596 transitions. [2022-02-20 20:36:21,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:36:21,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 596 transitions. [2022-02-20 20:36:21,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.14285714285714) internal successors, (596), 7 states have internal predecessors, (596), 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:36:21,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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:36:21,908 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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:36:21,910 INFO L186 Difference]: Start difference. First operand has 102 places, 100 transitions, 206 flow. Second operand 7 states and 596 transitions. [2022-02-20 20:36:21,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 94 transitions, 234 flow [2022-02-20 20:36:21,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 94 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:36:21,918 INFO L242 Difference]: Finished difference. Result has 102 places, 94 transitions, 208 flow [2022-02-20 20:36:21,920 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2022-02-20 20:36:21,924 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 0 predicate places. [2022-02-20 20:36:21,925 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 102 places, 94 transitions, 208 flow [2022-02-20 20:36:21,953 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 365 states, 360 states have (on average 1.761111111111111) internal successors, (634), 364 states have internal predecessors, (634), 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:36:21,955 INFO L78 Accepts]: Start accepts. Automaton has has 365 states, 360 states have (on average 1.761111111111111) internal successors, (634), 364 states have internal predecessors, (634), 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:36:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:36:21,955 INFO L470 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 208 flow [2022-02-20 20:36:21,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 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:36:21,956 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:21,956 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] [2022-02-20 20:36:21,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:36:21,956 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 20:36:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1771387403, now seen corresponding path program 1 times [2022-02-20 20:36:21,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:21,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263770903] [2022-02-20 20:36:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:36:22,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#true} [245] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} [184] 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] {492#true} is VALID [2022-02-20 20:36:22,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} [252] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {492#true} [253] L-1-2-->L1691: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {492#true} [161] L1691-->L1691-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#true} [230] L1691-1-->L1691-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[] {492#true} is VALID [2022-02-20 20:36:22,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {492#true} [149] L1691-2-->L1691-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[] {492#true} is VALID [2022-02-20 20:36:22,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#true} [210] L1691-3-->L1691-4: Formula: (and (= (select |v_#valid_5| 2) 1) (= 16 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {492#true} [216] L1691-4-->L1694: Formula: (and (= |v_~#t1~0.offset_1| 0) (= |v_~#t1~0.base_1| 3)) InVars {} OutVars{~#t1~0.offset=|v_~#t1~0.offset_1|, ~#t1~0.base=|v_~#t1~0.base_1|} AuxVars[] AssignedVars[~#t1~0.base, ~#t1~0.offset] {492#true} is VALID [2022-02-20 20:36:22,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#true} [238] L1694-->L1694-1: Formula: (and (= (select |v_#valid_6| 3) 1) (= 4 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {492#true} [229] L1694-1-->L1694-2: Formula: (= (select (select |v_#memory_int_3| |v_~#t1~0.base_2|) |v_~#t1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {492#true} [232] L1694-2-->L1695: Formula: (and (= 4 |v_~#mutex~0.base_3|) (= |v_~#mutex~0.offset_3| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_3|, ~#mutex~0.offset=|v_~#mutex~0.offset_3|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {492#true} is VALID [2022-02-20 20:36:22,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {492#true} [235] L1695-->L1695-1: Formula: (and (= (select |v_#length_4| 4) 24) (= 1 (select |v_#valid_7| 4))) InVars {#length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {492#true} [147] L1695-1-->L1695-2: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_4|) |v_~#mutex~0.offset_4|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#true} [150] L1695-2-->L1695-3: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_5|) (+ |v_~#mutex~0.offset_5| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {492#true} [208] L1695-3-->L1695-4: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_6|) (+ |v_~#mutex~0.offset_6| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {492#true} [178] L1695-4-->L1695-5: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_7|) (+ |v_~#mutex~0.offset_7| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {492#true} [176] L1695-5-->L1695-6: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex~0.base_8|) (+ |v_~#mutex~0.offset_8| 16)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {492#true} [248] L1695-6-->L-1-3: Formula: (= v_~pdev~0_3 0) InVars {} OutVars{~pdev~0=v_~pdev~0_3} AuxVars[] AssignedVars[~pdev~0] {492#true} is VALID [2022-02-20 20:36:22,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {492#true} [254] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {492#true} [185] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {492#true} [163] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {492#true} is VALID [2022-02-20 20:36:22,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {492#true} [240] L-1-6-->L1725: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret37#1] {492#true} is VALID [2022-02-20 20:36:22,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {492#true} [190] L1725-->L1725-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {492#true} [165] L1725-1-->L1725-2: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#res#1] {492#true} is VALID [2022-02-20 20:36:22,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {492#true} [246] L1725-2-->L1705: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_1|, ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] {492#true} is VALID [2022-02-20 20:36:22,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {492#true} [193] L1705-->L1706: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex~0.base_9| (store (select |v_#pthreadsMutex_6| |v_~#mutex~0.base_9|) |v_~#mutex~0.offset_9| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_5|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex] {492#true} is VALID [2022-02-20 20:36:22,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {492#true} [236] L1706-->L1707: Formula: (= v_~pdev~0_4 1) InVars {} OutVars{~pdev~0=v_~pdev~0_4} AuxVars[] AssignedVars[~pdev~0] {492#true} is VALID [2022-02-20 20:36:22,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {492#true} [228] L1707-->L1707-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {492#true} [186] L1707-1-->L1707-2: Formula: (= (ite (= v_~pdev~0_5 1) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_1|) InVars {~pdev~0=v_~pdev~0_5} OutVars{~pdev~0=v_~pdev~0_5, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_#in~expression#1] {492#true} is VALID [2022-02-20 20:36:22,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {492#true} [207] L1707-2-->L1693: Formula: true InVars {} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {492#true} is VALID [2022-02-20 20:36:22,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {492#true} [237] L1693-->L1693-1: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_3| |v_ULTIMATE.start_ldv_assert_#in~expression#1_2|) InVars {ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|} OutVars{ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {492#true} is VALID [2022-02-20 20:36:22,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {492#true} [250] L1693-1-->L1693-5: Formula: (not (= |v_ULTIMATE.start_ldv_assert_~expression#1_5| 0)) InVars {ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_5|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_5|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {492#true} [158] L1693-5-->L1708: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,091 INFO L290 TraceCheckUtils]: 34: Hoare triple {492#true} [166] L1708-->L1708-1: Formula: (and (<= |v_ULTIMATE.start_module_init_#t~nondet32#1_2| 2147483647) (<= 0 (+ |v_ULTIMATE.start_module_init_#t~nondet32#1_2| 2147483648))) InVars {ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_2|} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_2|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {492#true} [204] L1708-1-->L1708-3: Formula: (= |v_ULTIMATE.start_module_init_#t~nondet32#1_5| 0) InVars {ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_5|} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_5|} AuxVars[] AssignedVars[] {492#true} is VALID [2022-02-20 20:36:22,091 INFO L290 TraceCheckUtils]: 36: Hoare triple {492#true} [148] L1708-3-->L1712: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1] {492#true} is VALID [2022-02-20 20:36:22,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {492#true} [154] L1712-->L1713: Formula: (= 3 v_~pdev~0_6) InVars {} OutVars{~pdev~0=v_~pdev~0_6} AuxVars[] AssignedVars[~pdev~0] {494#(= ~pdev~0 3)} is VALID [2022-02-20 20:36:22,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {494#(= ~pdev~0 3)} [187] L1713-->L1713-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {494#(= ~pdev~0 3)} is VALID [2022-02-20 20:36:22,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {494#(= ~pdev~0 3)} [156] L1713-1-->L1713-2: Formula: (= (ite (= 3 v_~pdev~0_7) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_3|) InVars {~pdev~0=v_~pdev~0_7} OutVars{~pdev~0=v_~pdev~0_7, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_#in~expression#1] {495#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:22,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {495#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} [247] L1713-2-->L1693-6: Formula: true InVars {} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {495#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:22,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {495#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} [151] L1693-6-->L1693-7: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_7| |v_ULTIMATE.start_ldv_assert_#in~expression#1_4|) InVars {ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_4|} OutVars{ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_4|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {496#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))} is VALID [2022-02-20 20:36:22,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {496#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))} [159] L1693-7-->L1693-8: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_8| 0) InVars {ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_8|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_8|} AuxVars[] AssignedVars[] {493#false} is VALID [2022-02-20 20:36:22,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {493#false} [213] L1693-8-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {493#false} is VALID [2022-02-20 20:36:22,097 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:36:22,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:36:22,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263770903] [2022-02-20 20:36:22,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263770903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:36:22,098 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:36:22,098 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:36:22,098 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524395344] [2022-02-20 20:36:22,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:36:22,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 44 [2022-02-20 20:36:22,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:36:22,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:36:22,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:36:22,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:36:22,129 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:36:22,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:36:22,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:36:22,135 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2022-02-20 20:36:22,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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:36:22,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:36:22,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2022-02-20 20:36:22,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:36:22,214 INFO L129 PetriNetUnfolder]: 0/92 cut-off events. [2022-02-20 20:36:22,215 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:36:22,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 92 events. 0/92 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-02-20 20:36:22,217 INFO L132 encePairwiseOnDemand]: 106/113 looper letters, 13 selfloop transitions, 2 changer transitions 7/92 dead transitions. [2022-02-20 20:36:22,217 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 92 transitions, 242 flow [2022-02-20 20:36:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:36:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:36:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 512 transitions. [2022-02-20 20:36:22,225 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7551622418879056 [2022-02-20 20:36:22,225 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 512 transitions. [2022-02-20 20:36:22,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 512 transitions. [2022-02-20 20:36:22,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:36:22,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 512 transitions. [2022-02-20 20:36:22,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.33333333333333) internal successors, (512), 6 states have internal predecessors, (512), 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:36:22,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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:36:22,229 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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:36:22,229 INFO L186 Difference]: Start difference. First operand has 102 places, 94 transitions, 208 flow. Second operand 6 states and 512 transitions. [2022-02-20 20:36:22,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 92 transitions, 242 flow [2022-02-20 20:36:22,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 92 transitions, 224 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-02-20 20:36:22,233 INFO L242 Difference]: Finished difference. Result has 99 places, 85 transitions, 176 flow [2022-02-20 20:36:22,233 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2022-02-20 20:36:22,234 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, -3 predicate places. [2022-02-20 20:36:22,234 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 85 transitions, 176 flow [2022-02-20 20:36:22,239 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 356 states, 352 states have (on average 1.7755681818181819) internal successors, (625), 355 states have internal predecessors, (625), 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:36:22,240 INFO L78 Accepts]: Start accepts. Automaton has has 356 states, 352 states have (on average 1.7755681818181819) internal successors, (625), 355 states have internal predecessors, (625), 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 44 [2022-02-20 20:36:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:36:22,241 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 176 flow [2022-02-20 20:36:22,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 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:36:22,241 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:22,242 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] [2022-02-20 20:36:22,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:36:22,242 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 20:36:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash 659390104, now seen corresponding path program 1 times [2022-02-20 20:36:22,243 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:22,243 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985557266] [2022-02-20 20:36:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:22,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:36:22,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {861#true} [245] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {861#true} [184] 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] {861#true} is VALID [2022-02-20 20:36:22,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {861#true} [252] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,331 INFO L290 TraceCheckUtils]: 3: Hoare triple {861#true} [253] L-1-2-->L1691: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,332 INFO L290 TraceCheckUtils]: 4: Hoare triple {861#true} [161] L1691-->L1691-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {861#true} [230] L1691-1-->L1691-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[] {861#true} is VALID [2022-02-20 20:36:22,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {861#true} [149] L1691-2-->L1691-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[] {861#true} is VALID [2022-02-20 20:36:22,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {861#true} [210] L1691-3-->L1691-4: Formula: (and (= (select |v_#valid_5| 2) 1) (= 16 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {861#true} [216] L1691-4-->L1694: Formula: (and (= |v_~#t1~0.offset_1| 0) (= |v_~#t1~0.base_1| 3)) InVars {} OutVars{~#t1~0.offset=|v_~#t1~0.offset_1|, ~#t1~0.base=|v_~#t1~0.base_1|} AuxVars[] AssignedVars[~#t1~0.base, ~#t1~0.offset] {861#true} is VALID [2022-02-20 20:36:22,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {861#true} [238] L1694-->L1694-1: Formula: (and (= (select |v_#valid_6| 3) 1) (= 4 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {861#true} [229] L1694-1-->L1694-2: Formula: (= (select (select |v_#memory_int_3| |v_~#t1~0.base_2|) |v_~#t1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {861#true} [232] L1694-2-->L1695: Formula: (and (= 4 |v_~#mutex~0.base_3|) (= |v_~#mutex~0.offset_3| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_3|, ~#mutex~0.offset=|v_~#mutex~0.offset_3|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {861#true} is VALID [2022-02-20 20:36:22,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {861#true} [235] L1695-->L1695-1: Formula: (and (= (select |v_#length_4| 4) 24) (= 1 (select |v_#valid_7| 4))) InVars {#length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {861#true} [147] L1695-1-->L1695-2: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_4|) |v_~#mutex~0.offset_4|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {861#true} [150] L1695-2-->L1695-3: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_5|) (+ |v_~#mutex~0.offset_5| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {861#true} [208] L1695-3-->L1695-4: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_6|) (+ |v_~#mutex~0.offset_6| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {861#true} [178] L1695-4-->L1695-5: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_7|) (+ |v_~#mutex~0.offset_7| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {861#true} [176] L1695-5-->L1695-6: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex~0.base_8|) (+ |v_~#mutex~0.offset_8| 16)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {861#true} [248] L1695-6-->L-1-3: Formula: (= v_~pdev~0_3 0) InVars {} OutVars{~pdev~0=v_~pdev~0_3} AuxVars[] AssignedVars[~pdev~0] {861#true} is VALID [2022-02-20 20:36:22,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {861#true} [254] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {861#true} [185] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {861#true} [163] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {861#true} is VALID [2022-02-20 20:36:22,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {861#true} [240] L-1-6-->L1725: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret37#1] {861#true} is VALID [2022-02-20 20:36:22,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {861#true} [190] L1725-->L1725-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {861#true} [165] L1725-1-->L1725-2: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#res#1] {861#true} is VALID [2022-02-20 20:36:22,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {861#true} [246] L1725-2-->L1705: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_1|, ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] {861#true} is VALID [2022-02-20 20:36:22,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {861#true} [193] L1705-->L1706: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex~0.base_9| (store (select |v_#pthreadsMutex_6| |v_~#mutex~0.base_9|) |v_~#mutex~0.offset_9| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_5|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex] {861#true} is VALID [2022-02-20 20:36:22,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {861#true} [236] L1706-->L1707: Formula: (= v_~pdev~0_4 1) InVars {} OutVars{~pdev~0=v_~pdev~0_4} AuxVars[] AssignedVars[~pdev~0] {861#true} is VALID [2022-02-20 20:36:22,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {861#true} [228] L1707-->L1707-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {861#true} [186] L1707-1-->L1707-2: Formula: (= (ite (= v_~pdev~0_5 1) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_1|) InVars {~pdev~0=v_~pdev~0_5} OutVars{~pdev~0=v_~pdev~0_5, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_#in~expression#1] {861#true} is VALID [2022-02-20 20:36:22,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {861#true} [207] L1707-2-->L1693: Formula: true InVars {} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {861#true} is VALID [2022-02-20 20:36:22,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {861#true} [237] L1693-->L1693-1: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_3| |v_ULTIMATE.start_ldv_assert_#in~expression#1_2|) InVars {ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|} OutVars{ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {861#true} is VALID [2022-02-20 20:36:22,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {861#true} [250] L1693-1-->L1693-5: Formula: (not (= |v_ULTIMATE.start_ldv_assert_~expression#1_5| 0)) InVars {ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_5|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_5|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {861#true} [158] L1693-5-->L1708: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {861#true} [166] L1708-->L1708-1: Formula: (and (<= |v_ULTIMATE.start_module_init_#t~nondet32#1_2| 2147483647) (<= 0 (+ |v_ULTIMATE.start_module_init_#t~nondet32#1_2| 2147483648))) InVars {ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_2|} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_2|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {861#true} [203] L1708-1-->L1708-2: Formula: (not (= |v_ULTIMATE.start_module_init_#t~nondet32#1_3| 0)) InVars {ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_3|} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_3|} AuxVars[] AssignedVars[] {861#true} is VALID [2022-02-20 20:36:22,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {861#true} [167] L1708-2-->L1709: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1] {861#true} is VALID [2022-02-20 20:36:22,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {861#true} [222] L1709-->L1709-1: Formula: (= |v_ULTIMATE.start_module_init_#t~pre33#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~pre33#1] {861#true} is VALID [2022-02-20 20:36:22,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {861#true} [257] L1709-1-->L1709-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {861#true} is VALID [2022-02-20 20:36:22,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {861#true} [182] L1709-2-->L1709-3: Formula: (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| |v_~#t1~0.base_3| (store (select |v_#memory_$Pointer$.offset_2| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3| (select (select |v_#memory_$Pointer$.offset_1| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3|)))) (= (store |v_#memory_int_10| |v_~#t1~0.base_3| (store (select |v_#memory_int_10| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3| |v_ULTIMATE.start_module_init_#t~pre33#1_3|)) |v_#memory_int_9|) (= (store |v_#memory_$Pointer$.base_2| |v_~#t1~0.base_3| (store (select |v_#memory_$Pointer$.base_2| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3| (select (select |v_#memory_$Pointer$.base_1| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3|))) |v_#memory_$Pointer$.base_1|)) InVars {~#t1~0.base=|v_~#t1~0.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_3|, #memory_int=|v_#memory_int_10|, ~#t1~0.offset=|v_~#t1~0.offset_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|} OutVars{~#t1~0.base=|v_~#t1~0.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_3|, #memory_int=|v_#memory_int_9|, ~#t1~0.offset=|v_~#t1~0.offset_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] {861#true} is VALID [2022-02-20 20:36:22,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {861#true} [277] L1709-3-->thread1ENTRY: Formula: (and (= 0 |v_thread1Thread1of1ForFork0_#in~arg#1.offset_4|) (= |v_thread1Thread1of1ForFork0_#in~arg#1.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_module_init_#t~pre33#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_6|} OutVars{thread1Thread1of1ForFork0_ldv_assert_~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_10|, thread1Thread1of1ForFork0_#in~arg#1.offset=|v_thread1Thread1of1ForFork0_#in~arg#1.offset_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_ldv_assert_#in~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_6|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_6|, thread1Thread1of1ForFork0_~arg#1.base=|v_thread1Thread1of1ForFork0_~arg#1.base_4|, thread1Thread1of1ForFork0_~arg#1.offset=|v_thread1Thread1of1ForFork0_~arg#1.offset_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#in~arg#1.base=|v_thread1Thread1of1ForFork0_#in~arg#1.base_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~nondet31#1=|v_thread1Thread1of1ForFork0_#t~nondet31#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_ldv_assert_~expression#1, thread1Thread1of1ForFork0_#in~arg#1.offset, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_ldv_assert_#in~expression#1, thread1Thread1of1ForFork0_~arg#1.base, thread1Thread1of1ForFork0_~arg#1.offset, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#in~arg#1.base, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet31#1, thread1Thread1of1ForFork0_#res#1.base] {861#true} is VALID [2022-02-20 20:36:22,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {861#true} [259] thread1ENTRY-->L1698: Formula: (and (= |v_thread1Thread1of1ForFork0_~arg#1.offset_1| |v_thread1Thread1of1ForFork0_#in~arg#1.offset_1|) (= |v_thread1Thread1of1ForFork0_#in~arg#1.base_1| |v_thread1Thread1of1ForFork0_~arg#1.base_1|)) InVars {thread1Thread1of1ForFork0_#in~arg#1.base=|v_thread1Thread1of1ForFork0_#in~arg#1.base_1|, thread1Thread1of1ForFork0_#in~arg#1.offset=|v_thread1Thread1of1ForFork0_#in~arg#1.offset_1|} OutVars{thread1Thread1of1ForFork0_#in~arg#1.base=|v_thread1Thread1of1ForFork0_#in~arg#1.base_1|, thread1Thread1of1ForFork0_#in~arg#1.offset=|v_thread1Thread1of1ForFork0_#in~arg#1.offset_1|, thread1Thread1of1ForFork0_~arg#1.base=|v_thread1Thread1of1ForFork0_~arg#1.base_1|, thread1Thread1of1ForFork0_~arg#1.offset=|v_thread1Thread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~arg#1.base, thread1Thread1of1ForFork0_~arg#1.offset] {861#true} is VALID [2022-02-20 20:36:22,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {861#true} [260] L1698-->L1698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#mutex~0.base_1|))) (and (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#mutex~0.base_1| (store .cse0 |v_~#mutex~0.offset_1| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet31#1_1| 0) (= (select .cse0 |v_~#mutex~0.offset_1|) 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_1|, #pthreadsMutex=|v_#pthreadsMutex_2|, ~#mutex~0.base=|v_~#mutex~0.base_1|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_1|, #pthreadsMutex=|v_#pthreadsMutex_1|, thread1Thread1of1ForFork0_#t~nondet31#1=|v_thread1Thread1of1ForFork0_#t~nondet31#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_1|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#t~nondet31#1] {861#true} is VALID [2022-02-20 20:36:22,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {861#true} [261] L1698-1-->L1699: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet31#1=|v_thread1Thread1of1ForFork0_#t~nondet31#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet31#1] {861#true} is VALID [2022-02-20 20:36:22,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {861#true} [262] L1699-->L1700: Formula: (= 6 v_~pdev~0_1) InVars {} OutVars{~pdev~0=v_~pdev~0_1} AuxVars[] AssignedVars[~pdev~0] {863#(= ~pdev~0 6)} is VALID [2022-02-20 20:36:22,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {863#(= ~pdev~0 6)} [263] L1700-->L1700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {863#(= ~pdev~0 6)} is VALID [2022-02-20 20:36:22,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {863#(= ~pdev~0 6)} [264] L1700-1-->L1700-2: Formula: (= |v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_1| (ite (= 6 v_~pdev~0_2) 1 0)) InVars {~pdev~0=v_~pdev~0_2} OutVars{~pdev~0=v_~pdev~0_2, thread1Thread1of1ForFork0_ldv_assert_#in~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_ldv_assert_#in~expression#1] {864#(not (= |thread1Thread1of1ForFork0_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:22,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {864#(not (= |thread1Thread1of1ForFork0_ldv_assert_#in~expression#1| 0))} [265] L1700-2-->L1693: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_ldv_assert_~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_ldv_assert_~expression#1] {864#(not (= |thread1Thread1of1ForFork0_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:22,341 INFO L290 TraceCheckUtils]: 48: Hoare triple {864#(not (= |thread1Thread1of1ForFork0_ldv_assert_#in~expression#1| 0))} [266] L1693-->L1693-1: Formula: (= |v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_3| |v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_3|) InVars {thread1Thread1of1ForFork0_ldv_assert_#in~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_3|} OutVars{thread1Thread1of1ForFork0_ldv_assert_~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_3|, thread1Thread1of1ForFork0_ldv_assert_#in~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_ldv_assert_~expression#1] {865#(not (= |thread1Thread1of1ForFork0_ldv_assert_~expression#1| 0))} is VALID [2022-02-20 20:36:22,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {865#(not (= |thread1Thread1of1ForFork0_ldv_assert_~expression#1| 0))} [267] L1693-1-->L1693-2: Formula: (= |v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_5| 0) InVars {thread1Thread1of1ForFork0_ldv_assert_~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_5|} OutVars{thread1Thread1of1ForFork0_ldv_assert_~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_5|} AuxVars[] AssignedVars[] {862#false} is VALID [2022-02-20 20:36:22,342 INFO L290 TraceCheckUtils]: 50: Hoare triple {862#false} [269] L1693-2-->thread1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {862#false} is VALID [2022-02-20 20:36:22,342 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:36:22,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:36:22,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985557266] [2022-02-20 20:36:22,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985557266] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:36:22,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:36:22,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:36:22,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759831132] [2022-02-20 20:36:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:36:22,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 51 [2022-02-20 20:36:22,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:36:22,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:36:22,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:36:22,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:36:22,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:36:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:36:22,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:36:22,376 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 113 [2022-02-20 20:36:22,377 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 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:36:22,377 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:36:22,377 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 113 [2022-02-20 20:36:22,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:36:22,422 INFO L129 PetriNetUnfolder]: 0/83 cut-off events. [2022-02-20 20:36:22,422 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:36:22,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 83 events. 0/83 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-02-20 20:36:22,423 INFO L132 encePairwiseOnDemand]: 108/113 looper letters, 8 selfloop transitions, 4 changer transitions 6/83 dead transitions. [2022-02-20 20:36:22,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 83 transitions, 196 flow [2022-02-20 20:36:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:36:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:36:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 553 transitions. [2022-02-20 20:36:22,428 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8156342182890856 [2022-02-20 20:36:22,428 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 553 transitions. [2022-02-20 20:36:22,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 553 transitions. [2022-02-20 20:36:22,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:36:22,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 553 transitions. [2022-02-20 20:36:22,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 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:36:22,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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:36:22,431 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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:36:22,431 INFO L186 Difference]: Start difference. First operand has 99 places, 85 transitions, 176 flow. Second operand 6 states and 553 transitions. [2022-02-20 20:36:22,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 83 transitions, 196 flow [2022-02-20 20:36:22,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 83 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:36:22,433 INFO L242 Difference]: Finished difference. Result has 90 places, 77 transitions, 164 flow [2022-02-20 20:36:22,433 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2022-02-20 20:36:22,434 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, -12 predicate places. [2022-02-20 20:36:22,434 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 77 transitions, 164 flow [2022-02-20 20:36:22,436 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 234 states, 233 states have (on average 1.6695278969957081) internal successors, (389), 233 states have internal predecessors, (389), 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:36:22,436 INFO L78 Accepts]: Start accepts. Automaton has has 234 states, 233 states have (on average 1.6695278969957081) internal successors, (389), 233 states have internal predecessors, (389), 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 51 [2022-02-20 20:36:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:36:22,437 INFO L470 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 164 flow [2022-02-20 20:36:22,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 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:36:22,437 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:36:22,437 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:22,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:36:22,438 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 20:36:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:36:22,438 INFO L85 PathProgramCache]: Analyzing trace with hash -534196150, now seen corresponding path program 1 times [2022-02-20 20:36:22,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:36:22,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807186362] [2022-02-20 20:36:22,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:36:22,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:36:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:36:22,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {1108#true} [245] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#true} [184] 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] {1108#true} is VALID [2022-02-20 20:36:22,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {1108#true} [252] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {1108#true} [253] L-1-2-->L1691: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,533 INFO L290 TraceCheckUtils]: 4: Hoare triple {1108#true} [161] L1691-->L1691-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#true} [230] L1691-1-->L1691-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[] {1108#true} is VALID [2022-02-20 20:36:22,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {1108#true} [149] L1691-2-->L1691-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[] {1108#true} is VALID [2022-02-20 20:36:22,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {1108#true} [210] L1691-3-->L1691-4: Formula: (and (= (select |v_#valid_5| 2) 1) (= 16 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {1108#true} [216] L1691-4-->L1694: Formula: (and (= |v_~#t1~0.offset_1| 0) (= |v_~#t1~0.base_1| 3)) InVars {} OutVars{~#t1~0.offset=|v_~#t1~0.offset_1|, ~#t1~0.base=|v_~#t1~0.base_1|} AuxVars[] AssignedVars[~#t1~0.base, ~#t1~0.offset] {1108#true} is VALID [2022-02-20 20:36:22,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {1108#true} [238] L1694-->L1694-1: Formula: (and (= (select |v_#valid_6| 3) 1) (= 4 (select |v_#length_3| 3))) InVars {#length=|v_#length_3|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {1108#true} [229] L1694-1-->L1694-2: Formula: (= (select (select |v_#memory_int_3| |v_~#t1~0.base_2|) |v_~#t1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#t1~0.offset=|v_~#t1~0.offset_2|, ~#t1~0.base=|v_~#t1~0.base_2|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {1108#true} [232] L1694-2-->L1695: Formula: (and (= 4 |v_~#mutex~0.base_3|) (= |v_~#mutex~0.offset_3| 0)) InVars {} OutVars{~#mutex~0.base=|v_~#mutex~0.base_3|, ~#mutex~0.offset=|v_~#mutex~0.offset_3|} AuxVars[] AssignedVars[~#mutex~0.base, ~#mutex~0.offset] {1108#true} is VALID [2022-02-20 20:36:22,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {1108#true} [235] L1695-->L1695-1: Formula: (and (= (select |v_#length_4| 4) 24) (= 1 (select |v_#valid_7| 4))) InVars {#length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {1108#true} [147] L1695-1-->L1695-2: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex~0.base_4|) |v_~#mutex~0.offset_4|) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_4|, #memory_int=|v_#memory_int_4|, ~#mutex~0.base=|v_~#mutex~0.base_4|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {1108#true} [150] L1695-2-->L1695-3: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex~0.base_5|) (+ |v_~#mutex~0.offset_5| 4)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_5|, #memory_int=|v_#memory_int_5|, ~#mutex~0.base=|v_~#mutex~0.base_5|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {1108#true} [208] L1695-3-->L1695-4: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex~0.base_6|) (+ |v_~#mutex~0.offset_6| 8)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_6|, #memory_int=|v_#memory_int_6|, ~#mutex~0.base=|v_~#mutex~0.base_6|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {1108#true} [178] L1695-4-->L1695-5: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex~0.base_7|) (+ |v_~#mutex~0.offset_7| 12)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_7|, #memory_int=|v_#memory_int_7|, ~#mutex~0.base=|v_~#mutex~0.base_7|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {1108#true} [176] L1695-5-->L1695-6: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex~0.base_8|) (+ |v_~#mutex~0.offset_8| 16)) 0) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_8|, #memory_int=|v_#memory_int_8|, ~#mutex~0.base=|v_~#mutex~0.base_8|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {1108#true} [248] L1695-6-->L-1-3: Formula: (= v_~pdev~0_3 0) InVars {} OutVars{~pdev~0=v_~pdev~0_3} AuxVars[] AssignedVars[~pdev~0] {1108#true} is VALID [2022-02-20 20:36:22,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {1108#true} [254] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {1108#true} [185] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {1108#true} [163] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {1108#true} is VALID [2022-02-20 20:36:22,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {1108#true} [240] L-1-6-->L1725: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret37#1] {1108#true} is VALID [2022-02-20 20:36:22,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {1108#true} [190] L1725-->L1725-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {1108#true} [165] L1725-1-->L1725-2: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#res#1] {1108#true} is VALID [2022-02-20 20:36:22,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {1108#true} [246] L1725-2-->L1705: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_1|, ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1, ULTIMATE.start_module_init_#t~pre33#1, ULTIMATE.start_module_init_#t~nondet34#1] {1108#true} is VALID [2022-02-20 20:36:22,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {1108#true} [193] L1705-->L1706: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex~0.base_9| (store (select |v_#pthreadsMutex_6| |v_~#mutex~0.base_9|) |v_~#mutex~0.offset_9| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex~0.base=|v_~#mutex~0.base_9|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_9|, #pthreadsMutex=|v_#pthreadsMutex_5|, ~#mutex~0.base=|v_~#mutex~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex] {1108#true} is VALID [2022-02-20 20:36:22,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {1108#true} [236] L1706-->L1707: Formula: (= v_~pdev~0_4 1) InVars {} OutVars{~pdev~0=v_~pdev~0_4} AuxVars[] AssignedVars[~pdev~0] {1108#true} is VALID [2022-02-20 20:36:22,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {1108#true} [228] L1707-->L1707-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {1108#true} [186] L1707-1-->L1707-2: Formula: (= (ite (= v_~pdev~0_5 1) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_1|) InVars {~pdev~0=v_~pdev~0_5} OutVars{~pdev~0=v_~pdev~0_5, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_#in~expression#1] {1108#true} is VALID [2022-02-20 20:36:22,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {1108#true} [207] L1707-2-->L1693: Formula: true InVars {} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {1108#true} is VALID [2022-02-20 20:36:22,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {1108#true} [237] L1693-->L1693-1: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_3| |v_ULTIMATE.start_ldv_assert_#in~expression#1_2|) InVars {ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|} OutVars{ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_2|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {1108#true} is VALID [2022-02-20 20:36:22,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {1108#true} [250] L1693-1-->L1693-5: Formula: (not (= |v_ULTIMATE.start_ldv_assert_~expression#1_5| 0)) InVars {ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_5|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_5|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {1108#true} [158] L1693-5-->L1708: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {1108#true} [166] L1708-->L1708-1: Formula: (and (<= |v_ULTIMATE.start_module_init_#t~nondet32#1_2| 2147483647) (<= 0 (+ |v_ULTIMATE.start_module_init_#t~nondet32#1_2| 2147483648))) InVars {ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_2|} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_2|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {1108#true} [203] L1708-1-->L1708-2: Formula: (not (= |v_ULTIMATE.start_module_init_#t~nondet32#1_3| 0)) InVars {ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_3|} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_3|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {1108#true} [167] L1708-2-->L1709: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet32#1=|v_ULTIMATE.start_module_init_#t~nondet32#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet32#1] {1108#true} is VALID [2022-02-20 20:36:22,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {1108#true} [222] L1709-->L1709-1: Formula: (= |v_ULTIMATE.start_module_init_#t~pre33#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~pre33#1] {1108#true} is VALID [2022-02-20 20:36:22,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {1108#true} [257] L1709-1-->L1709-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {1108#true} is VALID [2022-02-20 20:36:22,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {1108#true} [182] L1709-2-->L1709-3: Formula: (and (= |v_#memory_$Pointer$.offset_1| (store |v_#memory_$Pointer$.offset_2| |v_~#t1~0.base_3| (store (select |v_#memory_$Pointer$.offset_2| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3| (select (select |v_#memory_$Pointer$.offset_1| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3|)))) (= (store |v_#memory_int_10| |v_~#t1~0.base_3| (store (select |v_#memory_int_10| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3| |v_ULTIMATE.start_module_init_#t~pre33#1_3|)) |v_#memory_int_9|) (= (store |v_#memory_$Pointer$.base_2| |v_~#t1~0.base_3| (store (select |v_#memory_$Pointer$.base_2| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3| (select (select |v_#memory_$Pointer$.base_1| |v_~#t1~0.base_3|) |v_~#t1~0.offset_3|))) |v_#memory_$Pointer$.base_1|)) InVars {~#t1~0.base=|v_~#t1~0.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_2|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_3|, #memory_int=|v_#memory_int_10|, ~#t1~0.offset=|v_~#t1~0.offset_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_2|} OutVars{~#t1~0.base=|v_~#t1~0.base_3|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_1|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_3|, #memory_int=|v_#memory_int_9|, ~#t1~0.offset=|v_~#t1~0.offset_3|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_1|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] {1108#true} is VALID [2022-02-20 20:36:22,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {1108#true} [277] L1709-3-->thread1ENTRY: Formula: (and (= 0 |v_thread1Thread1of1ForFork0_#in~arg#1.offset_4|) (= |v_thread1Thread1of1ForFork0_#in~arg#1.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_module_init_#t~pre33#1_6| v_thread1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_6|} OutVars{thread1Thread1of1ForFork0_ldv_assert_~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_10|, thread1Thread1of1ForFork0_#in~arg#1.offset=|v_thread1Thread1of1ForFork0_#in~arg#1.offset_4|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_ldv_assert_#in~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_6|, ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_6|, thread1Thread1of1ForFork0_~arg#1.base=|v_thread1Thread1of1ForFork0_~arg#1.base_4|, thread1Thread1of1ForFork0_~arg#1.offset=|v_thread1Thread1of1ForFork0_~arg#1.offset_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#in~arg#1.base=|v_thread1Thread1of1ForFork0_#in~arg#1.base_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~nondet31#1=|v_thread1Thread1of1ForFork0_#t~nondet31#1_6|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_ldv_assert_~expression#1, thread1Thread1of1ForFork0_#in~arg#1.offset, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_ldv_assert_#in~expression#1, thread1Thread1of1ForFork0_~arg#1.base, thread1Thread1of1ForFork0_~arg#1.offset, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#in~arg#1.base, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_#t~nondet31#1, thread1Thread1of1ForFork0_#res#1.base] {1108#true} is VALID [2022-02-20 20:36:22,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {1108#true} [206] L1709-4-->L1709-5: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~pre33#1=|v_ULTIMATE.start_module_init_#t~pre33#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~pre33#1] {1108#true} is VALID [2022-02-20 20:36:22,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {1108#true} [171] L1709-5-->L1710: Formula: true InVars {} OutVars{ULTIMATE.start_module_init_#t~nondet34#1=|v_ULTIMATE.start_module_init_#t~nondet34#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#t~nondet34#1] {1108#true} is VALID [2022-02-20 20:36:22,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {1108#true} [223] L1710-->L1715-1: Formula: (= |v_ULTIMATE.start_module_init_#res#1_2| 0) InVars {} OutVars{ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_module_init_#res#1] {1108#true} is VALID [2022-02-20 20:36:22,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {1108#true} [220] L1715-1-->L1725-3: Formula: (= |v_ULTIMATE.start_module_init_#res#1_4| |v_ULTIMATE.start_main_#t~ret37#1_2|) InVars {ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_4|} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_2|, ULTIMATE.start_module_init_#res#1=|v_ULTIMATE.start_module_init_#res#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret37#1] {1108#true} is VALID [2022-02-20 20:36:22,540 INFO L290 TraceCheckUtils]: 45: Hoare triple {1108#true} [189] L1725-3-->L1725-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {1108#true} [153] L1725-4-->L1725-5: Formula: (and (<= 0 (+ 2147483648 |v_ULTIMATE.start_main_#t~ret37#1_3|)) (<= |v_ULTIMATE.start_main_#t~ret37#1_3| 2147483647)) InVars {ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_3|} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_3|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {1108#true} [256] L1725-5-->L1725-8: Formula: (= 0 |v_ULTIMATE.start_main_#t~ret37#1_6|) InVars {ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_6|} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_6|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,540 INFO L290 TraceCheckUtils]: 48: Hoare triple {1108#true} [175] L1725-8-->L1726: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret37#1=|v_ULTIMATE.start_main_#t~ret37#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret37#1] {1108#true} is VALID [2022-02-20 20:36:22,541 INFO L290 TraceCheckUtils]: 49: Hoare triple {1108#true} [224] L1726-->L1726-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,541 INFO L290 TraceCheckUtils]: 50: Hoare triple {1108#true} [179] L1726-1-->L1718: Formula: true InVars {} OutVars{ULTIMATE.start_module_exit_#t~nondet36#1.offset=|v_ULTIMATE.start_module_exit_#t~nondet36#1.offset_1|, ULTIMATE.start_module_exit_~#status~0#1.base=|v_ULTIMATE.start_module_exit_~#status~0#1.base_3|, ULTIMATE.start_module_exit_#t~mem35#1=|v_ULTIMATE.start_module_exit_#t~mem35#1_1|, ULTIMATE.start_module_exit_#t~nondet36#1.base=|v_ULTIMATE.start_module_exit_#t~nondet36#1.base_1|, ULTIMATE.start_module_exit_~#status~0#1.offset=|v_ULTIMATE.start_module_exit_~#status~0#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_module_exit_#t~mem35#1, ULTIMATE.start_module_exit_#t~nondet36#1.base, ULTIMATE.start_module_exit_#t~nondet36#1.offset, ULTIMATE.start_module_exit_~#status~0#1.base, ULTIMATE.start_module_exit_~#status~0#1.offset] {1108#true} is VALID [2022-02-20 20:36:22,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {1108#true} [202] L1718-->L1718-1: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_module_exit_~#status~0#1.base_4| 4) |v_#length_5|) (= |v_ULTIMATE.start_module_exit_~#status~0#1.offset_4| 0) (= (select |v_#valid_9| |v_ULTIMATE.start_module_exit_~#status~0#1.base_4|) 0) (not (= |v_ULTIMATE.start_module_exit_~#status~0#1.base_4| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_module_exit_~#status~0#1.base_4| 1) |v_#valid_8|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_module_exit_~#status~0#1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_module_exit_~#status~0#1.base=|v_ULTIMATE.start_module_exit_~#status~0#1.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_module_exit_~#status~0#1.offset=|v_ULTIMATE.start_module_exit_~#status~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_module_exit_~#status~0#1.base, #length, ULTIMATE.start_module_exit_~#status~0#1.offset] {1108#true} is VALID [2022-02-20 20:36:22,542 INFO L290 TraceCheckUtils]: 52: Hoare triple {1108#true} [198] L1718-1-->L1719: Formula: (= (select (select |v_#memory_int_11| |v_~#t1~0.base_4|) |v_~#t1~0.offset_4|) |v_ULTIMATE.start_module_exit_#t~mem35#1_2|) InVars {#memory_int=|v_#memory_int_11|, ~#t1~0.offset=|v_~#t1~0.offset_4|, ~#t1~0.base=|v_~#t1~0.base_4|} OutVars{#memory_int=|v_#memory_int_11|, ~#t1~0.offset=|v_~#t1~0.offset_4|, ULTIMATE.start_module_exit_#t~mem35#1=|v_ULTIMATE.start_module_exit_#t~mem35#1_2|, ~#t1~0.base=|v_~#t1~0.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_module_exit_#t~mem35#1] {1108#true} is VALID [2022-02-20 20:36:22,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {1108#true} [259] thread1ENTRY-->L1698: Formula: (and (= |v_thread1Thread1of1ForFork0_~arg#1.offset_1| |v_thread1Thread1of1ForFork0_#in~arg#1.offset_1|) (= |v_thread1Thread1of1ForFork0_#in~arg#1.base_1| |v_thread1Thread1of1ForFork0_~arg#1.base_1|)) InVars {thread1Thread1of1ForFork0_#in~arg#1.base=|v_thread1Thread1of1ForFork0_#in~arg#1.base_1|, thread1Thread1of1ForFork0_#in~arg#1.offset=|v_thread1Thread1of1ForFork0_#in~arg#1.offset_1|} OutVars{thread1Thread1of1ForFork0_#in~arg#1.base=|v_thread1Thread1of1ForFork0_#in~arg#1.base_1|, thread1Thread1of1ForFork0_#in~arg#1.offset=|v_thread1Thread1of1ForFork0_#in~arg#1.offset_1|, thread1Thread1of1ForFork0_~arg#1.base=|v_thread1Thread1of1ForFork0_~arg#1.base_1|, thread1Thread1of1ForFork0_~arg#1.offset=|v_thread1Thread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~arg#1.base, thread1Thread1of1ForFork0_~arg#1.offset] {1108#true} is VALID [2022-02-20 20:36:22,543 INFO L290 TraceCheckUtils]: 54: Hoare triple {1108#true} [260] L1698-->L1698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#mutex~0.base_1|))) (and (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#mutex~0.base_1| (store .cse0 |v_~#mutex~0.offset_1| 1))) (= |v_thread1Thread1of1ForFork0_#t~nondet31#1_1| 0) (= (select .cse0 |v_~#mutex~0.offset_1|) 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_1|, #pthreadsMutex=|v_#pthreadsMutex_2|, ~#mutex~0.base=|v_~#mutex~0.base_1|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_1|, #pthreadsMutex=|v_#pthreadsMutex_1|, thread1Thread1of1ForFork0_#t~nondet31#1=|v_thread1Thread1of1ForFork0_#t~nondet31#1_1|, ~#mutex~0.base=|v_~#mutex~0.base_1|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork0_#t~nondet31#1] {1108#true} is VALID [2022-02-20 20:36:22,545 INFO L290 TraceCheckUtils]: 55: Hoare triple {1108#true} [261] L1698-1-->L1699: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet31#1=|v_thread1Thread1of1ForFork0_#t~nondet31#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet31#1] {1108#true} is VALID [2022-02-20 20:36:22,545 INFO L290 TraceCheckUtils]: 56: Hoare triple {1108#true} [262] L1699-->L1700: Formula: (= 6 v_~pdev~0_1) InVars {} OutVars{~pdev~0=v_~pdev~0_1} AuxVars[] AssignedVars[~pdev~0] {1108#true} is VALID [2022-02-20 20:36:22,545 INFO L290 TraceCheckUtils]: 57: Hoare triple {1108#true} [263] L1700-->L1700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,545 INFO L290 TraceCheckUtils]: 58: Hoare triple {1108#true} [264] L1700-1-->L1700-2: Formula: (= |v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_1| (ite (= 6 v_~pdev~0_2) 1 0)) InVars {~pdev~0=v_~pdev~0_2} OutVars{~pdev~0=v_~pdev~0_2, thread1Thread1of1ForFork0_ldv_assert_#in~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_ldv_assert_#in~expression#1] {1108#true} is VALID [2022-02-20 20:36:22,545 INFO L290 TraceCheckUtils]: 59: Hoare triple {1108#true} [265] L1700-2-->L1693: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_ldv_assert_~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_ldv_assert_~expression#1] {1108#true} is VALID [2022-02-20 20:36:22,546 INFO L290 TraceCheckUtils]: 60: Hoare triple {1108#true} [266] L1693-->L1693-1: Formula: (= |v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_3| |v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_3|) InVars {thread1Thread1of1ForFork0_ldv_assert_#in~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_3|} OutVars{thread1Thread1of1ForFork0_ldv_assert_~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_3|, thread1Thread1of1ForFork0_ldv_assert_#in~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_#in~expression#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_ldv_assert_~expression#1] {1108#true} is VALID [2022-02-20 20:36:22,546 INFO L290 TraceCheckUtils]: 61: Hoare triple {1108#true} [268] L1693-1-->L1693-5: Formula: (not (= |v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_7| 0)) InVars {thread1Thread1of1ForFork0_ldv_assert_~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_7|} OutVars{thread1Thread1of1ForFork0_ldv_assert_~expression#1=|v_thread1Thread1of1ForFork0_ldv_assert_~expression#1_7|} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,546 INFO L290 TraceCheckUtils]: 62: Hoare triple {1108#true} [271] L1693-5-->L1701: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,546 INFO L290 TraceCheckUtils]: 63: Hoare triple {1108#true} [273] L1701-->L1702: Formula: (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#mutex~0.base_2| (store (select |v_#pthreadsMutex_4| |v_~#mutex~0.base_2|) |v_~#mutex~0.offset_2| 0))) InVars {~#mutex~0.offset=|v_~#mutex~0.offset_2|, #pthreadsMutex=|v_#pthreadsMutex_4|, ~#mutex~0.base=|v_~#mutex~0.base_2|} OutVars{~#mutex~0.offset=|v_~#mutex~0.offset_2|, #pthreadsMutex=|v_#pthreadsMutex_3|, ~#mutex~0.base=|v_~#mutex~0.base_2|} AuxVars[] AssignedVars[#pthreadsMutex] {1108#true} is VALID [2022-02-20 20:36:22,546 INFO L290 TraceCheckUtils]: 64: Hoare triple {1108#true} [274] L1702-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base] {1108#true} is VALID [2022-02-20 20:36:22,546 INFO L290 TraceCheckUtils]: 65: Hoare triple {1108#true} [275] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1108#true} is VALID [2022-02-20 20:36:22,546 INFO L290 TraceCheckUtils]: 66: Hoare triple {1108#true} [278] thread1EXIT-->L1719-1: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_module_exit_#t~mem35#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4) (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= |v_thread1Thread1of1ForFork0_#res#1.offset_6| |v_ULTIMATE.start_module_exit_#t~nondet36#1.offset_5|) (= |v_ULTIMATE.start_module_exit_#t~nondet36#1.base_5| |v_thread1Thread1of1ForFork0_#res#1.base_6|)) InVars {ULTIMATE.start_module_exit_#t~mem35#1=|v_ULTIMATE.start_module_exit_#t~mem35#1_5|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_6|} OutVars{ULTIMATE.start_module_exit_#t~mem35#1=|v_ULTIMATE.start_module_exit_#t~mem35#1_5|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_6|, ULTIMATE.start_module_exit_#t~nondet36#1.base=|v_ULTIMATE.start_module_exit_#t~nondet36#1.base_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_module_exit_#t~nondet36#1.offset=|v_ULTIMATE.start_module_exit_#t~nondet36#1.offset_5|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_module_exit_#t~nondet36#1.base, ULTIMATE.start_module_exit_#t~nondet36#1.offset] {1108#true} is VALID [2022-02-20 20:36:22,547 INFO L290 TraceCheckUtils]: 67: Hoare triple {1108#true} [258] L1719-1-->L1719-2: Formula: (and (= |v_#memory_$Pointer$.base_3| (store |v_#memory_$Pointer$.base_4| |v_ULTIMATE.start_module_exit_~#status~0#1.base_5| (store (select |v_#memory_$Pointer$.base_4| |v_ULTIMATE.start_module_exit_~#status~0#1.base_5|) |v_ULTIMATE.start_module_exit_~#status~0#1.offset_5| |v_ULTIMATE.start_module_exit_#t~nondet36#1.base_2|))) (= (store |v_#memory_int_13| |v_ULTIMATE.start_module_exit_~#status~0#1.base_5| (store (select |v_#memory_int_13| |v_ULTIMATE.start_module_exit_~#status~0#1.base_5|) |v_ULTIMATE.start_module_exit_~#status~0#1.offset_5| (select (select |v_#memory_int_12| |v_ULTIMATE.start_module_exit_~#status~0#1.base_5|) |v_ULTIMATE.start_module_exit_~#status~0#1.offset_5|))) |v_#memory_int_12|) (= (store |v_#memory_$Pointer$.offset_4| |v_ULTIMATE.start_module_exit_~#status~0#1.base_5| (store (select |v_#memory_$Pointer$.offset_4| |v_ULTIMATE.start_module_exit_~#status~0#1.base_5|) |v_ULTIMATE.start_module_exit_~#status~0#1.offset_5| |v_ULTIMATE.start_module_exit_#t~nondet36#1.offset_2|)) |v_#memory_$Pointer$.offset_3|)) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_4|, ULTIMATE.start_module_exit_#t~nondet36#1.base=|v_ULTIMATE.start_module_exit_#t~nondet36#1.base_2|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_module_exit_#t~nondet36#1.offset=|v_ULTIMATE.start_module_exit_#t~nondet36#1.offset_2|, ULTIMATE.start_module_exit_~#status~0#1.base=|v_ULTIMATE.start_module_exit_~#status~0#1.base_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_4|, ULTIMATE.start_module_exit_~#status~0#1.offset=|v_ULTIMATE.start_module_exit_~#status~0#1.offset_5|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_3|, ULTIMATE.start_module_exit_#t~nondet36#1.base=|v_ULTIMATE.start_module_exit_#t~nondet36#1.base_2|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_module_exit_#t~nondet36#1.offset=|v_ULTIMATE.start_module_exit_#t~nondet36#1.offset_2|, ULTIMATE.start_module_exit_~#status~0#1.base=|v_ULTIMATE.start_module_exit_~#status~0#1.base_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_3|, ULTIMATE.start_module_exit_~#status~0#1.offset=|v_ULTIMATE.start_module_exit_~#status~0#1.offset_5|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] {1108#true} is VALID [2022-02-20 20:36:22,547 INFO L290 TraceCheckUtils]: 68: Hoare triple {1108#true} [241] L1719-2-->L1719-3: Formula: true InVars {} OutVars{ULTIMATE.start_module_exit_#t~mem35#1=|v_ULTIMATE.start_module_exit_#t~mem35#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_module_exit_#t~mem35#1] {1108#true} is VALID [2022-02-20 20:36:22,547 INFO L290 TraceCheckUtils]: 69: Hoare triple {1108#true} [162] L1719-3-->L1721: Formula: true InVars {} OutVars{ULTIMATE.start_module_exit_#t~nondet36#1.offset=|v_ULTIMATE.start_module_exit_#t~nondet36#1.offset_3|, ULTIMATE.start_module_exit_#t~nondet36#1.base=|v_ULTIMATE.start_module_exit_#t~nondet36#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_module_exit_#t~nondet36#1.base, ULTIMATE.start_module_exit_#t~nondet36#1.offset] {1108#true} is VALID [2022-02-20 20:36:22,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {1108#true} [217] L1721-->L1722: Formula: (= 5 v_~pdev~0_8) InVars {} OutVars{~pdev~0=v_~pdev~0_8} AuxVars[] AssignedVars[~pdev~0] {1110#(= ~pdev~0 5)} is VALID [2022-02-20 20:36:22,548 INFO L290 TraceCheckUtils]: 71: Hoare triple {1110#(= ~pdev~0 5)} [243] L1722-->L1722-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1110#(= ~pdev~0 5)} is VALID [2022-02-20 20:36:22,550 INFO L290 TraceCheckUtils]: 72: Hoare triple {1110#(= ~pdev~0 5)} [183] L1722-1-->L1722-2: Formula: (= (ite (= 5 v_~pdev~0_9) 1 0) |v_ULTIMATE.start_ldv_assert_#in~expression#1_5|) InVars {~pdev~0=v_~pdev~0_9} OutVars{~pdev~0=v_~pdev~0_9, ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_#in~expression#1] {1111#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:22,550 INFO L290 TraceCheckUtils]: 73: Hoare triple {1111#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} [188] L1722-2-->L1693-12: Formula: true InVars {} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {1111#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} is VALID [2022-02-20 20:36:22,553 INFO L290 TraceCheckUtils]: 74: Hoare triple {1111#(not (= |ULTIMATE.start_ldv_assert_#in~expression#1| 0))} [177] L1693-12-->L1693-13: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_11| |v_ULTIMATE.start_ldv_assert_#in~expression#1_6|) InVars {ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_6|} OutVars{ULTIMATE.start_ldv_assert_#in~expression#1=|v_ULTIMATE.start_ldv_assert_#in~expression#1_6|, ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_ldv_assert_~expression#1] {1112#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))} is VALID [2022-02-20 20:36:22,554 INFO L290 TraceCheckUtils]: 75: Hoare triple {1112#(not (= |ULTIMATE.start_ldv_assert_~expression#1| 0))} [218] L1693-13-->L1693-14: Formula: (= |v_ULTIMATE.start_ldv_assert_~expression#1_12| 0) InVars {ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_12|} OutVars{ULTIMATE.start_ldv_assert_~expression#1=|v_ULTIMATE.start_ldv_assert_~expression#1_12|} AuxVars[] AssignedVars[] {1109#false} is VALID [2022-02-20 20:36:22,554 INFO L290 TraceCheckUtils]: 76: Hoare triple {1109#false} [180] L1693-14-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1109#false} is VALID [2022-02-20 20:36:22,555 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:36:22,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:36:22,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807186362] [2022-02-20 20:36:22,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807186362] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:36:22,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:36:22,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:36:22,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342084422] [2022-02-20 20:36:22,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:36:22,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2022-02-20 20:36:22,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:36:22,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:36:22,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:36:22,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:36:22,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:36:22,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:36:22,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:36:22,617 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 113 [2022-02-20 20:36:22,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:36:22,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:36:22,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 113 [2022-02-20 20:36:22,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:36:22,664 INFO L129 PetriNetUnfolder]: 0/75 cut-off events. [2022-02-20 20:36:22,665 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-02-20 20:36:22,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 75 events. 0/75 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 24 event pairs, 0 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-02-20 20:36:22,665 INFO L132 encePairwiseOnDemand]: 107/113 looper letters, 0 selfloop transitions, 0 changer transitions 75/75 dead transitions. [2022-02-20 20:36:22,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 75 transitions, 188 flow [2022-02-20 20:36:22,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:36:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:36:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions. [2022-02-20 20:36:22,670 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7477876106194691 [2022-02-20 20:36:22,670 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 507 transitions. [2022-02-20 20:36:22,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions. [2022-02-20 20:36:22,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:36:22,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions. [2022-02-20 20:36:22,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 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:36:22,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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:36:22,673 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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:36:22,673 INFO L186 Difference]: Start difference. First operand has 90 places, 77 transitions, 164 flow. Second operand 6 states and 507 transitions. [2022-02-20 20:36:22,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 75 transitions, 188 flow [2022-02-20 20:36:22,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 75 transitions, 181 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:36:22,674 INFO L242 Difference]: Finished difference. Result has 83 places, 0 transitions, 0 flow [2022-02-20 20:36:22,674 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=83, PETRI_TRANSITIONS=0} [2022-02-20 20:36:22,675 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, -19 predicate places. [2022-02-20 20:36:22,676 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 0 transitions, 0 flow [2022-02-20 20:36:22,676 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:36:22,676 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 77 [2022-02-20 20:36:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:36:22,676 INFO L470 AbstractCegarLoop]: Abstraction has has 83 places, 0 transitions, 0 flow [2022-02-20 20:36:22,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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:36:22,679 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-20 20:36:22,679 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-20 20:36:22,679 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-02-20 20:36:22,680 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-02-20 20:36:22,680 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 6 remaining) [2022-02-20 20:36:22,680 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-20 20:36:22,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:36:22,682 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 20:36:22,685 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:36:22,685 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:36:22,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:36:22 BasicIcfg [2022-02-20 20:36:22,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:36:22,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:36:22,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:36:22,690 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:36:22,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:36:21" (3/4) ... [2022-02-20 20:36:22,692 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:36:22,695 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-02-20 20:36:22,700 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-02-20 20:36:22,700 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 20:36:22,700 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:36:22,700 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:36:22,724 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:36:22,724 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:36:22,725 INFO L158 Benchmark]: Toolchain (without parser) took 2786.43ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 46.5MB in the beginning and 82.1MB in the end (delta: -35.6MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2022-02-20 20:36:22,725 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 86.0MB. Free memory was 66.3MB in the beginning and 66.2MB in the end (delta: 93.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:36:22,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.88ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 46.4MB in the beginning and 64.9MB in the end (delta: -18.6MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2022-02-20 20:36:22,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.63ms. Allocated memory is still 104.9MB. Free memory was 64.9MB in the beginning and 61.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:36:22,726 INFO L158 Benchmark]: Boogie Preprocessor took 42.31ms. Allocated memory is still 104.9MB. Free memory was 61.3MB in the beginning and 58.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:36:22,726 INFO L158 Benchmark]: RCFGBuilder took 400.33ms. Allocated memory is still 104.9MB. Free memory was 58.7MB in the beginning and 74.9MB in the end (delta: -16.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2022-02-20 20:36:22,726 INFO L158 Benchmark]: TraceAbstraction took 1584.24ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 74.3MB in the beginning and 85.3MB in the end (delta: -11.0MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-02-20 20:36:22,727 INFO L158 Benchmark]: Witness Printer took 34.47ms. Allocated memory is still 125.8MB. Free memory was 85.3MB in the beginning and 82.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:36:22,728 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.13ms. Allocated memory is still 86.0MB. Free memory was 66.3MB in the beginning and 66.2MB in the end (delta: 93.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.88ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 46.4MB in the beginning and 64.9MB in the end (delta: -18.6MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.63ms. Allocated memory is still 104.9MB. Free memory was 64.9MB in the beginning and 61.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.31ms. Allocated memory is still 104.9MB. Free memory was 61.3MB in the beginning and 58.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 400.33ms. Allocated memory is still 104.9MB. Free memory was 58.7MB in the beginning and 74.9MB in the end (delta: -16.2MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1584.24ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 74.3MB in the beginning and 85.3MB in the end (delta: -11.0MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Witness Printer took 34.47ms. Allocated memory is still 125.8MB. Free memory was 85.3MB in the beginning and 82.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: 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, 126 locations, 6 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: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 47 mSDtfsCounter, 83 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=1, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:36:22,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE