./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-lit/fkp2013_variant-1.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/pthread-lit/fkp2013_variant-1.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 6f1a33edf94ce8e584ad249b95ad5bb2102c6ab4d820eebd8874b39ecbf22785 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:35:51,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:35:51,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:35:51,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:35:51,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:35:51,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:35:51,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:35:51,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:35:51,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:35:51,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:35:51,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:35:51,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:35:51,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:35:51,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:35:51,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:35:51,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:35:51,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:35:51,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:35:51,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:35:51,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:35:51,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:35:51,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:35:51,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:35:51,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:35:51,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:35:51,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:35:51,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:35:51,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:35:51,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:35:51,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:35:51,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:35:51,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:35:51,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:35:51,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:35:51,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:35:51,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:35:51,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:35:51,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:35:51,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:35:51,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:35:51,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:35:51,457 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:35:51,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:35:51,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:35:51,472 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:35:51,472 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:35:51,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:35:51,473 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:35:51,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:35:51,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:35:51,473 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:35:51,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:35:51,474 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:35:51,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:35:51,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:35:51,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:35:51,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:35:51,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:35:51,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:35:51,475 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:35:51,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:35:51,475 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:35:51,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:35:51,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:35:51,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:35:51,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:35:51,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:35:51,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:35:51,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:35:51,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:35:51,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:35:51,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:35:51,477 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:35:51,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:35:51,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:35:51,477 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 -> 6f1a33edf94ce8e584ad249b95ad5bb2102c6ab4d820eebd8874b39ecbf22785 [2022-02-20 20:35:51,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:35:51,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:35:51,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:35:51,713 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:35:51,714 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:35:51,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/fkp2013_variant-1.i [2022-02-20 20:35:51,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76051e3ec/c3c93e2751f94e3c824388cc6affa659/FLAG89d7be95d [2022-02-20 20:35:52,185 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:35:52,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/fkp2013_variant-1.i [2022-02-20 20:35:52,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76051e3ec/c3c93e2751f94e3c824388cc6affa659/FLAG89d7be95d [2022-02-20 20:35:52,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76051e3ec/c3c93e2751f94e3c824388cc6affa659 [2022-02-20 20:35:52,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:35:52,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:35:52,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:35:52,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:35:52,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:35:52,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:35:52" (1/1) ... [2022-02-20 20:35:52,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e84ca4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:52, skipping insertion in model container [2022-02-20 20:35:52,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:35:52" (1/1) ... [2022-02-20 20:35:52,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:35:52,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:35:52,796 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/pthread-lit/fkp2013_variant-1.i[30003,30016] [2022-02-20 20:35:52,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:35:52,816 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:35:52,846 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/pthread-lit/fkp2013_variant-1.i[30003,30016] [2022-02-20 20:35:52,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:35:52,875 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:35:52,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:52 WrapperNode [2022-02-20 20:35:52,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:35:52,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:35:52,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:35:52,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:35:52,881 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:35:52" (1/1) ... [2022-02-20 20:35:52,904 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:35:52" (1/1) ... [2022-02-20 20:35:52,926 INFO L137 Inliner]: procedures = 172, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2022-02-20 20:35:52,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:35:52,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:35:52,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:35:52,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:35:52,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:52" (1/1) ... [2022-02-20 20:35:52,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:52" (1/1) ... [2022-02-20 20:35:52,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:52" (1/1) ... [2022-02-20 20:35:52,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:52" (1/1) ... [2022-02-20 20:35:52,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:52" (1/1) ... [2022-02-20 20:35:52,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:52" (1/1) ... [2022-02-20 20:35:52,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:35:52" (1/1) ... [2022-02-20 20:35:52,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:35:52,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:35:52,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:35:52,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:35:52,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:52" (1/1) ... [2022-02-20 20:35:52,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:35:52,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:35:52,992 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:35:53,009 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:35:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2022-02-20 20:35:53,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2022-02-20 20:35:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-02-20 20:35:53,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-02-20 20:35:53,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:35:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:35:53,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:35:53,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:35:53,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:35:53,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:35:53,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:35:53,022 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:35:53,111 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:35:53,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:35:53,232 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:35:53,237 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:35:53,237 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 20:35:53,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:35:53 BoogieIcfgContainer [2022-02-20 20:35:53,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:35:53,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:35:53,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:35:53,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:35:53,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:35:52" (1/3) ... [2022-02-20 20:35:53,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3c9c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:35:53, skipping insertion in model container [2022-02-20 20:35:53,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:35:52" (2/3) ... [2022-02-20 20:35:53,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3c9c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:35:53, skipping insertion in model container [2022-02-20 20:35:53,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:35:53" (3/3) ... [2022-02-20 20:35:53,259 INFO L111 eAbstractionObserver]: Analyzing ICFG fkp2013_variant-1.i [2022-02-20 20:35:53,262 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:35:53,263 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:35:53,263 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:35:53,263 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:35:53,301 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,302 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,302 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,302 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,302 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,303 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,303 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,303 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,303 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,303 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,304 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,304 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,304 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,304 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,305 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,305 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,305 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,305 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,314 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,314 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,314 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,315 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,315 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:53,318 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:35:53,349 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:35:53,356 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:35:53,356 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 20:35:53,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 80 transitions, 170 flow [2022-02-20 20:35:53,408 INFO L129 PetriNetUnfolder]: 4/93 cut-off events. [2022-02-20 20:35:53,408 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:35:53,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 93 events. 4/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2022-02-20 20:35:53,411 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 80 transitions, 170 flow [2022-02-20 20:35:53,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 79 transitions, 166 flow [2022-02-20 20:35:53,430 INFO L129 PetriNetUnfolder]: 2/53 cut-off events. [2022-02-20 20:35:53,434 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:35:53,434 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:35:53,434 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] [2022-02-20 20:35:53,435 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:35:53,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:35:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1926868283, now seen corresponding path program 1 times [2022-02-20 20:35:53,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:35:53,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484851951] [2022-02-20 20:35:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:35:53,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:35:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:35:53,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} [157] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:53,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} [146] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {86#true} is VALID [2022-02-20 20:35:53,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {86#true} [164] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:53,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {86#true} [168] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:53,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {86#true} [111] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:53,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {86#true} [156] L683-1-->L683-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:53,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {86#true} [145] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:53,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {86#true} [162] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:53,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {86#true} [103] L683-4-->L698: Formula: (= v_~x~0_4 0) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] {86#true} is VALID [2022-02-20 20:35:53,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {86#true} [134] L698-->L-1-3: Formula: (= v_~n~0_2 0) InVars {} OutVars{~n~0=v_~n~0_2} AuxVars[] AssignedVars[~n~0] {86#true} is VALID [2022-02-20 20:35:53,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {86#true} [170] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:53,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {86#true} [149] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:35:53,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {86#true} [121] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {86#true} is VALID [2022-02-20 20:35:53,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {86#true} [148] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {86#true} is VALID [2022-02-20 20:35:53,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {86#true} [113] L-1-7-->L709: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t2~0#1.base] {86#true} is VALID [2022-02-20 20:35:53,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {86#true} [152] L709-->L709-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {86#true} is VALID [2022-02-20 20:35:53,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {86#true} [159] L709-1-->L710: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {86#true} is VALID [2022-02-20 20:35:53,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {86#true} [101] L710-->L710-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {86#true} is VALID [2022-02-20 20:35:53,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {86#true} [173] L710-1-->L710-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {86#true} is VALID [2022-02-20 20:35:53,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {86#true} [147] L710-2-->L712: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {86#true} is VALID [2022-02-20 20:35:53,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {86#true} [172] L712-->L713: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] {88#(= ~x~0 0)} is VALID [2022-02-20 20:35:53,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {88#(= ~x~0 0)} [140] L713-->L713-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[] {88#(= ~x~0 0)} is VALID [2022-02-20 20:35:53,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {88#(= ~x~0 0)} [119] L713-1-->L713-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|, ~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] {89#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:35:53,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {89#(or (= ~x~0 0) (<= ~n~0 0))} [114] L713-2-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {89#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:35:53,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {89#(or (= ~x~0 0) (<= ~n~0 0))} [108] L714-->L714-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {89#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:35:53,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {89#(or (= ~x~0 0) (<= ~n~0 0))} [132] L714-1-->L714-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~n~0_4) 1 0)) InVars {~n~0=v_~n~0_4} OutVars{~n~0=v_~n~0_4, 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] {90#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} is VALID [2022-02-20 20:35:53,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {90#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} [122] L714-2-->L685: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {90#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} is VALID [2022-02-20 20:35:53,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {90#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} [123] L685-->L686: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) 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_2|, 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] {91#(and (or (= ~x~0 0) (<= ~n~0 0)) (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 20:35:53,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {91#(and (or (= ~x~0 0) (<= ~n~0 0)) (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} [175] L686-->L685-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:53,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [153] L685-1-->L715: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:53,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [115] L715-->L715-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:53,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [125] L715-1-->L715-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:53,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [105] L715-2-->L715-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:53,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [199] L715-3-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~arg#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork1_thidvar0_2) (= |v_thr1Thread1of1ForFork1_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_#in~arg#1.base=|v_thr1Thread1of1ForFork1_#in~arg#1.base_4|, thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_6|, thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_10|, thr1Thread1of1ForFork1_~arg#1.base=|v_thr1Thread1of1ForFork1_~arg#1.base_4|, thr1Thread1of1ForFork1_~arg#1.offset=|v_thr1Thread1of1ForFork1_~arg#1.offset_4|, thr1Thread1of1ForFork1_#in~arg#1.offset=|v_thr1Thread1of1ForFork1_#in~arg#1.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_#in~arg#1.base, thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1, thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1, thr1Thread1of1ForFork1_~arg#1.base, thr1Thread1of1ForFork1_~arg#1.offset, thr1Thread1of1ForFork1_#in~arg#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:53,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [183] thr1ENTRY-->L700: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~arg#1.offset_1| |v_thr1Thread1of1ForFork1_~arg#1.offset_1|) (= |v_thr1Thread1of1ForFork1_~arg#1.base_1| |v_thr1Thread1of1ForFork1_#in~arg#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~arg#1.base=|v_thr1Thread1of1ForFork1_#in~arg#1.base_1|, thr1Thread1of1ForFork1_#in~arg#1.offset=|v_thr1Thread1of1ForFork1_#in~arg#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~arg#1.base=|v_thr1Thread1of1ForFork1_#in~arg#1.base_1|, thr1Thread1of1ForFork1_#in~arg#1.offset=|v_thr1Thread1of1ForFork1_#in~arg#1.offset_1|, thr1Thread1of1ForFork1_~arg#1.base=|v_thr1Thread1of1ForFork1_~arg#1.base_1|, thr1Thread1of1ForFork1_~arg#1.offset=|v_thr1Thread1of1ForFork1_~arg#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~arg#1.base, thr1Thread1of1ForFork1_~arg#1.offset] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:53,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [184] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {92#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:53,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {92#(and (= ~x~0 0) (<= 1 ~n~0))} [185] L700-1-->L700-2: Formula: (= (ite (<= v_~x~0_3 v_~n~0_1) 1 0) |v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_1|) InVars {~n~0=v_~n~0_1, ~x~0=v_~x~0_3} OutVars{thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_1|, ~n~0=v_~n~0_1, ~x~0=v_~x~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1] {93#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:35:53,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {93#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} [186] L700-2-->L688: Formula: true InVars {} OutVars{thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1] {93#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:35:53,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {93#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1| 0))} [187] L688-->L689: Formula: (= |v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_3| |v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|) InVars {thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|} OutVars{thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_3|, thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1] {94#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:35:53,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {94#(not (= |thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1| 0))} [188] L689-->L690: Formula: (= |v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5| 0) InVars {thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5|} OutVars{thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of1ForFork1___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {87#false} is VALID [2022-02-20 20:35:53,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {87#false} [190] L690-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87#false} is VALID [2022-02-20 20:35:53,900 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:35:53,900 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:35:53,901 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484851951] [2022-02-20 20:35:53,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484851951] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:35:53,901 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:35:53,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:35:53,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028094772] [2022-02-20 20:35:53,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:35:53,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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 41 [2022-02-20 20:35:53,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:35:53,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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:35:53,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:35:53,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:35:53,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:35:53,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:35:53,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:35:53,970 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 80 [2022-02-20 20:35:53,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 166 flow. Second operand has 9 states, 9 states have (on average 57.44444444444444) internal successors, (517), 9 states have internal predecessors, (517), 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:35:53,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:35:53,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 80 [2022-02-20 20:35:53,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:35:54,260 INFO L129 PetriNetUnfolder]: 71/288 cut-off events. [2022-02-20 20:35:54,261 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-02-20 20:35:54,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 288 events. 71/288 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1479 event pairs, 5 based on Foata normal form. 4/255 useless extension candidates. Maximal degree in co-relation 409. Up to 38 conditions per place. [2022-02-20 20:35:54,264 INFO L132 encePairwiseOnDemand]: 68/80 looper letters, 28 selfloop transitions, 11 changer transitions 6/100 dead transitions. [2022-02-20 20:35:54,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 100 transitions, 304 flow [2022-02-20 20:35:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:35:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-02-20 20:35:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 672 transitions. [2022-02-20 20:35:54,284 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2022-02-20 20:35:54,285 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 672 transitions. [2022-02-20 20:35:54,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 672 transitions. [2022-02-20 20:35:54,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:35:54,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 672 transitions. [2022-02-20 20:35:54,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 61.09090909090909) internal successors, (672), 11 states have internal predecessors, (672), 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:35:54,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 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:35:54,296 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 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:35:54,297 INFO L186 Difference]: Start difference. First operand has 82 places, 79 transitions, 166 flow. Second operand 11 states and 672 transitions. [2022-02-20 20:35:54,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 100 transitions, 304 flow [2022-02-20 20:35:54,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 100 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:35:54,302 INFO L242 Difference]: Finished difference. Result has 94 places, 80 transitions, 209 flow [2022-02-20 20:35:54,303 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=209, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2022-02-20 20:35:54,306 INFO L334 CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places. [2022-02-20 20:35:54,306 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 80 transitions, 209 flow [2022-02-20 20:35:54,356 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2144 states, 2137 states have (on average 2.573701450631727) internal successors, (5500), 2143 states have internal predecessors, (5500), 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:35:54,361 INFO L78 Accepts]: Start accepts. Automaton has has 2144 states, 2137 states have (on average 2.573701450631727) internal successors, (5500), 2143 states have internal predecessors, (5500), 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 41 [2022-02-20 20:35:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:35:54,362 INFO L470 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 209 flow [2022-02-20 20:35:54,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 57.44444444444444) internal successors, (517), 9 states have internal predecessors, (517), 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:35:54,363 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:35:54,363 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:35:54,364 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:35:54,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:35:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2080092778, now seen corresponding path program 1 times [2022-02-20 20:35:54,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:35:54,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329418496] [2022-02-20 20:35:54,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:35:54,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:35:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:35:54,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:35:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:35:54,420 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:35:54,420 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:35:54,421 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 4 remaining) [2022-02-20 20:35:54,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-02-20 20:35:54,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 4 remaining) [2022-02-20 20:35:54,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-02-20 20:35:54,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:35:54,426 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 20:35:54,427 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:35:54,427 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-20 20:35:54,442 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,442 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,442 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,442 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,442 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,443 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,443 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,443 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,443 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,443 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,443 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,443 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,444 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,444 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,444 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,444 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,444 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,444 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,445 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,445 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,445 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,445 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,445 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,445 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,445 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,445 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,446 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,446 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,446 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,446 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,446 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,446 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,447 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,447 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,463 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,463 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,464 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,464 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,464 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,464 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,464 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,464 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,465 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,465 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,465 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,465 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,466 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,466 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,466 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,466 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,466 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,466 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,467 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,467 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,467 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,467 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,467 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,467 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,467 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,468 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,468 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,468 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,468 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,468 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,468 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,469 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,469 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,469 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,469 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,469 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,470 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,470 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,470 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,470 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,470 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,470 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,471 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,471 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,471 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,471 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,471 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,471 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,472 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,472 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,472 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,472 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,472 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,473 WARN L322 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,473 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,473 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,473 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,473 WARN L322 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,474 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,474 WARN L322 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,474 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,474 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,474 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,475 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,475 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,475 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,475 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,476 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,476 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,476 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,476 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,476 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:35:54,476 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:35:54,477 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:35:54,478 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:35:54,478 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-20 20:35:54,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 101 transitions, 226 flow [2022-02-20 20:35:54,506 INFO L129 PetriNetUnfolder]: 5/119 cut-off events. [2022-02-20 20:35:54,507 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:35:54,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 119 events. 5/119 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 128. Up to 6 conditions per place. [2022-02-20 20:35:54,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 101 transitions, 226 flow [2022-02-20 20:35:54,508 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 86 transitions, 187 flow [2022-02-20 20:35:54,511 INFO L129 PetriNetUnfolder]: 3/58 cut-off events. [2022-02-20 20:35:54,512 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:35:54,512 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:35:54,512 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] [2022-02-20 20:35:54,512 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:35:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:35:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash 51703260, now seen corresponding path program 1 times [2022-02-20 20:35:54,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:35:54,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257219820] [2022-02-20 20:35:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:35:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:35:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:35:54,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#true} [258] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:35:54,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} [247] 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] {110#true} is VALID [2022-02-20 20:35:54,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} [265] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:35:54,621 INFO L290 TraceCheckUtils]: 3: Hoare triple {110#true} [269] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:35:54,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {110#true} [212] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:35:54,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} [257] L683-1-->L683-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[] {110#true} is VALID [2022-02-20 20:35:54,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {110#true} [246] L683-2-->L683-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[] {110#true} is VALID [2022-02-20 20:35:54,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {110#true} [263] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:35:54,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {110#true} [204] L683-4-->L698: Formula: (= v_~x~0_4 0) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] {110#true} is VALID [2022-02-20 20:35:54,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {110#true} [235] L698-->L-1-3: Formula: (= v_~n~0_2 0) InVars {} OutVars{~n~0=v_~n~0_2} AuxVars[] AssignedVars[~n~0] {110#true} is VALID [2022-02-20 20:35:54,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {110#true} [271] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:35:54,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {110#true} [250] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {110#true} is VALID [2022-02-20 20:35:54,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {110#true} [222] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {110#true} is VALID [2022-02-20 20:35:54,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {110#true} [249] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {110#true} is VALID [2022-02-20 20:35:54,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {110#true} [214] L-1-7-->L709: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t2~0#1.base] {110#true} is VALID [2022-02-20 20:35:54,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {110#true} [253] L709-->L709-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {110#true} is VALID [2022-02-20 20:35:54,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {110#true} [260] L709-1-->L710: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {110#true} is VALID [2022-02-20 20:35:54,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {110#true} [202] L710-->L710-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {110#true} is VALID [2022-02-20 20:35:54,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {110#true} [274] L710-1-->L710-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {110#true} is VALID [2022-02-20 20:35:54,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {110#true} [248] L710-2-->L712: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {110#true} is VALID [2022-02-20 20:35:54,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {110#true} [273] L712-->L713: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] {112#(= ~x~0 0)} is VALID [2022-02-20 20:35:54,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {112#(= ~x~0 0)} [241] L713-->L713-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[] {112#(= ~x~0 0)} is VALID [2022-02-20 20:35:54,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {112#(= ~x~0 0)} [220] L713-1-->L713-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|, ~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] {113#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:35:54,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {113#(or (= ~x~0 0) (<= ~n~0 0))} [215] L713-2-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {113#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:35:54,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {113#(or (= ~x~0 0) (<= ~n~0 0))} [209] L714-->L714-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113#(or (= ~x~0 0) (<= ~n~0 0))} is VALID [2022-02-20 20:35:54,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {113#(or (= ~x~0 0) (<= ~n~0 0))} [233] L714-1-->L714-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~n~0_4) 1 0)) InVars {~n~0=v_~n~0_4} OutVars{~n~0=v_~n~0_4, 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] {114#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} is VALID [2022-02-20 20:35:54,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {114#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} [223] L714-2-->L685: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {114#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} is VALID [2022-02-20 20:35:54,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {114#(and (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= ~x~0 0) (<= ~n~0 0)))} [224] L685-->L686: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) 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_2|, 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] {115#(and (or (= ~x~0 0) (<= ~n~0 0)) (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 20:35:54,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {115#(and (or (= ~x~0 0) (<= ~n~0 0)) (or (not (<= ~n~0 0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} [276] L686-->L685-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:54,629 INFO L290 TraceCheckUtils]: 29: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [254] L685-1-->L715: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:54,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [216] L715-->L715-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:54,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [226] L715-1-->L715-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:54,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [206] L715-2-->L715-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:54,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [320] L715-3-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of2ForFork1_#in~arg#1.base_4| 0) (= |v_thr1Thread1of2ForFork1_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_8| v_thr1Thread1of2ForFork1_thidvar0_2) (= v_thr1Thread1of2ForFork1_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_8|} OutVars{thr1Thread1of2ForFork1_#res#1.base=|v_thr1Thread1of2ForFork1_#res#1.base_4|, thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_10|, thr1Thread1of2ForFork1_#in~arg#1.base=|v_thr1Thread1of2ForFork1_#in~arg#1.base_4|, thr1Thread1of2ForFork1_thidvar1=v_thr1Thread1of2ForFork1_thidvar1_2, thr1Thread1of2ForFork1_thidvar0=v_thr1Thread1of2ForFork1_thidvar0_2, thr1Thread1of2ForFork1_~arg#1.offset=|v_thr1Thread1of2ForFork1_~arg#1.offset_4|, thr1Thread1of2ForFork1_#in~arg#1.offset=|v_thr1Thread1of2ForFork1_#in~arg#1.offset_4|, thr1Thread1of2ForFork1_~arg#1.base=|v_thr1Thread1of2ForFork1_~arg#1.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_8|, thr1Thread1of2ForFork1_#res#1.offset=|v_thr1Thread1of2ForFork1_#res#1.offset_4|, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_6|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1_#res#1.base, thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1, thr1Thread1of2ForFork1_#in~arg#1.base, thr1Thread1of2ForFork1_thidvar1, thr1Thread1of2ForFork1_thidvar0, thr1Thread1of2ForFork1_~arg#1.offset, thr1Thread1of2ForFork1_#in~arg#1.offset, thr1Thread1of2ForFork1_~arg#1.base, thr1Thread1of2ForFork1_#res#1.offset, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:54,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [290] thr1ENTRY-->L700: Formula: (and (= |v_thr1Thread1of2ForFork1_~arg#1.offset_1| |v_thr1Thread1of2ForFork1_#in~arg#1.offset_1|) (= |v_thr1Thread1of2ForFork1_#in~arg#1.base_1| |v_thr1Thread1of2ForFork1_~arg#1.base_1|)) InVars {thr1Thread1of2ForFork1_#in~arg#1.offset=|v_thr1Thread1of2ForFork1_#in~arg#1.offset_1|, thr1Thread1of2ForFork1_#in~arg#1.base=|v_thr1Thread1of2ForFork1_#in~arg#1.base_1|} OutVars{thr1Thread1of2ForFork1_~arg#1.offset=|v_thr1Thread1of2ForFork1_~arg#1.offset_1|, thr1Thread1of2ForFork1_#in~arg#1.base=|v_thr1Thread1of2ForFork1_#in~arg#1.base_1|, thr1Thread1of2ForFork1_#in~arg#1.offset=|v_thr1Thread1of2ForFork1_#in~arg#1.offset_1|, thr1Thread1of2ForFork1_~arg#1.base=|v_thr1Thread1of2ForFork1_~arg#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1_~arg#1.offset, thr1Thread1of2ForFork1_~arg#1.base] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:54,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [291] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:54,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {116#(and (= ~x~0 0) (<= 1 ~n~0))} [292] L700-1-->L700-2: Formula: (= (ite (<= v_~x~0_3 v_~n~0_1) 1 0) |v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_1|) InVars {~n~0=v_~n~0_1, ~x~0=v_~x~0_3} OutVars{~n~0=v_~n~0_1, ~x~0=v_~x~0_3, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1] {117#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:35:54,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {117#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} [293] L700-2-->L688: Formula: true InVars {} OutVars{thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1] {117#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:35:54,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {117#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} [294] L688-->L689: Formula: (= |v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_3| |v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_3|) InVars {thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_3|} OutVars{thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_3|, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1] {118#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:35:54,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {118#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| 0))} [295] L689-->L690: Formula: (= |v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_5| 0) InVars {thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_5|} OutVars{thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {111#false} is VALID [2022-02-20 20:35:54,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {111#false} [297] L690-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#false} is VALID [2022-02-20 20:35:54,634 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:35:54,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:35:54,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257219820] [2022-02-20 20:35:54,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257219820] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:35:54,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:35:54,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:35:54,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296391834] [2022-02-20 20:35:54,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:35:54,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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 41 [2022-02-20 20:35:54,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:35:54,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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:35:54,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:35:54,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:35:54,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:35:54,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:35:54,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:35:54,661 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 101 [2022-02-20 20:35:54,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 187 flow. Second operand has 9 states, 9 states have (on average 71.44444444444444) internal successors, (643), 9 states have internal predecessors, (643), 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:35:54,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:35:54,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 101 [2022-02-20 20:35:54,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:35:54,970 INFO L129 PetriNetUnfolder]: 429/1137 cut-off events. [2022-02-20 20:35:54,970 INFO L130 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-02-20 20:35:54,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 1137 events. 429/1137 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8608 event pairs, 24 based on Foata normal form. 19/1036 useless extension candidates. Maximal degree in co-relation 1887. Up to 213 conditions per place. [2022-02-20 20:35:54,976 INFO L132 encePairwiseOnDemand]: 88/101 looper letters, 54 selfloop transitions, 14 changer transitions 6/133 dead transitions. [2022-02-20 20:35:54,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 133 transitions, 465 flow [2022-02-20 20:35:54,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:35:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-02-20 20:35:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 855 transitions. [2022-02-20 20:35:54,985 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7695769576957696 [2022-02-20 20:35:54,985 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 855 transitions. [2022-02-20 20:35:54,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 855 transitions. [2022-02-20 20:35:54,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:35:54,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 855 transitions. [2022-02-20 20:35:54,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 77.72727272727273) internal successors, (855), 11 states have internal predecessors, (855), 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:35:54,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 101.0) internal successors, (1212), 12 states have internal predecessors, (1212), 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:35:54,990 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 101.0) internal successors, (1212), 12 states have internal predecessors, (1212), 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:35:54,990 INFO L186 Difference]: Start difference. First operand has 91 places, 86 transitions, 187 flow. Second operand 11 states and 855 transitions. [2022-02-20 20:35:54,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 133 transitions, 465 flow [2022-02-20 20:35:54,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 133 transitions, 462 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-02-20 20:35:55,000 INFO L242 Difference]: Finished difference. Result has 104 places, 91 transitions, 262 flow [2022-02-20 20:35:55,000 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=262, PETRI_PLACES=104, PETRI_TRANSITIONS=91} [2022-02-20 20:35:55,001 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 13 predicate places. [2022-02-20 20:35:55,001 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 91 transitions, 262 flow [2022-02-20 20:35:55,458 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17787 states, 17777 states have (on average 3.4059740113629973) internal successors, (60548), 17786 states have internal predecessors, (60548), 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:35:55,489 INFO L78 Accepts]: Start accepts. Automaton has has 17787 states, 17777 states have (on average 3.4059740113629973) internal successors, (60548), 17786 states have internal predecessors, (60548), 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 41 [2022-02-20 20:35:55,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:35:55,490 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 91 transitions, 262 flow [2022-02-20 20:35:55,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 71.44444444444444) internal successors, (643), 9 states have internal predecessors, (643), 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:35:55,491 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:35:55,491 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:35:55,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:35:55,491 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:35:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:35:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash -492590774, now seen corresponding path program 1 times [2022-02-20 20:35:55,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:35:55,492 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564961191] [2022-02-20 20:35:55,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:35:55,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:35:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:35:55,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {17923#true} [258] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17923#true} is VALID [2022-02-20 20:35:55,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {17923#true} [247] 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] {17923#true} is VALID [2022-02-20 20:35:55,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {17923#true} [265] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {17923#true} is VALID [2022-02-20 20:35:55,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {17923#true} [269] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {17923#true} is VALID [2022-02-20 20:35:55,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {17923#true} [212] L683-->L683-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {17923#true} is VALID [2022-02-20 20:35:55,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {17923#true} [257] L683-1-->L683-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[] {17923#true} is VALID [2022-02-20 20:35:55,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {17923#true} [246] L683-2-->L683-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[] {17923#true} is VALID [2022-02-20 20:35:55,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {17923#true} [263] L683-3-->L683-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {17923#true} is VALID [2022-02-20 20:35:55,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {17923#true} [204] L683-4-->L698: Formula: (= v_~x~0_4 0) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] {17923#true} is VALID [2022-02-20 20:35:55,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {17923#true} [235] L698-->L-1-3: Formula: (= v_~n~0_2 0) InVars {} OutVars{~n~0=v_~n~0_2} AuxVars[] AssignedVars[~n~0] {17923#true} is VALID [2022-02-20 20:35:55,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {17923#true} [271] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17923#true} is VALID [2022-02-20 20:35:55,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {17923#true} [250] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17923#true} is VALID [2022-02-20 20:35:55,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {17923#true} [222] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {17923#true} is VALID [2022-02-20 20:35:55,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {17923#true} [249] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {17923#true} is VALID [2022-02-20 20:35:55,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {17923#true} [214] L-1-7-->L709: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post6#1=|v_ULTIMATE.start_main_#t~post6#1_1|, ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6#1, ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t2~0#1.base] {17923#true} is VALID [2022-02-20 20:35:55,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {17923#true} [253] L709-->L709-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {17923#true} is VALID [2022-02-20 20:35:55,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {17923#true} [260] L709-1-->L710: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {17923#true} is VALID [2022-02-20 20:35:55,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {17923#true} [202] L710-->L710-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {17923#true} is VALID [2022-02-20 20:35:55,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {17923#true} [274] L710-1-->L710-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {17923#true} is VALID [2022-02-20 20:35:55,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {17923#true} [248] L710-2-->L712: Formula: true InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {17923#true} is VALID [2022-02-20 20:35:55,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {17923#true} [273] L712-->L713: Formula: (= v_~x~0_5 0) InVars {} OutVars{~x~0=v_~x~0_5} AuxVars[] AssignedVars[~x~0] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {17925#(= ~x~0 0)} [241] L713-->L713-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet3#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {17925#(= ~x~0 0)} [220] L713-1-->L713-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet3#1_3| v_~n~0_3) InVars {ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_3|, ~n~0=v_~n~0_3} AuxVars[] AssignedVars[~n~0] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {17925#(= ~x~0 0)} [215] L713-2-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {17925#(= ~x~0 0)} [209] L714-->L714-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {17925#(= ~x~0 0)} [233] L714-1-->L714-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~n~0_4) 1 0)) InVars {~n~0=v_~n~0_4} OutVars{~n~0=v_~n~0_4, 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] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {17925#(= ~x~0 0)} [223] L714-2-->L685: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {17925#(= ~x~0 0)} [224] L685-->L686: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) 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_2|, 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] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {17925#(= ~x~0 0)} [276] L686-->L685-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {17925#(= ~x~0 0)} [254] L685-1-->L715: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {17925#(= ~x~0 0)} [216] L715-->L715-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {17925#(= ~x~0 0)} [226] L715-1-->L715-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {17925#(= ~x~0 0)} [206] L715-2-->L715-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {17925#(= ~x~0 0)} [320] L715-3-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of2ForFork1_#in~arg#1.base_4| 0) (= |v_thr1Thread1of2ForFork1_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_8| v_thr1Thread1of2ForFork1_thidvar0_2) (= v_thr1Thread1of2ForFork1_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_8|} OutVars{thr1Thread1of2ForFork1_#res#1.base=|v_thr1Thread1of2ForFork1_#res#1.base_4|, thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_10|, thr1Thread1of2ForFork1_#in~arg#1.base=|v_thr1Thread1of2ForFork1_#in~arg#1.base_4|, thr1Thread1of2ForFork1_thidvar1=v_thr1Thread1of2ForFork1_thidvar1_2, thr1Thread1of2ForFork1_thidvar0=v_thr1Thread1of2ForFork1_thidvar0_2, thr1Thread1of2ForFork1_~arg#1.offset=|v_thr1Thread1of2ForFork1_~arg#1.offset_4|, thr1Thread1of2ForFork1_#in~arg#1.offset=|v_thr1Thread1of2ForFork1_#in~arg#1.offset_4|, thr1Thread1of2ForFork1_~arg#1.base=|v_thr1Thread1of2ForFork1_~arg#1.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_8|, thr1Thread1of2ForFork1_#res#1.offset=|v_thr1Thread1of2ForFork1_#res#1.offset_4|, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_6|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1_#res#1.base, thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1, thr1Thread1of2ForFork1_#in~arg#1.base, thr1Thread1of2ForFork1_thidvar1, thr1Thread1of2ForFork1_thidvar0, thr1Thread1of2ForFork1_~arg#1.offset, thr1Thread1of2ForFork1_#in~arg#1.offset, thr1Thread1of2ForFork1_~arg#1.base, thr1Thread1of2ForFork1_#res#1.offset, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {17925#(= ~x~0 0)} [290] thr1ENTRY-->L700: Formula: (and (= |v_thr1Thread1of2ForFork1_~arg#1.offset_1| |v_thr1Thread1of2ForFork1_#in~arg#1.offset_1|) (= |v_thr1Thread1of2ForFork1_#in~arg#1.base_1| |v_thr1Thread1of2ForFork1_~arg#1.base_1|)) InVars {thr1Thread1of2ForFork1_#in~arg#1.offset=|v_thr1Thread1of2ForFork1_#in~arg#1.offset_1|, thr1Thread1of2ForFork1_#in~arg#1.base=|v_thr1Thread1of2ForFork1_#in~arg#1.base_1|} OutVars{thr1Thread1of2ForFork1_~arg#1.offset=|v_thr1Thread1of2ForFork1_~arg#1.offset_1|, thr1Thread1of2ForFork1_#in~arg#1.base=|v_thr1Thread1of2ForFork1_#in~arg#1.base_1|, thr1Thread1of2ForFork1_#in~arg#1.offset=|v_thr1Thread1of2ForFork1_#in~arg#1.offset_1|, thr1Thread1of2ForFork1_~arg#1.base=|v_thr1Thread1of2ForFork1_~arg#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1_~arg#1.offset, thr1Thread1of2ForFork1_~arg#1.base] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,574 INFO L290 TraceCheckUtils]: 35: Hoare triple {17925#(= ~x~0 0)} [291] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {17925#(= ~x~0 0)} [239] L715-4-->L715-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {17925#(= ~x~0 0)} [227] L715-5-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {17925#(= ~x~0 0)} is VALID [2022-02-20 20:35:55,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {17925#(= ~x~0 0)} [252] L716-->L716-6: Formula: (= |v_ULTIMATE.start_main_~i~0#1_3| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1] {17926#(and (= ~x~0 0) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-20 20:35:55,576 INFO L290 TraceCheckUtils]: 39: Hoare triple {17926#(and (= ~x~0 0) (= |ULTIMATE.start_main_~i~0#1| 0))} [268] L716-6-->L717: Formula: (< |v_ULTIMATE.start_main_~i~0#1_5| v_~n~0_6) InVars {~n~0=v_~n~0_6, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{~n~0=v_~n~0_6, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[] {17927#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:55,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {17927#(and (= ~x~0 0) (<= 1 ~n~0))} [228] L717-->L717-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {17927#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:55,577 INFO L290 TraceCheckUtils]: 41: Hoare triple {17927#(and (= ~x~0 0) (<= 1 ~n~0))} [261] L717-1-->L717-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {17927#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:55,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {17927#(and (= ~x~0 0) (<= 1 ~n~0))} [242] L717-2-->L717-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {17927#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:55,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {17927#(and (= ~x~0 0) (<= 1 ~n~0))} [317] L717-3-->thr2ENTRY: Formula: (and (= |v_thr2Thread1of2ForFork0_#in~arg.offset_4| 0) (= v_thr2Thread1of2ForFork0_thidvar1_2 0) (= v_thr2Thread1of2ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre7#1_8| v_thr2Thread1of2ForFork0_thidvar0_2) (= |v_thr2Thread1of2ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_8|} OutVars{thr2Thread1of2ForFork0_~t~0=v_thr2Thread1of2ForFork0_~t~0_8, thr2Thread1of2ForFork0_~arg.base=v_thr2Thread1of2ForFork0_~arg.base_4, thr2Thread1of2ForFork0_#res.base=|v_thr2Thread1of2ForFork0_#res.base_4|, thr2Thread1of2ForFork0_thidvar2=v_thr2Thread1of2ForFork0_thidvar2_2, thr2Thread1of2ForFork0_~arg.offset=v_thr2Thread1of2ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_8|, thr2Thread1of2ForFork0_thidvar0=v_thr2Thread1of2ForFork0_thidvar0_2, thr2Thread1of2ForFork0_thidvar1=v_thr2Thread1of2ForFork0_thidvar1_2, thr2Thread1of2ForFork0_#in~arg.base=|v_thr2Thread1of2ForFork0_#in~arg.base_4|, thr2Thread1of2ForFork0_#res.offset=|v_thr2Thread1of2ForFork0_#res.offset_4|, thr2Thread1of2ForFork0_#in~arg.offset=|v_thr2Thread1of2ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[thr2Thread1of2ForFork0_~t~0, thr2Thread1of2ForFork0_~arg.base, thr2Thread1of2ForFork0_#res.base, thr2Thread1of2ForFork0_thidvar2, thr2Thread1of2ForFork0_~arg.offset, thr2Thread1of2ForFork0_thidvar0, thr2Thread1of2ForFork0_thidvar1, thr2Thread1of2ForFork0_#in~arg.base, thr2Thread1of2ForFork0_#res.offset, thr2Thread1of2ForFork0_#in~arg.offset] {17927#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:55,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {17927#(and (= ~x~0 0) (<= 1 ~n~0))} [284] thr2ENTRY-->L704: Formula: (and (= |v_thr2Thread1of2ForFork0_#in~arg.offset_1| v_thr2Thread1of2ForFork0_~arg.offset_1) (= |v_thr2Thread1of2ForFork0_#in~arg.base_1| v_thr2Thread1of2ForFork0_~arg.base_1)) InVars {thr2Thread1of2ForFork0_#in~arg.offset=|v_thr2Thread1of2ForFork0_#in~arg.offset_1|, thr2Thread1of2ForFork0_#in~arg.base=|v_thr2Thread1of2ForFork0_#in~arg.base_1|} OutVars{thr2Thread1of2ForFork0_~arg.offset=v_thr2Thread1of2ForFork0_~arg.offset_1, thr2Thread1of2ForFork0_#in~arg.base=|v_thr2Thread1of2ForFork0_#in~arg.base_1|, thr2Thread1of2ForFork0_#in~arg.offset=|v_thr2Thread1of2ForFork0_#in~arg.offset_1|, thr2Thread1of2ForFork0_~arg.base=v_thr2Thread1of2ForFork0_~arg.base_1} AuxVars[] AssignedVars[thr2Thread1of2ForFork0_~arg.base, thr2Thread1of2ForFork0_~arg.offset] {17927#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:55,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {17927#(and (= ~x~0 0) (<= 1 ~n~0))} [285] L704-->L705: Formula: true InVars {} OutVars{thr2Thread1of2ForFork0_~t~0=v_thr2Thread1of2ForFork0_~t~0_1} AuxVars[] AssignedVars[thr2Thread1of2ForFork0_~t~0] {17927#(and (= ~x~0 0) (<= 1 ~n~0))} is VALID [2022-02-20 20:35:55,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {17927#(and (= ~x~0 0) (<= 1 ~n~0))} [286] L705-->L706: Formula: (= v_thr2Thread1of2ForFork0_~t~0_3 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{thr2Thread1of2ForFork0_~t~0=v_thr2Thread1of2ForFork0_~t~0_3, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[thr2Thread1of2ForFork0_~t~0] {17928#(and (<= 1 ~n~0) (= thr2Thread1of2ForFork0_~t~0 0))} is VALID [2022-02-20 20:35:55,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {17928#(and (<= 1 ~n~0) (= thr2Thread1of2ForFork0_~t~0 0))} [287] L706-->L707: Formula: (= v_~x~0_2 (+ v_thr2Thread1of2ForFork0_~t~0_5 1)) InVars {thr2Thread1of2ForFork0_~t~0=v_thr2Thread1of2ForFork0_~t~0_5} OutVars{thr2Thread1of2ForFork0_~t~0=v_thr2Thread1of2ForFork0_~t~0_5, ~x~0=v_~x~0_2} AuxVars[] AssignedVars[~x~0] {17929#(<= ~x~0 ~n~0)} is VALID [2022-02-20 20:35:55,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {17929#(<= ~x~0 ~n~0)} [292] L700-1-->L700-2: Formula: (= (ite (<= v_~x~0_3 v_~n~0_1) 1 0) |v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_1|) InVars {~n~0=v_~n~0_1, ~x~0=v_~x~0_3} OutVars{~n~0=v_~n~0_1, ~x~0=v_~x~0_3, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1] {17930#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:35:55,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {17930#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} [293] L700-2-->L688: Formula: true InVars {} OutVars{thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1] {17930#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:35:55,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {17930#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1| 0))} [294] L688-->L689: Formula: (= |v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_3| |v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_3|) InVars {thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_3|} OutVars{thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_3|, thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1] {17931#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:35:55,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {17931#(not (= |thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1| 0))} [295] L689-->L690: Formula: (= |v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_5| 0) InVars {thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_5|} OutVars{thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1=|v_thr1Thread1of2ForFork1___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {17924#false} is VALID [2022-02-20 20:35:55,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {17924#false} [297] L690-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17924#false} is VALID [2022-02-20 20:35:55,581 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:35:55,581 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:35:55,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564961191] [2022-02-20 20:35:55,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564961191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:35:55,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:35:55,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:35:55,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223212458] [2022-02-20 20:35:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:35:55,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 20:35:55,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:35:55,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:35:55,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:35:55,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:35:55,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:35:55,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:35:55,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:35:55,613 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 101 [2022-02-20 20:35:55,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 91 transitions, 262 flow. Second operand has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 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:35:55,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:35:55,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 101 [2022-02-20 20:35:55,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand