./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2-unrolled-atomic.wvr.c --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/weaver/parallel-misc-2-unrolled-atomic.wvr.c -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 fafa05b72e6925548935fa790281a49d4bca5cad8ef15917dd3e0ea4e3ccb38f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:49:39,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:49:39,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:49:39,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:49:39,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:49:39,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:49:39,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:49:39,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:49:39,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:49:39,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:49:39,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:49:39,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:49:39,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:49:39,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:49:39,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:49:39,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:49:39,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:49:39,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:49:39,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:49:39,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:49:39,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:49:39,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:49:39,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:49:39,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:49:39,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:49:39,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:49:39,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:49:39,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:49:39,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:49:39,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:49:39,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:49:39,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:49:39,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:49:40,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:49:40,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:49:40,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:49:40,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:49:40,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:49:40,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:49:40,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:49:40,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:49:40,003 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:49:40,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:49:40,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:49:40,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:49:40,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:49:40,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:49:40,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:49:40,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:49:40,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:49:40,031 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:49:40,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:49:40,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:49:40,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:49:40,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:49:40,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:49:40,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:49:40,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:49:40,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:49:40,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:49:40,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:49:40,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:49:40,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:49:40,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:49:40,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:49:40,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:49:40,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:49:40,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:49:40,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:49:40,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:49:40,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:49:40,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:49:40,034 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:49:40,035 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:49:40,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:49:40,035 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 -> fafa05b72e6925548935fa790281a49d4bca5cad8ef15917dd3e0ea4e3ccb38f [2022-02-20 20:49:40,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:49:40,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:49:40,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:49:40,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:49:40,258 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:49:40,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2022-02-20 20:49:40,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f90816ab/77a21dde108c411cb47b1b2d2f8b933a/FLAG52e09ae7f [2022-02-20 20:49:40,683 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:49:40,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2-unrolled-atomic.wvr.c [2022-02-20 20:49:40,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f90816ab/77a21dde108c411cb47b1b2d2f8b933a/FLAG52e09ae7f [2022-02-20 20:49:40,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f90816ab/77a21dde108c411cb47b1b2d2f8b933a [2022-02-20 20:49:40,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:49:40,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:49:40,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:49:40,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:49:40,705 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:49:40,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:49:40" (1/1) ... [2022-02-20 20:49:40,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482ed1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40, skipping insertion in model container [2022-02-20 20:49:40,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:49:40" (1/1) ... [2022-02-20 20:49:40,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:49:40,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:49:40,854 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/weaver/parallel-misc-2-unrolled-atomic.wvr.c[2252,2265] [2022-02-20 20:49:40,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:49:40,862 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:49:40,881 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/weaver/parallel-misc-2-unrolled-atomic.wvr.c[2252,2265] [2022-02-20 20:49:40,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:49:40,891 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:49:40,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40 WrapperNode [2022-02-20 20:49:40,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:49:40,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:49:40,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:49:40,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:49:40,897 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:49:40" (1/1) ... [2022-02-20 20:49:40,902 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:49:40" (1/1) ... [2022-02-20 20:49:40,929 INFO L137 Inliner]: procedures = 20, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 68 [2022-02-20 20:49:40,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:49:40,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:49:40,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:49:40,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:49:40,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40" (1/1) ... [2022-02-20 20:49:40,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40" (1/1) ... [2022-02-20 20:49:40,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40" (1/1) ... [2022-02-20 20:49:40,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40" (1/1) ... [2022-02-20 20:49:40,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40" (1/1) ... [2022-02-20 20:49:40,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40" (1/1) ... [2022-02-20 20:49:40,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40" (1/1) ... [2022-02-20 20:49:40,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:49:40,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:49:40,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:49:40,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:49:40,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40" (1/1) ... [2022-02-20 20:49:40,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:49:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:49:40,986 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:49:40,988 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:49:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:49:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-20 20:49:41,018 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-20 20:49:41,018 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-20 20:49:41,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-20 20:49:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:49:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:49:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:49:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:49:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:49:41,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:49:41,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:49:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:49:41,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:49:41,021 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:49:41,069 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:49:41,071 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:49:41,297 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:49:41,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:49:41,424 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 20:49:41,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:49:41 BoogieIcfgContainer [2022-02-20 20:49:41,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:49:41,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:49:41,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:49:41,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:49:41,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:49:40" (1/3) ... [2022-02-20 20:49:41,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f88dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:49:41, skipping insertion in model container [2022-02-20 20:49:41,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:49:40" (2/3) ... [2022-02-20 20:49:41,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f88dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:49:41, skipping insertion in model container [2022-02-20 20:49:41,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:49:41" (3/3) ... [2022-02-20 20:49:41,436 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-2-unrolled-atomic.wvr.c [2022-02-20 20:49:41,440 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:49:41,440 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:49:41,440 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:49:41,441 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:49:41,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,523 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,524 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,525 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,530 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,530 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,531 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,531 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,531 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,531 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,531 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,532 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,536 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:49:41,542 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-20 20:49:41,575 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:49:41,582 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:49:41,582 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:49:41,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 96 transitions, 208 flow [2022-02-20 20:49:41,643 INFO L129 PetriNetUnfolder]: 7/94 cut-off events. [2022-02-20 20:49:41,644 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:49:41,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 94 events. 7/94 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-02-20 20:49:41,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 96 transitions, 208 flow [2022-02-20 20:49:41,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 85 transitions, 182 flow [2022-02-20 20:49:41,682 INFO L129 PetriNetUnfolder]: 7/84 cut-off events. [2022-02-20 20:49:41,682 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:49:41,683 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:49:41,683 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] [2022-02-20 20:49:41,684 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:49:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:49:41,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1247515966, now seen corresponding path program 1 times [2022-02-20 20:49:41,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:49:41,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741807615] [2022-02-20 20:49:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:49:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:49:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:49:42,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} [224] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} [200] 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] {99#true} is VALID [2022-02-20 20:49:42,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} [233] L-1-1-->L-1-2: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {99#true} [236] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,069 INFO L290 TraceCheckUtils]: 4: Hoare triple {99#true} [194] L21-->L21-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {99#true} [219] L21-1-->L21-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[] {99#true} is VALID [2022-02-20 20:49:42,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {99#true} [213] L21-2-->L21-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[] {99#true} is VALID [2022-02-20 20:49:42,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {99#true} [178] L21-3-->L21-4: Formula: (and (= (select |v_#valid_7| 2) 1) (= 38 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {99#true} [247] L21-4-->L37: Formula: (= v_~pos~0_9 0) InVars {} OutVars{~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~pos~0] {99#true} is VALID [2022-02-20 20:49:42,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {99#true} [231] L37-->L37-1: Formula: (= v_~i1~0_7 0) InVars {} OutVars{~i1~0=v_~i1~0_7} AuxVars[] AssignedVars[~i1~0] {99#true} is VALID [2022-02-20 20:49:42,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {99#true} [232] L37-1-->L37-2: Formula: (= v_~i2~0_7 0) InVars {} OutVars{~i2~0=v_~i2~0_7} AuxVars[] AssignedVars[~i2~0] {99#true} is VALID [2022-02-20 20:49:42,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {99#true} [179] L37-2-->L-1-3: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] {99#true} is VALID [2022-02-20 20:49:42,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {99#true} [245] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {99#true} [210] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {99#true} [174] 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] {99#true} is VALID [2022-02-20 20:49:42,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {99#true} [207] L-1-6-->L66: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t2~0#1.base] {99#true} is VALID [2022-02-20 20:49:42,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {99#true} [198] L66-->L66-1: Formula: (and (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) (= 0 (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_4|)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_4| 0)) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_4| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_4| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {99#true} is VALID [2022-02-20 20:49:42,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {99#true} [237] L66-1-->L66-2: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_4| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 1)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_4| 4) |v_#length_5|) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {99#true} is VALID [2022-02-20 20:49:42,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {99#true} [204] L66-2-->L69: Formula: (and (<= |v_ULTIMATE.start_main_#t~nondet7#1_2| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet7#1_2| 2147483648))) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {99#true} [172] L69-->L69-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~pos~0_10) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|, ~pos~0=v_~pos~0_10} AuxVars[] AssignedVars[~pos~0] {99#true} is VALID [2022-02-20 20:49:42,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {99#true} [238] L69-1-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {99#true} is VALID [2022-02-20 20:49:42,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {99#true} [250] L70-->L70-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet8#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet8#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {99#true} [189] L70-1-->L70-2: Formula: (= v_~i1~0_8 |v_ULTIMATE.start_main_#t~nondet8#1_3|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, ~i1~0=v_~i1~0_8} AuxVars[] AssignedVars[~i1~0] {99#true} is VALID [2022-02-20 20:49:42,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {99#true} [188] L70-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {99#true} is VALID [2022-02-20 20:49:42,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {99#true} [166] L71-->L71-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet9#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet9#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {99#true} [182] L71-1-->L71-2: Formula: (= v_~i2~0_8 |v_ULTIMATE.start_main_#t~nondet9#1_3|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~i2~0=v_~i2~0_8} AuxVars[] AssignedVars[~i2~0] {99#true} is VALID [2022-02-20 20:49:42,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {99#true} [234] L71-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] {99#true} is VALID [2022-02-20 20:49:42,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {99#true} [249] L72-->L72-1: Formula: (and (<= |v_ULTIMATE.start_main_#t~nondet10#1_2| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet10#1_2| 2147483648))) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {99#true} [160] L72-1-->L72-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] {99#true} is VALID [2022-02-20 20:49:42,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {99#true} [167] L72-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {99#true} is VALID [2022-02-20 20:49:42,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {99#true} [243] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {99#true} is VALID [2022-02-20 20:49:42,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {99#true} [193] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~i1~0_9 v_~pos~0_11) (= v_~i2~0_9 v_~pos~0_11) (= v_~pos~0_11 0)) 1 0)) InVars {~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9} OutVars{~i2~0=v_~i2~0_9, ~pos~0=v_~pos~0_11, ~i1~0=v_~i1~0_9, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {101#(or (= ~pos~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:49:42,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {101#(or (= ~pos~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [218] L75-2-->L33: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {101#(or (= ~pos~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} is VALID [2022-02-20 20:49:42,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {101#(or (= ~pos~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))} [183] L33-->L34: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {102#(or (= ~pos~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} is VALID [2022-02-20 20:49:42,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {102#(or (= ~pos~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} [191] L34-->L33-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {103#(= ~pos~0 0)} [228] L33-1-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {103#(= ~pos~0 0)} [251] L76-->L76-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {103#(= ~pos~0 0)} [216] L76-1-->L76-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (and (<= 0 v_~N~0_7) (<= v_~N~0_7 1073741823)) 1 0)) InVars {~N~0=v_~N~0_7} OutVars{~N~0=v_~N~0_7, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {103#(= ~pos~0 0)} [229] L76-2-->L33-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {103#(= ~pos~0 0)} [184] L33-2-->L34-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {103#(= ~pos~0 0)} [176] L34-3-->L33-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,084 INFO L290 TraceCheckUtils]: 41: Hoare triple {103#(= ~pos~0 0)} [248] L33-3-->L78: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,084 INFO L290 TraceCheckUtils]: 42: Hoare triple {103#(= ~pos~0 0)} [181] L78-->L78-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {103#(= ~pos~0 0)} [185] L78-1-->L78-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,085 INFO L290 TraceCheckUtils]: 44: Hoare triple {103#(= ~pos~0 0)} [208] L78-2-->L78-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) |v_ULTIMATE.start_main_~#t1~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre11#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|} AuxVars[] AssignedVars[#memory_int] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {103#(= ~pos~0 0)} [267] L78-3-->L46: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_4|, thread1Thread1of1ForFork0_#t~post4=|v_thread1Thread1of1ForFork0_#t~post4_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_#t~post3, thread1Thread1of1ForFork0_#t~post4, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {103#(= ~pos~0 0)} [201] L78-4-->L78-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {103#(= ~pos~0 0)} [192] L78-5-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {103#(= ~pos~0 0)} [227] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {103#(= ~pos~0 0)} [214] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,088 INFO L290 TraceCheckUtils]: 50: Hoare triple {103#(= ~pos~0 0)} [199] L79-2-->L79-3: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) |v_ULTIMATE.start_main_~#t2~0#1.offset_5| |v_ULTIMATE.start_main_#t~pre13#1_3|))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[#memory_int] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {103#(= ~pos~0 0)} [269] L79-3-->L59: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{thread2Thread1of1ForFork1_#t~post5=|v_thread2Thread1of1ForFork1_#t~post5_4|, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_#t~post6=|v_thread2Thread1of1ForFork1_#t~post6_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post5, thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_#t~post6, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {103#(= ~pos~0 0)} [235] L79-4-->L79-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {103#(= ~pos~0 0)} [173] L79-5-->L80: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,090 INFO L290 TraceCheckUtils]: 54: Hoare triple {103#(= ~pos~0 0)} [170] L80-->L80-1: Formula: (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) |v_ULTIMATE.start_main_~#t1~0#1.offset_6|) |v_ULTIMATE.start_main_#t~mem15#1_2|) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {103#(= ~pos~0 0)} [255] L46-->L40-1: Formula: (not (< v_~i1~0_1 (* 2 v_~N~0_1))) InVars {~i1~0=v_~i1~0_1, ~N~0=v_~N~0_1} OutVars{~i1~0=v_~i1~0_1, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {103#(= ~pos~0 0)} [257] L40-1-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {103#(= ~pos~0 0)} [259] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {103#(= ~pos~0 0)} [270] thread1EXIT-->L80-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem15#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {103#(= ~pos~0 0)} [180] L80-2-->L81: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {103#(= ~pos~0 0)} [230] L81-->L81-1: Formula: (= |v_ULTIMATE.start_main_#t~mem16#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {103#(= ~pos~0 0)} [261] L59-->L53-1: Formula: (not (< v_~i2~0_6 (* 2 v_~N~0_4))) InVars {~i2~0=v_~i2~0_6, ~N~0=v_~N~0_4} OutVars{~i2~0=v_~i2~0_6, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {103#(= ~pos~0 0)} [263] L53-1-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,096 INFO L290 TraceCheckUtils]: 63: Hoare triple {103#(= ~pos~0 0)} [265] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {103#(= ~pos~0 0)} [271] thread2EXIT-->L81-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem16#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,097 INFO L290 TraceCheckUtils]: 65: Hoare triple {103#(= ~pos~0 0)} [187] L81-2-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16#1] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,097 INFO L290 TraceCheckUtils]: 66: Hoare triple {103#(= ~pos~0 0)} [186] L83-->L83-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#(= ~pos~0 0)} is VALID [2022-02-20 20:49:42,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {103#(= ~pos~0 0)} [252] L83-1-->L83-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| (ite (not (= v_~pos~0_12 0)) 1 0)) InVars {~pos~0=v_~pos~0_12} OutVars{~pos~0=v_~pos~0_12, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {104#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:49:42,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {104#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [209] L83-2-->L33-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {104#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:49:42,099 INFO L290 TraceCheckUtils]: 69: Hoare triple {104#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [165] L33-4-->L34-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {105#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:49:42,099 INFO L290 TraceCheckUtils]: 70: Hoare triple {105#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [226] L34-6-->L33-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[] {100#false} is VALID [2022-02-20 20:49:42,099 INFO L290 TraceCheckUtils]: 71: Hoare triple {100#false} [212] L33-5-->L84: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#false} is VALID [2022-02-20 20:49:42,100 INFO L290 TraceCheckUtils]: 72: Hoare triple {100#false} [220] L84-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {100#false} is VALID [2022-02-20 20:49:42,102 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:49:42,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:49:42,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741807615] [2022-02-20 20:49:42,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741807615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:49:42,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:49:42,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:49:42,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107339027] [2022-02-20 20:49:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:49:42,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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 73 [2022-02-20 20:49:42,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:49:42,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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:49:42,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:49:42,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:49:42,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:49:42,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:49:42,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:49:42,238 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 96 [2022-02-20 20:49:42,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 7 states have internal predecessors, (487), 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:49:42,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:49:42,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 96 [2022-02-20 20:49:42,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:49:42,394 INFO L129 PetriNetUnfolder]: 4/79 cut-off events. [2022-02-20 20:49:42,394 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-02-20 20:49:42,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 79 events. 4/79 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 7/82 useless extension candidates. Maximal degree in co-relation 74. Up to 14 conditions per place. [2022-02-20 20:49:42,395 INFO L132 encePairwiseOnDemand]: 81/96 looper letters, 0 selfloop transitions, 0 changer transitions 77/77 dead transitions. [2022-02-20 20:49:42,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 77 transitions, 210 flow [2022-02-20 20:49:42,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:49:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:49:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 631 transitions. [2022-02-20 20:49:42,414 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7303240740740741 [2022-02-20 20:49:42,415 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 631 transitions. [2022-02-20 20:49:42,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 631 transitions. [2022-02-20 20:49:42,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:49:42,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 631 transitions. [2022-02-20 20:49:42,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 70.11111111111111) internal successors, (631), 9 states have internal predecessors, (631), 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:49:42,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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:49:42,425 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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:49:42,427 INFO L186 Difference]: Start difference. First operand has 85 places, 85 transitions, 182 flow. Second operand 9 states and 631 transitions. [2022-02-20 20:49:42,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 77 transitions, 210 flow [2022-02-20 20:49:42,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 77 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:49:42,430 INFO L242 Difference]: Finished difference. Result has 86 places, 0 transitions, 0 flow [2022-02-20 20:49:42,432 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=86, PETRI_TRANSITIONS=0} [2022-02-20 20:49:42,434 INFO L334 CegarLoopForPetriNet]: 85 programPoint places, 1 predicate places. [2022-02-20 20:49:42,435 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 0 transitions, 0 flow [2022-02-20 20:49:42,435 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:49:42,435 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 73 [2022-02-20 20:49:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:49:42,435 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 0 transitions, 0 flow [2022-02-20 20:49:42,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 7 states have internal predecessors, (487), 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:49:42,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 20:49:42,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-20 20:49:42,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-20 20:49:42,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:49:42,441 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-02-20 20:49:42,443 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:49:42,443 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:49:42,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:49:42 BasicIcfg [2022-02-20 20:49:42,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:49:42,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:49:42,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:49:42,446 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:49:42,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:49:41" (3/4) ... [2022-02-20 20:49:42,449 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:49:42,452 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-02-20 20:49:42,452 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-02-20 20:49:42,455 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 20:49:42,455 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:49:42,455 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:49:42,456 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:49:42,479 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:49:42,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:49:42,480 INFO L158 Benchmark]: Toolchain (without parser) took 1778.29ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 66.4MB in the beginning and 86.0MB in the end (delta: -19.6MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2022-02-20 20:49:42,480 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory was 71.0MB in the beginning and 71.0MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:49:42,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.66ms. Allocated memory is still 100.7MB. Free memory was 66.1MB in the beginning and 75.5MB in the end (delta: -9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 20:49:42,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.95ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 73.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:49:42,481 INFO L158 Benchmark]: Boogie Preprocessor took 25.24ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 72.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:49:42,481 INFO L158 Benchmark]: RCFGBuilder took 468.79ms. Allocated memory is still 100.7MB. Free memory was 72.2MB in the beginning and 54.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 20:49:42,482 INFO L158 Benchmark]: TraceAbstraction took 1018.26ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 54.1MB in the beginning and 88.8MB in the end (delta: -34.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:49:42,482 INFO L158 Benchmark]: Witness Printer took 33.02ms. Allocated memory is still 121.6MB. Free memory was 88.8MB in the beginning and 86.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:49:42,484 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.23ms. Allocated memory is still 100.7MB. Free memory was 71.0MB in the beginning and 71.0MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.66ms. Allocated memory is still 100.7MB. Free memory was 66.1MB in the beginning and 75.5MB in the end (delta: -9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.95ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 73.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.24ms. Allocated memory is still 100.7MB. Free memory was 73.7MB in the beginning and 72.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 468.79ms. Allocated memory is still 100.7MB. Free memory was 72.2MB in the beginning and 54.5MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1018.26ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 54.1MB in the beginning and 88.8MB in the end (delta: -34.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 33.02ms. Allocated memory is still 121.6MB. Free memory was 88.8MB in the beginning and 86.0MB in the end (delta: 2.9MB). 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: 84]: 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 5 procedures, 102 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.9s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 10 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:49:42,521 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