./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/test-easy6.wvr.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-easy6.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e29a676a5171b2e56cc2900cb5470509b7d8cacfca71c5e2d0aea36c369ff26e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:58:13,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:58:13,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:58:13,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:58:13,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:58:13,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:58:13,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:58:13,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:58:13,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:58:13,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:58:13,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:58:13,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:58:13,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:58:13,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:58:13,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:58:13,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:58:13,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:58:13,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:58:13,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:58:13,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:58:13,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:58:13,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:58:13,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:58:13,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:58:13,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:58:13,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:58:13,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:58:13,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:58:13,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:58:13,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:58:13,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:58:13,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:58:13,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:58:13,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:58:13,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:58:13,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:58:13,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:58:13,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:58:13,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:58:13,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:58:13,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:58:13,489 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:58:13,520 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:58:13,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:58:13,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:58:13,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:58:13,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:58:13,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:58:13,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:58:13,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:58:13,523 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:58:13,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:58:13,524 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:58:13,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:58:13,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:58:13,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:58:13,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:58:13,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:58:13,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:58:13,526 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:58:13,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:58:13,526 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:58:13,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:58:13,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:58:13,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:58:13,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:58:13,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:58:13,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:58:13,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:58:13,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:58:13,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:58:13,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:58:13,528 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:58:13,528 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:58:13,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:58:13,529 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 -> e29a676a5171b2e56cc2900cb5470509b7d8cacfca71c5e2d0aea36c369ff26e [2022-02-20 20:58:13,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:58:13,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:58:13,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:58:13,771 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:58:13,771 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:58:13,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy6.wvr.c [2022-02-20 20:58:13,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2f33e40/73ca4cc29c574627a25fd0e9ff7ae710/FLAGadd68da3a [2022-02-20 20:58:14,236 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:58:14,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy6.wvr.c [2022-02-20 20:58:14,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2f33e40/73ca4cc29c574627a25fd0e9ff7ae710/FLAGadd68da3a [2022-02-20 20:58:14,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da2f33e40/73ca4cc29c574627a25fd0e9ff7ae710 [2022-02-20 20:58:14,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:58:14,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:58:14,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:58:14,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:58:14,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:58:14,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:58:14" (1/1) ... [2022-02-20 20:58:14,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437e1b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14, skipping insertion in model container [2022-02-20 20:58:14,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:58:14" (1/1) ... [2022-02-20 20:58:14,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:58:14,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:58:14,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy6.wvr.c[3046,3059] [2022-02-20 20:58:14,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:58:14,460 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:58:14,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy6.wvr.c[3046,3059] [2022-02-20 20:58:14,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:58:14,493 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:58:14,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14 WrapperNode [2022-02-20 20:58:14,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:58:14,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:58:14,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:58:14,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:58:14,501 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:58:14" (1/1) ... [2022-02-20 20:58:14,506 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:58:14" (1/1) ... [2022-02-20 20:58:14,540 INFO L137 Inliner]: procedures = 21, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 123 [2022-02-20 20:58:14,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:58:14,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:58:14,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:58:14,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:58:14,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14" (1/1) ... [2022-02-20 20:58:14,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14" (1/1) ... [2022-02-20 20:58:14,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14" (1/1) ... [2022-02-20 20:58:14,563 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14" (1/1) ... [2022-02-20 20:58:14,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14" (1/1) ... [2022-02-20 20:58:14,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14" (1/1) ... [2022-02-20 20:58:14,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14" (1/1) ... [2022-02-20 20:58:14,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:58:14,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:58:14,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:58:14,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:58:14,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14" (1/1) ... [2022-02-20 20:58:14,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:58:14,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:58:14,611 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:58:14,636 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:58:14,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:58:14,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-20 20:58:14,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-20 20:58:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-20 20:58:14,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-20 20:58:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:58:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:58:14,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:58:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:58:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:58:14,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:58:14,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:58:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:58:14,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:58:14,661 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:58:14,747 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:58:14,749 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:58:14,971 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:58:15,044 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:58:15,044 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:58:15,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:58:15 BoogieIcfgContainer [2022-02-20 20:58:15,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:58:15,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:58:15,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:58:15,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:58:15,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:58:14" (1/3) ... [2022-02-20 20:58:15,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e901ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:58:15, skipping insertion in model container [2022-02-20 20:58:15,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:58:14" (2/3) ... [2022-02-20 20:58:15,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e901ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:58:15, skipping insertion in model container [2022-02-20 20:58:15,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:58:15" (3/3) ... [2022-02-20 20:58:15,058 INFO L111 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2022-02-20 20:58:15,063 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:58:15,063 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:58:15,064 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:58:15,064 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:58:15,121 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,122 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,135 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,136 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,144 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,145 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:58:15,159 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-20 20:58:15,202 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:58:15,209 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:58:15,209 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:58:15,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 83 transitions, 182 flow [2022-02-20 20:58:15,271 INFO L129 PetriNetUnfolder]: 1/81 cut-off events. [2022-02-20 20:58:15,271 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:58:15,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 1/81 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2022-02-20 20:58:15,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 83 transitions, 182 flow [2022-02-20 20:58:15,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 72 transitions, 156 flow [2022-02-20 20:58:15,300 INFO L129 PetriNetUnfolder]: 1/71 cut-off events. [2022-02-20 20:58:15,301 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:58:15,301 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:15,302 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:58:15,302 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:15,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1443793135, now seen corresponding path program 1 times [2022-02-20 20:58:15,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:15,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857585379] [2022-02-20 20:58:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:15,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#true} [213] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:58:15,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#true} [194] 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] {92#true} is VALID [2022-02-20 20:58:15,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#true} [222] 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[] {92#true} is VALID [2022-02-20 20:58:15,740 INFO L290 TraceCheckUtils]: 3: Hoare triple {92#true} [223] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:58:15,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {92#true} [189] L21-->L21-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[] {92#true} is VALID [2022-02-20 20:58:15,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {92#true} [208] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:58:15,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {92#true} [206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:58:15,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {92#true} [177] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:58:15,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {92#true} [231] L21-4-->L38: Formula: (= v_~e1~0_4 0) InVars {} OutVars{~e1~0=v_~e1~0_4} AuxVars[] AssignedVars[~e1~0] {92#true} is VALID [2022-02-20 20:58:15,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {92#true} [232] L38-->L39: Formula: (= v_~e2~0_4 0) InVars {} OutVars{~e2~0=v_~e2~0_4} AuxVars[] AssignedVars[~e2~0] {92#true} is VALID [2022-02-20 20:58:15,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {92#true} [209] L39-->L39-1: Formula: (= v_~n1~0_6 0) InVars {} OutVars{~n1~0=v_~n1~0_6} AuxVars[] AssignedVars[~n1~0] {92#true} is VALID [2022-02-20 20:58:15,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {92#true} [181] L39-1-->L39-2: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0] {92#true} is VALID [2022-02-20 20:58:15,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {92#true} [224] L39-2-->L39-3: Formula: (= v_~tmp1~0_3 0) InVars {} OutVars{~tmp1~0=v_~tmp1~0_3} AuxVars[] AssignedVars[~tmp1~0] {92#true} is VALID [2022-02-20 20:58:15,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {92#true} [212] L39-3-->L39-4: Formula: (= v_~tmp2~0_3 0) InVars {} OutVars{~tmp2~0=v_~tmp2~0_3} AuxVars[] AssignedVars[~tmp2~0] {92#true} is VALID [2022-02-20 20:58:15,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {92#true} [173] L39-4-->L39-5: Formula: (= v_~i~0_5 0) InVars {} OutVars{~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i~0] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {94#(= ~i~0 0)} [202] L39-5-->L39-6: Formula: (= v_~i1~0_3 0) InVars {} OutVars{~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[~i1~0] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {94#(= ~i~0 0)} [230] L39-6-->L-1-3: Formula: (= v_~i2~0_3 0) InVars {} OutVars{~i2~0=v_~i2~0_3} AuxVars[] AssignedVars[~i2~0] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {94#(= ~i~0 0)} [228] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {94#(= ~i~0 0)} [203] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {94#(= ~i~0 0)} [175] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {94#(= ~i~0 0)} [199] L-1-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_1|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet2#1, ULTIMATE.start_main_#t~pre1#1, ULTIMATE.start_main_#t~mem5#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {94#(= ~i~0 0)} [219] L107-->L107-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] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {94#(= ~i~0 0)} [215] L107-1-->L107-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] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {94#(= ~i~0 0)} [236] L107-2-->L110: Formula: (= |v_ULTIMATE.start_main_#t~pre1#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {94#(= ~i~0 0)} [161] L110-->L110-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {94#(= ~i~0 0)} [178] L110-1-->L110-2: 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~pre1#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_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_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {94#(= ~i~0 0)} [265] L110-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre1#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {94#(= ~i~0 0)} [168] L110-3-->L110-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {94#(= ~i~0 0)} [185] L110-4-->L111: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {94#(= ~i~0 0)} [179] L111-->L111-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {94#(= ~i~0 0)} [200] L111-1-->L111-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {94#(= ~i~0 0)} [190] L111-2-->L111-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~pre3#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {94#(= ~i~0 0)} [263] L111-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {94#(= ~i~0 0)} [251] thread2ENTRY-->L77: Formula: (= v_~e2~0_2 1) InVars {} OutVars{~e2~0=v_~e2~0_2} AuxVars[] AssignedVars[~e2~0] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,760 INFO L290 TraceCheckUtils]: 34: Hoare triple {94#(= ~i~0 0)} [252] L77-->L80: Formula: (= v_~tmp2~0_1 v_~n1~0_4) InVars {~n1~0=v_~n1~0_4} OutVars{~tmp2~0=v_~tmp2~0_1, ~n1~0=v_~n1~0_4} AuxVars[] AssignedVars[~tmp2~0] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,761 INFO L290 TraceCheckUtils]: 35: Hoare triple {94#(= ~i~0 0)} [253] L80-->L83: Formula: (= v_~n2~0_3 (+ v_~tmp2~0_2 1)) InVars {~tmp2~0=v_~tmp2~0_2} OutVars{~n2~0=v_~n2~0_3, ~tmp2~0=v_~tmp2~0_2} AuxVars[] AssignedVars[~n2~0] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,761 INFO L290 TraceCheckUtils]: 36: Hoare triple {94#(= ~i~0 0)} [254] L83-->L86: Formula: (= v_~e2~0_3 0) InVars {} OutVars{~e2~0=v_~e2~0_3} AuxVars[] AssignedVars[~e2~0] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {94#(= ~i~0 0)} [255] L86-->L89: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (ite (= (mod v_~e1~0_11 256) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~e1~0=v_~e1~0_11} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {94#(= ~i~0 0)} [256] L89-->L92: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (or (< v_~n2~0_19 v_~n1~0_19) (= v_~n1~0_19 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {94#(= ~i~0 0)} is VALID [2022-02-20 20:58:15,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {94#(= ~i~0 0)} [257] L92-->L95: Formula: (= v_~i2~0_1 v_~i~0_3) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] {95#(= ~i2~0 0)} is VALID [2022-02-20 20:58:15,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {95#(= ~i2~0 0)} [258] L95-->L98: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [259] L98-->L101: Formula: (= v_~n2~0_5 0) InVars {} OutVars{~n2~0=v_~n2~0_5} AuxVars[] AssignedVars[~n2~0] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,772 INFO L290 TraceCheckUtils]: 42: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [260] L101-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [261] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [162] L111-4-->L111-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [170] L111-5-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,785 INFO L290 TraceCheckUtils]: 46: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [214] L112-->L112-1: Formula: (= |v_ULTIMATE.start_main_#t~mem5#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [240] thread1ENTRY-->L45: Formula: (= v_~e1~0_1 1) InVars {} OutVars{~e1~0=v_~e1~0_1} AuxVars[] AssignedVars[~e1~0] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [241] L45-->L48: Formula: (= v_~tmp1~0_1 v_~n2~0_1) InVars {~n2~0=v_~n2~0_1} OutVars{~n2~0=v_~n2~0_1, ~tmp1~0=v_~tmp1~0_1} AuxVars[] AssignedVars[~tmp1~0] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [242] L48-->L51: Formula: (= v_~n1~0_1 (+ v_~tmp1~0_2 1)) InVars {~tmp1~0=v_~tmp1~0_2} OutVars{~n1~0=v_~n1~0_1, ~tmp1~0=v_~tmp1~0_2} AuxVars[] AssignedVars[~n1~0] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [243] L51-->L54: Formula: (= v_~e1~0_2 0) InVars {} OutVars{~e1~0=v_~e1~0_2} AuxVars[] AssignedVars[~e1~0] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,789 INFO L290 TraceCheckUtils]: 51: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [244] L54-->L57: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e2~0_11 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))) InVars {~e2~0=v_~e2~0_11} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~e2~0=v_~e2~0_11, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [245] L57-->L60: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (ite (or (<= v_~n1~0_15 v_~n2~0_15) (= v_~n2~0_15 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|)) InVars {~n2~0=v_~n2~0_15, ~n1~0=v_~n1~0_15} OutVars{~n2~0=v_~n2~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {96#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:15,790 INFO L290 TraceCheckUtils]: 53: Hoare triple {96#(and (<= 1 ~i~0) (<= ~i~0 1))} [246] L60-->L63: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] {97#(and (<= ~i1~0 1) (<= 1 ~i1~0))} is VALID [2022-02-20 20:58:15,791 INFO L290 TraceCheckUtils]: 54: Hoare triple {97#(and (<= ~i1~0 1) (<= 1 ~i1~0))} [247] L63-->L66: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] {98#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:15,792 INFO L290 TraceCheckUtils]: 55: Hoare triple {98#(and (<= ~i~0 2) (< 1 ~i~0))} [248] L66-->L69: Formula: (= v_~n1~0_3 0) InVars {} OutVars{~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[~n1~0] {98#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:15,792 INFO L290 TraceCheckUtils]: 56: Hoare triple {98#(and (<= ~i~0 2) (< 1 ~i~0))} [249] L69-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] {98#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:15,793 INFO L290 TraceCheckUtils]: 57: Hoare triple {98#(and (<= ~i~0 2) (< 1 ~i~0))} [250] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:15,793 INFO L290 TraceCheckUtils]: 58: Hoare triple {98#(and (<= ~i~0 2) (< 1 ~i~0))} [266] thread1EXIT-->L112-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem5#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) InVars {ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {98#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:15,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {98#(and (<= ~i~0 2) (< 1 ~i~0))} [220] L112-2-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {98#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:15,795 INFO L290 TraceCheckUtils]: 60: Hoare triple {98#(and (<= ~i~0 2) (< 1 ~i~0))} [201] L113-->L113-1: Formula: (= |v_ULTIMATE.start_main_#t~mem6#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {98#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:15,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {98#(and (<= ~i~0 2) (< 1 ~i~0))} [267] thread2EXIT-->L113-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem6#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[] {98#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:15,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {98#(and (<= ~i~0 2) (< 1 ~i~0))} [207] L113-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {98#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:15,797 INFO L290 TraceCheckUtils]: 63: Hoare triple {98#(and (<= ~i~0 2) (< 1 ~i~0))} [221] L115-->L115-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {98#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:15,797 INFO L290 TraceCheckUtils]: 64: Hoare triple {98#(and (<= ~i~0 2) (< 1 ~i~0))} [225] L115-1-->L115-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= 2 v_~i~0_6)) 1 0)) InVars {~i~0=v_~i~0_6} OutVars{~i~0=v_~i~0_6, 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] {99#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:15,798 INFO L290 TraceCheckUtils]: 65: Hoare triple {99#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [226] L115-2-->L34: 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] {99#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:15,798 INFO L290 TraceCheckUtils]: 66: Hoare triple {99#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [186] L34-->L35: 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] {100#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:15,799 INFO L290 TraceCheckUtils]: 67: Hoare triple {100#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [211] L35-->L34-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[] {93#false} is VALID [2022-02-20 20:58:15,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {93#false} [204] L34-1-->L116: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#false} is VALID [2022-02-20 20:58:15,802 INFO L290 TraceCheckUtils]: 69: Hoare triple {93#false} [187] L116-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#false} is VALID [2022-02-20 20:58:15,803 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:58:15,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:15,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857585379] [2022-02-20 20:58:15,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857585379] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:15,807 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:15,807 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:58:15,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098765656] [2022-02-20 20:58:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:15,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2022-02-20 20:58:15,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:15,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:58:15,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:15,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:58:15,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:15,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:58:15,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:58:15,936 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 83 [2022-02-20 20:58:15,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 156 flow. Second operand has 9 states, 9 states have (on average 63.111111111111114) internal successors, (568), 9 states have internal predecessors, (568), 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:58:15,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:15,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 83 [2022-02-20 20:58:15,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:16,452 INFO L129 PetriNetUnfolder]: 22/202 cut-off events. [2022-02-20 20:58:16,452 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-02-20 20:58:16,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 202 events. 22/202 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 717 event pairs, 12 based on Foata normal form. 4/201 useless extension candidates. Maximal degree in co-relation 186. Up to 33 conditions per place. [2022-02-20 20:58:16,455 INFO L132 encePairwiseOnDemand]: 72/83 looper letters, 31 selfloop transitions, 7 changer transitions 13/102 dead transitions. [2022-02-20 20:58:16,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 102 transitions, 339 flow [2022-02-20 20:58:16,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 20:58:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-02-20 20:58:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 849 transitions. [2022-02-20 20:58:16,482 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7868396663577386 [2022-02-20 20:58:16,482 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 849 transitions. [2022-02-20 20:58:16,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 849 transitions. [2022-02-20 20:58:16,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:16,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 849 transitions. [2022-02-20 20:58:16,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 65.3076923076923) internal successors, (849), 13 states have internal predecessors, (849), 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:58:16,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 83.0) internal successors, (1162), 14 states have internal predecessors, (1162), 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:58:16,500 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 83.0) internal successors, (1162), 14 states have internal predecessors, (1162), 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:58:16,502 INFO L186 Difference]: Start difference. First operand has 78 places, 72 transitions, 156 flow. Second operand 13 states and 849 transitions. [2022-02-20 20:58:16,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 102 transitions, 339 flow [2022-02-20 20:58:16,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 102 transitions, 317 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:58:16,510 INFO L242 Difference]: Finished difference. Result has 91 places, 74 transitions, 185 flow [2022-02-20 20:58:16,511 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=185, PETRI_PLACES=91, PETRI_TRANSITIONS=74} [2022-02-20 20:58:16,514 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2022-02-20 20:58:16,515 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 74 transitions, 185 flow [2022-02-20 20:58:16,553 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 909 states, 905 states have (on average 2.3303867403314915) internal successors, (2109), 908 states have internal predecessors, (2109), 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:58:16,557 INFO L78 Accepts]: Start accepts. Automaton has has 909 states, 905 states have (on average 2.3303867403314915) internal successors, (2109), 908 states have internal predecessors, (2109), 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 70 [2022-02-20 20:58:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:16,557 INFO L470 AbstractCegarLoop]: Abstraction has has 91 places, 74 transitions, 185 flow [2022-02-20 20:58:16,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.111111111111114) internal successors, (568), 9 states have internal predecessors, (568), 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:58:16,558 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:16,558 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:58:16,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:58:16,559 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash 187280513, now seen corresponding path program 2 times [2022-02-20 20:58:16,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:16,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608032609] [2022-02-20 20:58:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:16,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:16,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {1033#true} [213] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1033#true} is VALID [2022-02-20 20:58:16,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} [194] 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] {1033#true} is VALID [2022-02-20 20:58:16,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} [222] 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[] {1033#true} is VALID [2022-02-20 20:58:16,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {1033#true} [223] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {1033#true} is VALID [2022-02-20 20:58:16,738 INFO L290 TraceCheckUtils]: 4: Hoare triple {1033#true} [189] L21-->L21-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[] {1033#true} is VALID [2022-02-20 20:58:16,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} [208] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {1033#true} is VALID [2022-02-20 20:58:16,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {1033#true} [206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {1033#true} is VALID [2022-02-20 20:58:16,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {1033#true} [177] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {1033#true} is VALID [2022-02-20 20:58:16,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {1033#true} [231] L21-4-->L38: Formula: (= v_~e1~0_4 0) InVars {} OutVars{~e1~0=v_~e1~0_4} AuxVars[] AssignedVars[~e1~0] {1033#true} is VALID [2022-02-20 20:58:16,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#true} [232] L38-->L39: Formula: (= v_~e2~0_4 0) InVars {} OutVars{~e2~0=v_~e2~0_4} AuxVars[] AssignedVars[~e2~0] {1033#true} is VALID [2022-02-20 20:58:16,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {1033#true} [209] L39-->L39-1: Formula: (= v_~n1~0_6 0) InVars {} OutVars{~n1~0=v_~n1~0_6} AuxVars[] AssignedVars[~n1~0] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {1035#(= ~n1~0 0)} [181] L39-1-->L39-2: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {1035#(= ~n1~0 0)} [224] L39-2-->L39-3: Formula: (= v_~tmp1~0_3 0) InVars {} OutVars{~tmp1~0=v_~tmp1~0_3} AuxVars[] AssignedVars[~tmp1~0] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {1035#(= ~n1~0 0)} [212] L39-3-->L39-4: Formula: (= v_~tmp2~0_3 0) InVars {} OutVars{~tmp2~0=v_~tmp2~0_3} AuxVars[] AssignedVars[~tmp2~0] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {1035#(= ~n1~0 0)} [173] L39-4-->L39-5: Formula: (= v_~i~0_5 0) InVars {} OutVars{~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i~0] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {1035#(= ~n1~0 0)} [202] L39-5-->L39-6: Formula: (= v_~i1~0_3 0) InVars {} OutVars{~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[~i1~0] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {1035#(= ~n1~0 0)} [230] L39-6-->L-1-3: Formula: (= v_~i2~0_3 0) InVars {} OutVars{~i2~0=v_~i2~0_3} AuxVars[] AssignedVars[~i2~0] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {1035#(= ~n1~0 0)} [228] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {1035#(= ~n1~0 0)} [203] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {1035#(= ~n1~0 0)} [175] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {1035#(= ~n1~0 0)} [199] L-1-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_1|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet2#1, ULTIMATE.start_main_#t~pre1#1, ULTIMATE.start_main_#t~mem5#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {1035#(= ~n1~0 0)} [219] L107-->L107-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] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {1035#(= ~n1~0 0)} [215] L107-1-->L107-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] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {1035#(= ~n1~0 0)} [236] L107-2-->L110: Formula: (= |v_ULTIMATE.start_main_#t~pre1#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {1035#(= ~n1~0 0)} [161] L110-->L110-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {1035#(= ~n1~0 0)} [178] L110-1-->L110-2: 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~pre1#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_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_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {1035#(= ~n1~0 0)} [265] L110-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre1#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {1035#(= ~n1~0 0)} [168] L110-3-->L110-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,754 INFO L290 TraceCheckUtils]: 28: Hoare triple {1035#(= ~n1~0 0)} [185] L110-4-->L111: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {1035#(= ~n1~0 0)} [179] L111-->L111-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {1035#(= ~n1~0 0)} [200] L111-1-->L111-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {1035#(= ~n1~0 0)} [190] L111-2-->L111-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~pre3#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {1035#(= ~n1~0 0)} [263] L111-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {1035#(= ~n1~0 0)} [251] thread2ENTRY-->L77: Formula: (= v_~e2~0_2 1) InVars {} OutVars{~e2~0=v_~e2~0_2} AuxVars[] AssignedVars[~e2~0] {1035#(= ~n1~0 0)} is VALID [2022-02-20 20:58:16,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {1035#(= ~n1~0 0)} [252] L77-->L80: Formula: (= v_~tmp2~0_1 v_~n1~0_4) InVars {~n1~0=v_~n1~0_4} OutVars{~tmp2~0=v_~tmp2~0_1, ~n1~0=v_~n1~0_4} AuxVars[] AssignedVars[~tmp2~0] {1036#(= ~tmp2~0 0)} is VALID [2022-02-20 20:58:16,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {1036#(= ~tmp2~0 0)} [253] L80-->L83: Formula: (= v_~n2~0_3 (+ v_~tmp2~0_2 1)) InVars {~tmp2~0=v_~tmp2~0_2} OutVars{~n2~0=v_~n2~0_3, ~tmp2~0=v_~tmp2~0_2} AuxVars[] AssignedVars[~n2~0] {1037#(<= 1 ~n2~0)} is VALID [2022-02-20 20:58:16,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {1037#(<= 1 ~n2~0)} [254] L83-->L86: Formula: (= v_~e2~0_3 0) InVars {} OutVars{~e2~0=v_~e2~0_3} AuxVars[] AssignedVars[~e2~0] {1037#(<= 1 ~n2~0)} is VALID [2022-02-20 20:58:16,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {1037#(<= 1 ~n2~0)} [255] L86-->L89: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (ite (= (mod v_~e1~0_11 256) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~e1~0=v_~e1~0_11} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {1037#(<= 1 ~n2~0)} is VALID [2022-02-20 20:58:16,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {1037#(<= 1 ~n2~0)} [240] thread1ENTRY-->L45: Formula: (= v_~e1~0_1 1) InVars {} OutVars{~e1~0=v_~e1~0_1} AuxVars[] AssignedVars[~e1~0] {1037#(<= 1 ~n2~0)} is VALID [2022-02-20 20:58:16,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {1037#(<= 1 ~n2~0)} [241] L45-->L48: Formula: (= v_~tmp1~0_1 v_~n2~0_1) InVars {~n2~0=v_~n2~0_1} OutVars{~n2~0=v_~n2~0_1, ~tmp1~0=v_~tmp1~0_1} AuxVars[] AssignedVars[~tmp1~0] {1038#(and (<= 1 ~n2~0) (<= ~n2~0 ~tmp1~0))} is VALID [2022-02-20 20:58:16,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {1038#(and (<= 1 ~n2~0) (<= ~n2~0 ~tmp1~0))} [242] L48-->L51: Formula: (= v_~n1~0_1 (+ v_~tmp1~0_2 1)) InVars {~tmp1~0=v_~tmp1~0_2} OutVars{~n1~0=v_~n1~0_1, ~tmp1~0=v_~tmp1~0_2} AuxVars[] AssignedVars[~n1~0] {1039#(and (not (<= ~n1~0 ~n2~0)) (not (= ~n2~0 0)))} is VALID [2022-02-20 20:58:16,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {1039#(and (not (<= ~n1~0 ~n2~0)) (not (= ~n2~0 0)))} [243] L51-->L54: Formula: (= v_~e1~0_2 0) InVars {} OutVars{~e1~0=v_~e1~0_2} AuxVars[] AssignedVars[~e1~0] {1039#(and (not (<= ~n1~0 ~n2~0)) (not (= ~n2~0 0)))} is VALID [2022-02-20 20:58:16,767 INFO L290 TraceCheckUtils]: 42: Hoare triple {1039#(and (not (<= ~n1~0 ~n2~0)) (not (= ~n2~0 0)))} [244] L54-->L57: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e2~0_11 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))) InVars {~e2~0=v_~e2~0_11} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~e2~0=v_~e2~0_11, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {1039#(and (not (<= ~n1~0 ~n2~0)) (not (= ~n2~0 0)))} is VALID [2022-02-20 20:58:16,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {1039#(and (not (<= ~n1~0 ~n2~0)) (not (= ~n2~0 0)))} [245] L57-->L60: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (ite (or (<= v_~n1~0_15 v_~n2~0_15) (= v_~n2~0_15 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|)) InVars {~n2~0=v_~n2~0_15, ~n1~0=v_~n1~0_15} OutVars{~n2~0=v_~n2~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {1034#false} is VALID [2022-02-20 20:58:16,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {1034#false} [246] L60-->L63: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] {1034#false} is VALID [2022-02-20 20:58:16,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {1034#false} [256] L89-->L92: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (or (< v_~n2~0_19 v_~n1~0_19) (= v_~n1~0_19 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {1034#false} is VALID [2022-02-20 20:58:16,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {1034#false} [257] L92-->L95: Formula: (= v_~i2~0_1 v_~i~0_3) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] {1034#false} is VALID [2022-02-20 20:58:16,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {1034#false} [162] L111-4-->L111-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {1034#false} is VALID [2022-02-20 20:58:16,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {1034#false} [170] L111-5-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {1034#false} is VALID [2022-02-20 20:58:16,786 INFO L290 TraceCheckUtils]: 49: Hoare triple {1034#false} [214] L112-->L112-1: Formula: (= |v_ULTIMATE.start_main_#t~mem5#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {1034#false} is VALID [2022-02-20 20:58:16,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {1034#false} [247] L63-->L66: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] {1034#false} is VALID [2022-02-20 20:58:16,787 INFO L290 TraceCheckUtils]: 51: Hoare triple {1034#false} [248] L66-->L69: Formula: (= v_~n1~0_3 0) InVars {} OutVars{~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[~n1~0] {1034#false} is VALID [2022-02-20 20:58:16,787 INFO L290 TraceCheckUtils]: 52: Hoare triple {1034#false} [249] L69-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] {1034#false} is VALID [2022-02-20 20:58:16,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {1034#false} [250] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#false} is VALID [2022-02-20 20:58:16,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {1034#false} [266] thread1EXIT-->L112-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem5#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) InVars {ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {1034#false} is VALID [2022-02-20 20:58:16,788 INFO L290 TraceCheckUtils]: 55: Hoare triple {1034#false} [258] L95-->L98: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] {1034#false} is VALID [2022-02-20 20:58:16,788 INFO L290 TraceCheckUtils]: 56: Hoare triple {1034#false} [259] L98-->L101: Formula: (= v_~n2~0_5 0) InVars {} OutVars{~n2~0=v_~n2~0_5} AuxVars[] AssignedVars[~n2~0] {1034#false} is VALID [2022-02-20 20:58:16,788 INFO L290 TraceCheckUtils]: 57: Hoare triple {1034#false} [260] L101-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {1034#false} is VALID [2022-02-20 20:58:16,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {1034#false} [261] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#false} is VALID [2022-02-20 20:58:16,788 INFO L290 TraceCheckUtils]: 59: Hoare triple {1034#false} [220] L112-2-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {1034#false} is VALID [2022-02-20 20:58:16,789 INFO L290 TraceCheckUtils]: 60: Hoare triple {1034#false} [201] L113-->L113-1: Formula: (= |v_ULTIMATE.start_main_#t~mem6#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {1034#false} is VALID [2022-02-20 20:58:16,789 INFO L290 TraceCheckUtils]: 61: Hoare triple {1034#false} [267] thread2EXIT-->L113-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem6#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[] {1034#false} is VALID [2022-02-20 20:58:16,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {1034#false} [207] L113-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {1034#false} is VALID [2022-02-20 20:58:16,789 INFO L290 TraceCheckUtils]: 63: Hoare triple {1034#false} [221] L115-->L115-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#false} is VALID [2022-02-20 20:58:16,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {1034#false} [225] L115-1-->L115-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= 2 v_~i~0_6)) 1 0)) InVars {~i~0=v_~i~0_6} OutVars{~i~0=v_~i~0_6, 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] {1034#false} is VALID [2022-02-20 20:58:16,790 INFO L290 TraceCheckUtils]: 65: Hoare triple {1034#false} [226] L115-2-->L34: 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] {1034#false} is VALID [2022-02-20 20:58:16,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {1034#false} [186] L34-->L35: 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] {1034#false} is VALID [2022-02-20 20:58:16,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {1034#false} [211] L35-->L34-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[] {1034#false} is VALID [2022-02-20 20:58:16,790 INFO L290 TraceCheckUtils]: 68: Hoare triple {1034#false} [204] L34-1-->L116: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#false} is VALID [2022-02-20 20:58:16,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {1034#false} [187] L116-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1034#false} is VALID [2022-02-20 20:58:16,791 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:58:16,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:16,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608032609] [2022-02-20 20:58:16,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608032609] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:16,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:16,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:58:16,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948854143] [2022-02-20 20:58:16,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:16,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 70 [2022-02-20 20:58:16,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:16,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:58:16,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:16,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:58:16,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:16,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:58:16,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:58:16,852 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 83 [2022-02-20 20:58:16,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 74 transitions, 185 flow. Second operand has 7 states, 7 states have (on average 65.57142857142857) internal successors, (459), 7 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:16,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:16,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 83 [2022-02-20 20:58:16,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:17,209 INFO L129 PetriNetUnfolder]: 64/401 cut-off events. [2022-02-20 20:58:17,209 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-02-20 20:58:17,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 401 events. 64/401 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2117 event pairs, 7 based on Foata normal form. 3/399 useless extension candidates. Maximal degree in co-relation 628. Up to 36 conditions per place. [2022-02-20 20:58:17,212 INFO L132 encePairwiseOnDemand]: 74/83 looper letters, 30 selfloop transitions, 12 changer transitions 9/107 dead transitions. [2022-02-20 20:58:17,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 357 flow [2022-02-20 20:58:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:58:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:58:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 619 transitions. [2022-02-20 20:58:17,220 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8286479250334672 [2022-02-20 20:58:17,220 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 619 transitions. [2022-02-20 20:58:17,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 619 transitions. [2022-02-20 20:58:17,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:17,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 619 transitions. [2022-02-20 20:58:17,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 68.77777777777777) internal successors, (619), 9 states have internal predecessors, (619), 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:58:17,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 83.0) internal successors, (830), 10 states have internal predecessors, (830), 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:58:17,225 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 83.0) internal successors, (830), 10 states have internal predecessors, (830), 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:58:17,225 INFO L186 Difference]: Start difference. First operand has 91 places, 74 transitions, 185 flow. Second operand 9 states and 619 transitions. [2022-02-20 20:58:17,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 357 flow [2022-02-20 20:58:22,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 107 transitions, 349 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-02-20 20:58:22,763 INFO L242 Difference]: Finished difference. Result has 93 places, 82 transitions, 253 flow [2022-02-20 20:58:22,763 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=253, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2022-02-20 20:58:22,764 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, 15 predicate places. [2022-02-20 20:58:22,764 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 82 transitions, 253 flow [2022-02-20 20:58:22,807 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1497 states, 1489 states have (on average 2.312290127602418) internal successors, (3443), 1496 states have internal predecessors, (3443), 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:58:22,810 INFO L78 Accepts]: Start accepts. Automaton has has 1497 states, 1489 states have (on average 2.312290127602418) internal successors, (3443), 1496 states have internal predecessors, (3443), 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 70 [2022-02-20 20:58:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:22,811 INFO L470 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 253 flow [2022-02-20 20:58:22,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 65.57142857142857) internal successors, (459), 7 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:22,812 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:22,812 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:58:22,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:58:22,812 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash 230641, now seen corresponding path program 3 times [2022-02-20 20:58:22,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:22,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308987818] [2022-02-20 20:58:22,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:22,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {2555#true} [213] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2555#true} is VALID [2022-02-20 20:58:22,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {2555#true} [194] 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] {2555#true} is VALID [2022-02-20 20:58:22,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {2555#true} [222] 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[] {2555#true} is VALID [2022-02-20 20:58:22,959 INFO L290 TraceCheckUtils]: 3: Hoare triple {2555#true} [223] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {2555#true} is VALID [2022-02-20 20:58:22,959 INFO L290 TraceCheckUtils]: 4: Hoare triple {2555#true} [189] L21-->L21-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[] {2555#true} is VALID [2022-02-20 20:58:22,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {2555#true} [208] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {2555#true} is VALID [2022-02-20 20:58:22,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {2555#true} [206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {2555#true} is VALID [2022-02-20 20:58:22,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {2555#true} [177] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {2555#true} is VALID [2022-02-20 20:58:22,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {2555#true} [231] L21-4-->L38: Formula: (= v_~e1~0_4 0) InVars {} OutVars{~e1~0=v_~e1~0_4} AuxVars[] AssignedVars[~e1~0] {2555#true} is VALID [2022-02-20 20:58:22,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {2555#true} [232] L38-->L39: Formula: (= v_~e2~0_4 0) InVars {} OutVars{~e2~0=v_~e2~0_4} AuxVars[] AssignedVars[~e2~0] {2555#true} is VALID [2022-02-20 20:58:22,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {2555#true} [209] L39-->L39-1: Formula: (= v_~n1~0_6 0) InVars {} OutVars{~n1~0=v_~n1~0_6} AuxVars[] AssignedVars[~n1~0] {2555#true} is VALID [2022-02-20 20:58:22,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {2555#true} [181] L39-1-->L39-2: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0] {2555#true} is VALID [2022-02-20 20:58:22,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {2555#true} [224] L39-2-->L39-3: Formula: (= v_~tmp1~0_3 0) InVars {} OutVars{~tmp1~0=v_~tmp1~0_3} AuxVars[] AssignedVars[~tmp1~0] {2555#true} is VALID [2022-02-20 20:58:22,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {2555#true} [212] L39-3-->L39-4: Formula: (= v_~tmp2~0_3 0) InVars {} OutVars{~tmp2~0=v_~tmp2~0_3} AuxVars[] AssignedVars[~tmp2~0] {2555#true} is VALID [2022-02-20 20:58:22,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {2555#true} [173] L39-4-->L39-5: Formula: (= v_~i~0_5 0) InVars {} OutVars{~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i~0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {2557#(= ~i~0 0)} [202] L39-5-->L39-6: Formula: (= v_~i1~0_3 0) InVars {} OutVars{~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[~i1~0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {2557#(= ~i~0 0)} [230] L39-6-->L-1-3: Formula: (= v_~i2~0_3 0) InVars {} OutVars{~i2~0=v_~i2~0_3} AuxVars[] AssignedVars[~i2~0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {2557#(= ~i~0 0)} [228] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {2557#(= ~i~0 0)} [203] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {2557#(= ~i~0 0)} [175] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {2557#(= ~i~0 0)} [199] L-1-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_1|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet2#1, ULTIMATE.start_main_#t~pre1#1, ULTIMATE.start_main_#t~mem5#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {2557#(= ~i~0 0)} [219] L107-->L107-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] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {2557#(= ~i~0 0)} [215] L107-1-->L107-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] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {2557#(= ~i~0 0)} [236] L107-2-->L110: Formula: (= |v_ULTIMATE.start_main_#t~pre1#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {2557#(= ~i~0 0)} [161] L110-->L110-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {2557#(= ~i~0 0)} [178] L110-1-->L110-2: 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~pre1#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_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_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {2557#(= ~i~0 0)} [265] L110-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre1#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {2557#(= ~i~0 0)} [168] L110-3-->L110-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {2557#(= ~i~0 0)} [185] L110-4-->L111: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,968 INFO L290 TraceCheckUtils]: 29: Hoare triple {2557#(= ~i~0 0)} [179] L111-->L111-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {2557#(= ~i~0 0)} [200] L111-1-->L111-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {2557#(= ~i~0 0)} [190] L111-2-->L111-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~pre3#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {2557#(= ~i~0 0)} [263] L111-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {2557#(= ~i~0 0)} [162] L111-4-->L111-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {2557#(= ~i~0 0)} [170] L111-5-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {2557#(= ~i~0 0)} [214] L112-->L112-1: Formula: (= |v_ULTIMATE.start_main_#t~mem5#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {2557#(= ~i~0 0)} [251] thread2ENTRY-->L77: Formula: (= v_~e2~0_2 1) InVars {} OutVars{~e2~0=v_~e2~0_2} AuxVars[] AssignedVars[~e2~0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {2557#(= ~i~0 0)} [252] L77-->L80: Formula: (= v_~tmp2~0_1 v_~n1~0_4) InVars {~n1~0=v_~n1~0_4} OutVars{~tmp2~0=v_~tmp2~0_1, ~n1~0=v_~n1~0_4} AuxVars[] AssignedVars[~tmp2~0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {2557#(= ~i~0 0)} [240] thread1ENTRY-->L45: Formula: (= v_~e1~0_1 1) InVars {} OutVars{~e1~0=v_~e1~0_1} AuxVars[] AssignedVars[~e1~0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {2557#(= ~i~0 0)} [241] L45-->L48: Formula: (= v_~tmp1~0_1 v_~n2~0_1) InVars {~n2~0=v_~n2~0_1} OutVars{~n2~0=v_~n2~0_1, ~tmp1~0=v_~tmp1~0_1} AuxVars[] AssignedVars[~tmp1~0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {2557#(= ~i~0 0)} [242] L48-->L51: Formula: (= v_~n1~0_1 (+ v_~tmp1~0_2 1)) InVars {~tmp1~0=v_~tmp1~0_2} OutVars{~n1~0=v_~n1~0_1, ~tmp1~0=v_~tmp1~0_2} AuxVars[] AssignedVars[~n1~0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {2557#(= ~i~0 0)} [243] L51-->L54: Formula: (= v_~e1~0_2 0) InVars {} OutVars{~e1~0=v_~e1~0_2} AuxVars[] AssignedVars[~e1~0] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {2557#(= ~i~0 0)} [244] L54-->L57: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e2~0_11 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))) InVars {~e2~0=v_~e2~0_11} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~e2~0=v_~e2~0_11, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {2557#(= ~i~0 0)} [245] L57-->L60: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (ite (or (<= v_~n1~0_15 v_~n2~0_15) (= v_~n2~0_15 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|)) InVars {~n2~0=v_~n2~0_15, ~n1~0=v_~n1~0_15} OutVars{~n2~0=v_~n2~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {2557#(= ~i~0 0)} is VALID [2022-02-20 20:58:22,974 INFO L290 TraceCheckUtils]: 44: Hoare triple {2557#(= ~i~0 0)} [246] L60-->L63: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] {2558#(= ~i1~0 0)} is VALID [2022-02-20 20:58:22,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {2558#(= ~i1~0 0)} [247] L63-->L66: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [248] L66-->L69: Formula: (= v_~n1~0_3 0) InVars {} OutVars{~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[~n1~0] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [249] L69-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [250] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [266] thread1EXIT-->L112-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem5#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) InVars {ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [220] L112-2-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [201] L113-->L113-1: Formula: (= |v_ULTIMATE.start_main_#t~mem6#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,979 INFO L290 TraceCheckUtils]: 52: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [253] L80-->L83: Formula: (= v_~n2~0_3 (+ v_~tmp2~0_2 1)) InVars {~tmp2~0=v_~tmp2~0_2} OutVars{~n2~0=v_~n2~0_3, ~tmp2~0=v_~tmp2~0_2} AuxVars[] AssignedVars[~n2~0] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [254] L83-->L86: Formula: (= v_~e2~0_3 0) InVars {} OutVars{~e2~0=v_~e2~0_3} AuxVars[] AssignedVars[~e2~0] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [255] L86-->L89: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (ite (= (mod v_~e1~0_11 256) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~e1~0=v_~e1~0_11} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [256] L89-->L92: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (or (< v_~n2~0_19 v_~n1~0_19) (= v_~n1~0_19 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} is VALID [2022-02-20 20:58:22,982 INFO L290 TraceCheckUtils]: 56: Hoare triple {2559#(and (<= 1 ~i~0) (<= ~i~0 1))} [257] L92-->L95: Formula: (= v_~i2~0_1 v_~i~0_3) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] {2560#(and (<= ~i2~0 1) (<= 1 ~i2~0))} is VALID [2022-02-20 20:58:22,983 INFO L290 TraceCheckUtils]: 57: Hoare triple {2560#(and (<= ~i2~0 1) (<= 1 ~i2~0))} [258] L95-->L98: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] {2561#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:22,983 INFO L290 TraceCheckUtils]: 58: Hoare triple {2561#(and (<= ~i~0 2) (< 1 ~i~0))} [259] L98-->L101: Formula: (= v_~n2~0_5 0) InVars {} OutVars{~n2~0=v_~n2~0_5} AuxVars[] AssignedVars[~n2~0] {2561#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:22,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {2561#(and (<= ~i~0 2) (< 1 ~i~0))} [260] L101-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {2561#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:22,984 INFO L290 TraceCheckUtils]: 60: Hoare triple {2561#(and (<= ~i~0 2) (< 1 ~i~0))} [261] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2561#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:22,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {2561#(and (<= ~i~0 2) (< 1 ~i~0))} [267] thread2EXIT-->L113-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem6#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[] {2561#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:22,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {2561#(and (<= ~i~0 2) (< 1 ~i~0))} [207] L113-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {2561#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:22,985 INFO L290 TraceCheckUtils]: 63: Hoare triple {2561#(and (<= ~i~0 2) (< 1 ~i~0))} [221] L115-->L115-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2561#(and (<= ~i~0 2) (< 1 ~i~0))} is VALID [2022-02-20 20:58:22,989 INFO L290 TraceCheckUtils]: 64: Hoare triple {2561#(and (<= ~i~0 2) (< 1 ~i~0))} [225] L115-1-->L115-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= 2 v_~i~0_6)) 1 0)) InVars {~i~0=v_~i~0_6} OutVars{~i~0=v_~i~0_6, 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] {2562#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:22,989 INFO L290 TraceCheckUtils]: 65: Hoare triple {2562#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [226] L115-2-->L34: 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] {2562#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:58:22,990 INFO L290 TraceCheckUtils]: 66: Hoare triple {2562#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [186] L34-->L35: 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] {2563#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:58:22,990 INFO L290 TraceCheckUtils]: 67: Hoare triple {2563#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [211] L35-->L34-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[] {2556#false} is VALID [2022-02-20 20:58:22,990 INFO L290 TraceCheckUtils]: 68: Hoare triple {2556#false} [204] L34-1-->L116: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2556#false} is VALID [2022-02-20 20:58:22,991 INFO L290 TraceCheckUtils]: 69: Hoare triple {2556#false} [187] L116-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2556#false} is VALID [2022-02-20 20:58:22,992 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:58:22,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:22,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308987818] [2022-02-20 20:58:22,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308987818] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:22,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:22,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 20:58:22,994 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466256780] [2022-02-20 20:58:22,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:22,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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 70 [2022-02-20 20:58:22,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:22,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:58:23,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:23,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 20:58:23,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:23,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 20:58:23,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-02-20 20:58:23,045 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 83 [2022-02-20 20:58:23,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 253 flow. Second operand has 9 states, 9 states have (on average 63.111111111111114) internal successors, (568), 9 states have internal predecessors, (568), 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:58:23,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:23,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 83 [2022-02-20 20:58:23,046 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:23,391 INFO L129 PetriNetUnfolder]: 53/356 cut-off events. [2022-02-20 20:58:23,391 INFO L130 PetriNetUnfolder]: For 156/158 co-relation queries the response was YES. [2022-02-20 20:58:23,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 356 events. 53/356 cut-off events. For 156/158 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1844 event pairs, 25 based on Foata normal form. 3/353 useless extension candidates. Maximal degree in co-relation 618. Up to 64 conditions per place. [2022-02-20 20:58:23,395 INFO L132 encePairwiseOnDemand]: 75/83 looper letters, 21 selfloop transitions, 6 changer transitions 13/99 dead transitions. [2022-02-20 20:58:23,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 99 transitions, 375 flow [2022-02-20 20:58:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:58:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-02-20 20:58:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 651 transitions. [2022-02-20 20:58:23,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7843373493975904 [2022-02-20 20:58:23,402 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 651 transitions. [2022-02-20 20:58:23,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 651 transitions. [2022-02-20 20:58:23,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:23,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 651 transitions. [2022-02-20 20:58:23,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 65.1) internal successors, (651), 10 states have internal predecessors, (651), 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:58:23,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 83.0) internal successors, (913), 11 states have internal predecessors, (913), 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:58:23,407 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 83.0) internal successors, (913), 11 states have internal predecessors, (913), 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:58:23,407 INFO L186 Difference]: Start difference. First operand has 93 places, 82 transitions, 253 flow. Second operand 10 states and 651 transitions. [2022-02-20 20:58:23,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 99 transitions, 375 flow [2022-02-20 20:58:23,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 99 transitions, 370 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-02-20 20:58:23,967 INFO L242 Difference]: Finished difference. Result has 101 places, 80 transitions, 257 flow [2022-02-20 20:58:23,967 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=257, PETRI_PLACES=101, PETRI_TRANSITIONS=80} [2022-02-20 20:58:23,968 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2022-02-20 20:58:23,968 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 101 places, 80 transitions, 257 flow [2022-02-20 20:58:24,010 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1289 states, 1281 states have (on average 2.3145979703356754) internal successors, (2965), 1288 states have internal predecessors, (2965), 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:58:24,012 INFO L78 Accepts]: Start accepts. Automaton has has 1289 states, 1281 states have (on average 2.3145979703356754) internal successors, (2965), 1288 states have internal predecessors, (2965), 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 70 [2022-02-20 20:58:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:24,013 INFO L470 AbstractCegarLoop]: Abstraction has has 101 places, 80 transitions, 257 flow [2022-02-20 20:58:24,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.111111111111114) internal successors, (568), 9 states have internal predecessors, (568), 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:58:24,014 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:24,014 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:58:24,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:58:24,014 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:24,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:24,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2040335589, now seen corresponding path program 4 times [2022-02-20 20:58:24,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:24,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219955421] [2022-02-20 20:58:24,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:24,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:24,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {3870#true} [213] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3870#true} is VALID [2022-02-20 20:58:24,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {3870#true} [194] 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] {3870#true} is VALID [2022-02-20 20:58:24,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {3870#true} [222] 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[] {3870#true} is VALID [2022-02-20 20:58:24,101 INFO L290 TraceCheckUtils]: 3: Hoare triple {3870#true} [223] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {3870#true} is VALID [2022-02-20 20:58:24,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {3870#true} [189] L21-->L21-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[] {3870#true} is VALID [2022-02-20 20:58:24,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {3870#true} [208] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {3870#true} is VALID [2022-02-20 20:58:24,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {3870#true} [206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {3870#true} is VALID [2022-02-20 20:58:24,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {3870#true} [177] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {3870#true} is VALID [2022-02-20 20:58:24,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {3870#true} [231] L21-4-->L38: Formula: (= v_~e1~0_4 0) InVars {} OutVars{~e1~0=v_~e1~0_4} AuxVars[] AssignedVars[~e1~0] {3870#true} is VALID [2022-02-20 20:58:24,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {3870#true} [232] L38-->L39: Formula: (= v_~e2~0_4 0) InVars {} OutVars{~e2~0=v_~e2~0_4} AuxVars[] AssignedVars[~e2~0] {3870#true} is VALID [2022-02-20 20:58:24,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {3870#true} [209] L39-->L39-1: Formula: (= v_~n1~0_6 0) InVars {} OutVars{~n1~0=v_~n1~0_6} AuxVars[] AssignedVars[~n1~0] {3870#true} is VALID [2022-02-20 20:58:24,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {3870#true} [181] L39-1-->L39-2: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0] {3870#true} is VALID [2022-02-20 20:58:24,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {3870#true} [224] L39-2-->L39-3: Formula: (= v_~tmp1~0_3 0) InVars {} OutVars{~tmp1~0=v_~tmp1~0_3} AuxVars[] AssignedVars[~tmp1~0] {3870#true} is VALID [2022-02-20 20:58:24,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {3870#true} [212] L39-3-->L39-4: Formula: (= v_~tmp2~0_3 0) InVars {} OutVars{~tmp2~0=v_~tmp2~0_3} AuxVars[] AssignedVars[~tmp2~0] {3870#true} is VALID [2022-02-20 20:58:24,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {3870#true} [173] L39-4-->L39-5: Formula: (= v_~i~0_5 0) InVars {} OutVars{~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i~0] {3870#true} is VALID [2022-02-20 20:58:24,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {3870#true} [202] L39-5-->L39-6: Formula: (= v_~i1~0_3 0) InVars {} OutVars{~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[~i1~0] {3870#true} is VALID [2022-02-20 20:58:24,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {3870#true} [230] L39-6-->L-1-3: Formula: (= v_~i2~0_3 0) InVars {} OutVars{~i2~0=v_~i2~0_3} AuxVars[] AssignedVars[~i2~0] {3870#true} is VALID [2022-02-20 20:58:24,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {3870#true} [228] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3870#true} is VALID [2022-02-20 20:58:24,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {3870#true} [203] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3870#true} is VALID [2022-02-20 20:58:24,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {3870#true} [175] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {3870#true} is VALID [2022-02-20 20:58:24,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {3870#true} [199] L-1-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_1|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet2#1, ULTIMATE.start_main_#t~pre1#1, ULTIMATE.start_main_#t~mem5#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] {3870#true} is VALID [2022-02-20 20:58:24,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {3870#true} [219] L107-->L107-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] {3870#true} is VALID [2022-02-20 20:58:24,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {3870#true} [215] L107-1-->L107-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] {3870#true} is VALID [2022-02-20 20:58:24,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {3870#true} [236] L107-2-->L110: Formula: (= |v_ULTIMATE.start_main_#t~pre1#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {3870#true} is VALID [2022-02-20 20:58:24,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {3870#true} [161] L110-->L110-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {3870#true} is VALID [2022-02-20 20:58:24,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {3870#true} [178] L110-1-->L110-2: 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~pre1#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_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_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {3870#true} is VALID [2022-02-20 20:58:24,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {3870#true} [265] L110-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre1#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] {3870#true} is VALID [2022-02-20 20:58:24,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {3870#true} [240] thread1ENTRY-->L45: Formula: (= v_~e1~0_1 1) InVars {} OutVars{~e1~0=v_~e1~0_1} AuxVars[] AssignedVars[~e1~0] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [241] L45-->L48: Formula: (= v_~tmp1~0_1 v_~n2~0_1) InVars {~n2~0=v_~n2~0_1} OutVars{~n2~0=v_~n2~0_1, ~tmp1~0=v_~tmp1~0_1} AuxVars[] AssignedVars[~tmp1~0] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [168] L110-3-->L110-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [185] L110-4-->L111: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,108 INFO L290 TraceCheckUtils]: 31: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [179] L111-->L111-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [200] L111-1-->L111-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [190] L111-2-->L111-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~pre3#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [263] L111-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [242] L48-->L51: Formula: (= v_~n1~0_1 (+ v_~tmp1~0_2 1)) InVars {~tmp1~0=v_~tmp1~0_2} OutVars{~n1~0=v_~n1~0_1, ~tmp1~0=v_~tmp1~0_2} AuxVars[] AssignedVars[~n1~0] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [251] thread2ENTRY-->L77: Formula: (= v_~e2~0_2 1) InVars {} OutVars{~e2~0=v_~e2~0_2} AuxVars[] AssignedVars[~e2~0] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [252] L77-->L80: Formula: (= v_~tmp2~0_1 v_~n1~0_4) InVars {~n1~0=v_~n1~0_4} OutVars{~tmp2~0=v_~tmp2~0_1, ~n1~0=v_~n1~0_4} AuxVars[] AssignedVars[~tmp2~0] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [253] L80-->L83: Formula: (= v_~n2~0_3 (+ v_~tmp2~0_2 1)) InVars {~tmp2~0=v_~tmp2~0_2} OutVars{~n2~0=v_~n2~0_3, ~tmp2~0=v_~tmp2~0_2} AuxVars[] AssignedVars[~n2~0] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,120 INFO L290 TraceCheckUtils]: 39: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [254] L83-->L86: Formula: (= v_~e2~0_3 0) InVars {} OutVars{~e2~0=v_~e2~0_3} AuxVars[] AssignedVars[~e2~0] {3872#(= (+ (- 1) ~e1~0) 0)} is VALID [2022-02-20 20:58:24,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {3872#(= (+ (- 1) ~e1~0) 0)} [255] L86-->L89: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (ite (= (mod v_~e1~0_11 256) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~e1~0=v_~e1~0_11} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {3871#false} is VALID [2022-02-20 20:58:24,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {3871#false} [243] L51-->L54: Formula: (= v_~e1~0_2 0) InVars {} OutVars{~e1~0=v_~e1~0_2} AuxVars[] AssignedVars[~e1~0] {3871#false} is VALID [2022-02-20 20:58:24,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {3871#false} [244] L54-->L57: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e2~0_11 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))) InVars {~e2~0=v_~e2~0_11} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~e2~0=v_~e2~0_11, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {3871#false} is VALID [2022-02-20 20:58:24,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {3871#false} [245] L57-->L60: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (ite (or (<= v_~n1~0_15 v_~n2~0_15) (= v_~n2~0_15 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|)) InVars {~n2~0=v_~n2~0_15, ~n1~0=v_~n1~0_15} OutVars{~n2~0=v_~n2~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {3871#false} is VALID [2022-02-20 20:58:24,122 INFO L290 TraceCheckUtils]: 44: Hoare triple {3871#false} [246] L60-->L63: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] {3871#false} is VALID [2022-02-20 20:58:24,123 INFO L290 TraceCheckUtils]: 45: Hoare triple {3871#false} [256] L89-->L92: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (or (< v_~n2~0_19 v_~n1~0_19) (= v_~n1~0_19 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {3871#false} is VALID [2022-02-20 20:58:24,126 INFO L290 TraceCheckUtils]: 46: Hoare triple {3871#false} [257] L92-->L95: Formula: (= v_~i2~0_1 v_~i~0_3) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] {3871#false} is VALID [2022-02-20 20:58:24,126 INFO L290 TraceCheckUtils]: 47: Hoare triple {3871#false} [247] L63-->L66: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] {3871#false} is VALID [2022-02-20 20:58:24,126 INFO L290 TraceCheckUtils]: 48: Hoare triple {3871#false} [162] L111-4-->L111-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {3871#false} is VALID [2022-02-20 20:58:24,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {3871#false} [170] L111-5-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {3871#false} is VALID [2022-02-20 20:58:24,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {3871#false} [214] L112-->L112-1: Formula: (= |v_ULTIMATE.start_main_#t~mem5#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {3871#false} is VALID [2022-02-20 20:58:24,127 INFO L290 TraceCheckUtils]: 51: Hoare triple {3871#false} [248] L66-->L69: Formula: (= v_~n1~0_3 0) InVars {} OutVars{~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[~n1~0] {3871#false} is VALID [2022-02-20 20:58:24,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {3871#false} [249] L69-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] {3871#false} is VALID [2022-02-20 20:58:24,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {3871#false} [250] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3871#false} is VALID [2022-02-20 20:58:24,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {3871#false} [266] thread1EXIT-->L112-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem5#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) InVars {ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {3871#false} is VALID [2022-02-20 20:58:24,128 INFO L290 TraceCheckUtils]: 55: Hoare triple {3871#false} [258] L95-->L98: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] {3871#false} is VALID [2022-02-20 20:58:24,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {3871#false} [259] L98-->L101: Formula: (= v_~n2~0_5 0) InVars {} OutVars{~n2~0=v_~n2~0_5} AuxVars[] AssignedVars[~n2~0] {3871#false} is VALID [2022-02-20 20:58:24,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {3871#false} [260] L101-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {3871#false} is VALID [2022-02-20 20:58:24,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {3871#false} [261] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3871#false} is VALID [2022-02-20 20:58:24,128 INFO L290 TraceCheckUtils]: 59: Hoare triple {3871#false} [220] L112-2-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {3871#false} is VALID [2022-02-20 20:58:24,128 INFO L290 TraceCheckUtils]: 60: Hoare triple {3871#false} [201] L113-->L113-1: Formula: (= |v_ULTIMATE.start_main_#t~mem6#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {3871#false} is VALID [2022-02-20 20:58:24,129 INFO L290 TraceCheckUtils]: 61: Hoare triple {3871#false} [267] thread2EXIT-->L113-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem6#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[] {3871#false} is VALID [2022-02-20 20:58:24,129 INFO L290 TraceCheckUtils]: 62: Hoare triple {3871#false} [207] L113-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {3871#false} is VALID [2022-02-20 20:58:24,129 INFO L290 TraceCheckUtils]: 63: Hoare triple {3871#false} [221] L115-->L115-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3871#false} is VALID [2022-02-20 20:58:24,129 INFO L290 TraceCheckUtils]: 64: Hoare triple {3871#false} [225] L115-1-->L115-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= 2 v_~i~0_6)) 1 0)) InVars {~i~0=v_~i~0_6} OutVars{~i~0=v_~i~0_6, 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] {3871#false} is VALID [2022-02-20 20:58:24,129 INFO L290 TraceCheckUtils]: 65: Hoare triple {3871#false} [226] L115-2-->L34: 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] {3871#false} is VALID [2022-02-20 20:58:24,130 INFO L290 TraceCheckUtils]: 66: Hoare triple {3871#false} [186] L34-->L35: 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] {3871#false} is VALID [2022-02-20 20:58:24,130 INFO L290 TraceCheckUtils]: 67: Hoare triple {3871#false} [211] L35-->L34-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[] {3871#false} is VALID [2022-02-20 20:58:24,130 INFO L290 TraceCheckUtils]: 68: Hoare triple {3871#false} [204] L34-1-->L116: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3871#false} is VALID [2022-02-20 20:58:24,130 INFO L290 TraceCheckUtils]: 69: Hoare triple {3871#false} [187] L116-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3871#false} is VALID [2022-02-20 20:58:24,131 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:58:24,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:24,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219955421] [2022-02-20 20:58:24,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219955421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:24,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:24,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:58:24,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150160839] [2022-02-20 20:58:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:24,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2022-02-20 20:58:24,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:24,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:58:24,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:24,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:58:24,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:24,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:58:24,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:58:24,186 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 83 [2022-02-20 20:58:24,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 80 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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:58:24,187 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:24,187 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 83 [2022-02-20 20:58:24,187 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:24,241 INFO L129 PetriNetUnfolder]: 27/272 cut-off events. [2022-02-20 20:58:24,242 INFO L130 PetriNetUnfolder]: For 113/115 co-relation queries the response was YES. [2022-02-20 20:58:24,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 272 events. 27/272 cut-off events. For 113/115 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1191 event pairs, 17 based on Foata normal form. 5/268 useless extension candidates. Maximal degree in co-relation 488. Up to 64 conditions per place. [2022-02-20 20:58:24,243 INFO L132 encePairwiseOnDemand]: 80/83 looper letters, 10 selfloop transitions, 2 changer transitions 1/82 dead transitions. [2022-02-20 20:58:24,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 82 transitions, 288 flow [2022-02-20 20:58:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:58:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:58:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2022-02-20 20:58:24,246 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8995983935742972 [2022-02-20 20:58:24,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2022-02-20 20:58:24,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2022-02-20 20:58:24,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:24,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2022-02-20 20:58:24,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:58:24,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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:58:24,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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:58:24,249 INFO L186 Difference]: Start difference. First operand has 101 places, 80 transitions, 257 flow. Second operand 3 states and 224 transitions. [2022-02-20 20:58:24,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 82 transitions, 288 flow [2022-02-20 20:58:24,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 82 transitions, 269 flow, removed 3 selfloop flow, removed 9 redundant places. [2022-02-20 20:58:24,414 INFO L242 Difference]: Finished difference. Result has 91 places, 80 transitions, 246 flow [2022-02-20 20:58:24,415 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2022-02-20 20:58:24,415 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2022-02-20 20:58:24,415 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 80 transitions, 246 flow [2022-02-20 20:58:24,448 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1229 states, 1220 states have (on average 2.2852459016393443) internal successors, (2788), 1228 states have internal predecessors, (2788), 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:58:24,452 INFO L78 Accepts]: Start accepts. Automaton has has 1229 states, 1220 states have (on average 2.2852459016393443) internal successors, (2788), 1228 states have internal predecessors, (2788), 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 70 [2022-02-20 20:58:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:24,452 INFO L470 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 246 flow [2022-02-20 20:58:24,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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:58:24,453 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:24,453 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:58:24,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:58:24,453 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:24,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash 45930695, now seen corresponding path program 5 times [2022-02-20 20:58:24,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:24,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406905077] [2022-02-20 20:58:24,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:24,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:24,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {5105#true} [213] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5105#true} is VALID [2022-02-20 20:58:24,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {5105#true} [194] 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] {5105#true} is VALID [2022-02-20 20:58:24,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {5105#true} [222] 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[] {5105#true} is VALID [2022-02-20 20:58:24,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {5105#true} [223] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {5105#true} is VALID [2022-02-20 20:58:24,588 INFO L290 TraceCheckUtils]: 4: Hoare triple {5105#true} [189] L21-->L21-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[] {5105#true} is VALID [2022-02-20 20:58:24,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {5105#true} [208] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {5105#true} is VALID [2022-02-20 20:58:24,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {5105#true} [206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {5105#true} is VALID [2022-02-20 20:58:24,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {5105#true} [177] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {5105#true} is VALID [2022-02-20 20:58:24,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {5105#true} [231] L21-4-->L38: Formula: (= v_~e1~0_4 0) InVars {} OutVars{~e1~0=v_~e1~0_4} AuxVars[] AssignedVars[~e1~0] {5105#true} is VALID [2022-02-20 20:58:24,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {5105#true} [232] L38-->L39: Formula: (= v_~e2~0_4 0) InVars {} OutVars{~e2~0=v_~e2~0_4} AuxVars[] AssignedVars[~e2~0] {5105#true} is VALID [2022-02-20 20:58:24,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {5105#true} [209] L39-->L39-1: Formula: (= v_~n1~0_6 0) InVars {} OutVars{~n1~0=v_~n1~0_6} AuxVars[] AssignedVars[~n1~0] {5107#(= ~n1~0 0)} is VALID [2022-02-20 20:58:24,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {5107#(= ~n1~0 0)} [181] L39-1-->L39-2: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [224] L39-2-->L39-3: Formula: (= v_~tmp1~0_3 0) InVars {} OutVars{~tmp1~0=v_~tmp1~0_3} AuxVars[] AssignedVars[~tmp1~0] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [212] L39-3-->L39-4: Formula: (= v_~tmp2~0_3 0) InVars {} OutVars{~tmp2~0=v_~tmp2~0_3} AuxVars[] AssignedVars[~tmp2~0] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [173] L39-4-->L39-5: Formula: (= v_~i~0_5 0) InVars {} OutVars{~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i~0] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [202] L39-5-->L39-6: Formula: (= v_~i1~0_3 0) InVars {} OutVars{~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[~i1~0] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [230] L39-6-->L-1-3: Formula: (= v_~i2~0_3 0) InVars {} OutVars{~i2~0=v_~i2~0_3} AuxVars[] AssignedVars[~i2~0] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [228] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [203] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [175] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [199] L-1-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_1|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet2#1, ULTIMATE.start_main_#t~pre1#1, ULTIMATE.start_main_#t~mem5#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [219] L107-->L107-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] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [215] L107-1-->L107-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] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [236] L107-2-->L110: Formula: (= |v_ULTIMATE.start_main_#t~pre1#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [161] L110-->L110-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [178] L110-1-->L110-2: 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~pre1#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_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_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [265] L110-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre1#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [168] L110-3-->L110-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [185] L110-4-->L111: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [179] L111-->L111-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [200] L111-1-->L111-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [190] L111-2-->L111-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~pre3#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [263] L111-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [240] thread1ENTRY-->L45: Formula: (= v_~e1~0_1 1) InVars {} OutVars{~e1~0=v_~e1~0_1} AuxVars[] AssignedVars[~e1~0] {5108#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {5108#(and (= ~n2~0 0) (= ~n1~0 0))} [241] L45-->L48: Formula: (= v_~tmp1~0_1 v_~n2~0_1) InVars {~n2~0=v_~n2~0_1} OutVars{~n2~0=v_~n2~0_1, ~tmp1~0=v_~tmp1~0_1} AuxVars[] AssignedVars[~tmp1~0] {5109#(and (= ~tmp1~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {5109#(and (= ~tmp1~0 0) (= ~n1~0 0))} [251] thread2ENTRY-->L77: Formula: (= v_~e2~0_2 1) InVars {} OutVars{~e2~0=v_~e2~0_2} AuxVars[] AssignedVars[~e2~0] {5109#(and (= ~tmp1~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:24,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {5109#(and (= ~tmp1~0 0) (= ~n1~0 0))} [252] L77-->L80: Formula: (= v_~tmp2~0_1 v_~n1~0_4) InVars {~n1~0=v_~n1~0_4} OutVars{~tmp2~0=v_~tmp2~0_1, ~n1~0=v_~n1~0_4} AuxVars[] AssignedVars[~tmp2~0] {5110#(and (= ~tmp2~0 0) (= ~tmp1~0 0))} is VALID [2022-02-20 20:58:24,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {5110#(and (= ~tmp2~0 0) (= ~tmp1~0 0))} [242] L48-->L51: Formula: (= v_~n1~0_1 (+ v_~tmp1~0_2 1)) InVars {~tmp1~0=v_~tmp1~0_2} OutVars{~n1~0=v_~n1~0_1, ~tmp1~0=v_~tmp1~0_2} AuxVars[] AssignedVars[~n1~0] {5111#(and (<= 1 ~n1~0) (= ~tmp2~0 0) (<= ~n1~0 1))} is VALID [2022-02-20 20:58:24,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {5111#(and (<= 1 ~n1~0) (= ~tmp2~0 0) (<= ~n1~0 1))} [253] L80-->L83: Formula: (= v_~n2~0_3 (+ v_~tmp2~0_2 1)) InVars {~tmp2~0=v_~tmp2~0_2} OutVars{~n2~0=v_~n2~0_3, ~tmp2~0=v_~tmp2~0_2} AuxVars[] AssignedVars[~n2~0] {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} is VALID [2022-02-20 20:58:24,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} [243] L51-->L54: Formula: (= v_~e1~0_2 0) InVars {} OutVars{~e1~0=v_~e1~0_2} AuxVars[] AssignedVars[~e1~0] {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} is VALID [2022-02-20 20:58:24,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} [254] L83-->L86: Formula: (= v_~e2~0_3 0) InVars {} OutVars{~e2~0=v_~e2~0_3} AuxVars[] AssignedVars[~e2~0] {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} is VALID [2022-02-20 20:58:24,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} [255] L86-->L89: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (ite (= (mod v_~e1~0_11 256) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~e1~0=v_~e1~0_11} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} is VALID [2022-02-20 20:58:24,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} [244] L54-->L57: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e2~0_11 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))) InVars {~e2~0=v_~e2~0_11} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~e2~0=v_~e2~0_11, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} is VALID [2022-02-20 20:58:24,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} [245] L57-->L60: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (ite (or (<= v_~n1~0_15 v_~n2~0_15) (= v_~n2~0_15 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|)) InVars {~n2~0=v_~n2~0_15, ~n1~0=v_~n1~0_15} OutVars{~n2~0=v_~n2~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} is VALID [2022-02-20 20:58:24,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} [246] L60-->L63: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} is VALID [2022-02-20 20:58:24,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {5112#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0))} [256] L89-->L92: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (or (< v_~n2~0_19 v_~n1~0_19) (= v_~n1~0_19 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {5106#false} is VALID [2022-02-20 20:58:24,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {5106#false} [257] L92-->L95: Formula: (= v_~i2~0_1 v_~i~0_3) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] {5106#false} is VALID [2022-02-20 20:58:24,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {5106#false} [247] L63-->L66: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] {5106#false} is VALID [2022-02-20 20:58:24,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {5106#false} [258] L95-->L98: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] {5106#false} is VALID [2022-02-20 20:58:24,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {5106#false} [259] L98-->L101: Formula: (= v_~n2~0_5 0) InVars {} OutVars{~n2~0=v_~n2~0_5} AuxVars[] AssignedVars[~n2~0] {5106#false} is VALID [2022-02-20 20:58:24,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {5106#false} [248] L66-->L69: Formula: (= v_~n1~0_3 0) InVars {} OutVars{~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[~n1~0] {5106#false} is VALID [2022-02-20 20:58:24,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {5106#false} [249] L69-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] {5106#false} is VALID [2022-02-20 20:58:24,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {5106#false} [250] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5106#false} is VALID [2022-02-20 20:58:24,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {5106#false} [162] L111-4-->L111-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {5106#false} is VALID [2022-02-20 20:58:24,607 INFO L290 TraceCheckUtils]: 54: Hoare triple {5106#false} [170] L111-5-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {5106#false} is VALID [2022-02-20 20:58:24,607 INFO L290 TraceCheckUtils]: 55: Hoare triple {5106#false} [214] L112-->L112-1: Formula: (= |v_ULTIMATE.start_main_#t~mem5#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {5106#false} is VALID [2022-02-20 20:58:24,607 INFO L290 TraceCheckUtils]: 56: Hoare triple {5106#false} [266] thread1EXIT-->L112-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem5#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) InVars {ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {5106#false} is VALID [2022-02-20 20:58:24,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {5106#false} [220] L112-2-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {5106#false} is VALID [2022-02-20 20:58:24,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {5106#false} [201] L113-->L113-1: Formula: (= |v_ULTIMATE.start_main_#t~mem6#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {5106#false} is VALID [2022-02-20 20:58:24,608 INFO L290 TraceCheckUtils]: 59: Hoare triple {5106#false} [260] L101-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {5106#false} is VALID [2022-02-20 20:58:24,608 INFO L290 TraceCheckUtils]: 60: Hoare triple {5106#false} [261] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5106#false} is VALID [2022-02-20 20:58:24,608 INFO L290 TraceCheckUtils]: 61: Hoare triple {5106#false} [267] thread2EXIT-->L113-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem6#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[] {5106#false} is VALID [2022-02-20 20:58:24,608 INFO L290 TraceCheckUtils]: 62: Hoare triple {5106#false} [207] L113-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {5106#false} is VALID [2022-02-20 20:58:24,609 INFO L290 TraceCheckUtils]: 63: Hoare triple {5106#false} [221] L115-->L115-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5106#false} is VALID [2022-02-20 20:58:24,609 INFO L290 TraceCheckUtils]: 64: Hoare triple {5106#false} [225] L115-1-->L115-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= 2 v_~i~0_6)) 1 0)) InVars {~i~0=v_~i~0_6} OutVars{~i~0=v_~i~0_6, 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] {5106#false} is VALID [2022-02-20 20:58:24,609 INFO L290 TraceCheckUtils]: 65: Hoare triple {5106#false} [226] L115-2-->L34: 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] {5106#false} is VALID [2022-02-20 20:58:24,609 INFO L290 TraceCheckUtils]: 66: Hoare triple {5106#false} [186] L34-->L35: 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] {5106#false} is VALID [2022-02-20 20:58:24,609 INFO L290 TraceCheckUtils]: 67: Hoare triple {5106#false} [211] L35-->L34-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[] {5106#false} is VALID [2022-02-20 20:58:24,609 INFO L290 TraceCheckUtils]: 68: Hoare triple {5106#false} [204] L34-1-->L116: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5106#false} is VALID [2022-02-20 20:58:24,610 INFO L290 TraceCheckUtils]: 69: Hoare triple {5106#false} [187] L116-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5106#false} is VALID [2022-02-20 20:58:24,610 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:58:24,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:24,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406905077] [2022-02-20 20:58:24,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406905077] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:24,611 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:24,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:58:24,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450695804] [2022-02-20 20:58:24,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:24,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 70 [2022-02-20 20:58:24,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:24,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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:58:24,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:24,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:58:24,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:24,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:58:24,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:58:24,658 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 83 [2022-02-20 20:58:24,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 246 flow. Second operand has 8 states, 8 states have (on average 65.25) internal successors, (522), 8 states have internal predecessors, (522), 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:58:24,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:24,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 83 [2022-02-20 20:58:24,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:24,980 INFO L129 PetriNetUnfolder]: 47/391 cut-off events. [2022-02-20 20:58:24,980 INFO L130 PetriNetUnfolder]: For 233/241 co-relation queries the response was YES. [2022-02-20 20:58:24,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 391 events. 47/391 cut-off events. For 233/241 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2079 event pairs, 12 based on Foata normal form. 9/394 useless extension candidates. Maximal degree in co-relation 374. Up to 36 conditions per place. [2022-02-20 20:58:24,982 INFO L132 encePairwiseOnDemand]: 73/83 looper letters, 24 selfloop transitions, 13 changer transitions 13/104 dead transitions. [2022-02-20 20:58:24,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 104 transitions, 434 flow [2022-02-20 20:58:24,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:58:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:58:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 617 transitions. [2022-02-20 20:58:24,991 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8259705488621151 [2022-02-20 20:58:24,991 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 617 transitions. [2022-02-20 20:58:24,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 617 transitions. [2022-02-20 20:58:24,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:24,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 617 transitions. [2022-02-20 20:58:24,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 68.55555555555556) internal successors, (617), 9 states have internal predecessors, (617), 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:58:24,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 83.0) internal successors, (830), 10 states have internal predecessors, (830), 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:58:24,994 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 83.0) internal successors, (830), 10 states have internal predecessors, (830), 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:58:24,995 INFO L186 Difference]: Start difference. First operand has 91 places, 80 transitions, 246 flow. Second operand 9 states and 617 transitions. [2022-02-20 20:58:24,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 104 transitions, 434 flow [2022-02-20 20:58:25,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 104 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:58:25,301 INFO L242 Difference]: Finished difference. Result has 99 places, 80 transitions, 278 flow [2022-02-20 20:58:25,302 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=278, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2022-02-20 20:58:25,302 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, 21 predicate places. [2022-02-20 20:58:25,303 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 80 transitions, 278 flow [2022-02-20 20:58:25,338 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1445 states, 1431 states have (on average 2.1977638015373864) internal successors, (3145), 1444 states have internal predecessors, (3145), 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:58:25,342 INFO L78 Accepts]: Start accepts. Automaton has has 1445 states, 1431 states have (on average 2.1977638015373864) internal successors, (3145), 1444 states have internal predecessors, (3145), 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 70 [2022-02-20 20:58:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:25,342 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 278 flow [2022-02-20 20:58:25,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 65.25) internal successors, (522), 8 states have internal predecessors, (522), 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:58:25,343 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:25,343 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:58:25,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:58:25,343 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:25,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:25,344 INFO L85 PathProgramCache]: Analyzing trace with hash -579230631, now seen corresponding path program 6 times [2022-02-20 20:58:25,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:25,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505603221] [2022-02-20 20:58:25,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:25,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:25,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {6572#true} [213] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-02-20 20:58:25,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {6572#true} [194] 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] {6572#true} is VALID [2022-02-20 20:58:25,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {6572#true} [222] 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[] {6572#true} is VALID [2022-02-20 20:58:25,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {6572#true} [223] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-02-20 20:58:25,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {6572#true} [189] L21-->L21-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[] {6572#true} is VALID [2022-02-20 20:58:25,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {6572#true} [208] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-02-20 20:58:25,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {6572#true} [206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-02-20 20:58:25,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {6572#true} [177] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-02-20 20:58:25,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {6572#true} [231] L21-4-->L38: Formula: (= v_~e1~0_4 0) InVars {} OutVars{~e1~0=v_~e1~0_4} AuxVars[] AssignedVars[~e1~0] {6572#true} is VALID [2022-02-20 20:58:25,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {6572#true} [232] L38-->L39: Formula: (= v_~e2~0_4 0) InVars {} OutVars{~e2~0=v_~e2~0_4} AuxVars[] AssignedVars[~e2~0] {6572#true} is VALID [2022-02-20 20:58:25,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {6572#true} [209] L39-->L39-1: Formula: (= v_~n1~0_6 0) InVars {} OutVars{~n1~0=v_~n1~0_6} AuxVars[] AssignedVars[~n1~0] {6572#true} is VALID [2022-02-20 20:58:25,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {6572#true} [181] L39-1-->L39-2: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {6574#(= ~n2~0 0)} [224] L39-2-->L39-3: Formula: (= v_~tmp1~0_3 0) InVars {} OutVars{~tmp1~0=v_~tmp1~0_3} AuxVars[] AssignedVars[~tmp1~0] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {6574#(= ~n2~0 0)} [212] L39-3-->L39-4: Formula: (= v_~tmp2~0_3 0) InVars {} OutVars{~tmp2~0=v_~tmp2~0_3} AuxVars[] AssignedVars[~tmp2~0] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {6574#(= ~n2~0 0)} [173] L39-4-->L39-5: Formula: (= v_~i~0_5 0) InVars {} OutVars{~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i~0] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {6574#(= ~n2~0 0)} [202] L39-5-->L39-6: Formula: (= v_~i1~0_3 0) InVars {} OutVars{~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[~i1~0] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {6574#(= ~n2~0 0)} [230] L39-6-->L-1-3: Formula: (= v_~i2~0_3 0) InVars {} OutVars{~i2~0=v_~i2~0_3} AuxVars[] AssignedVars[~i2~0] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {6574#(= ~n2~0 0)} [228] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {6574#(= ~n2~0 0)} [203] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {6574#(= ~n2~0 0)} [175] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {6574#(= ~n2~0 0)} [199] L-1-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_1|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet2#1, ULTIMATE.start_main_#t~pre1#1, ULTIMATE.start_main_#t~mem5#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {6574#(= ~n2~0 0)} [219] L107-->L107-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] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {6574#(= ~n2~0 0)} [215] L107-1-->L107-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] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {6574#(= ~n2~0 0)} [236] L107-2-->L110: Formula: (= |v_ULTIMATE.start_main_#t~pre1#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {6574#(= ~n2~0 0)} [161] L110-->L110-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {6574#(= ~n2~0 0)} [178] L110-1-->L110-2: 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~pre1#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_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_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {6574#(= ~n2~0 0)} [265] L110-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre1#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {6574#(= ~n2~0 0)} [240] thread1ENTRY-->L45: Formula: (= v_~e1~0_1 1) InVars {} OutVars{~e1~0=v_~e1~0_1} AuxVars[] AssignedVars[~e1~0] {6574#(= ~n2~0 0)} is VALID [2022-02-20 20:58:25,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {6574#(= ~n2~0 0)} [241] L45-->L48: Formula: (= v_~tmp1~0_1 v_~n2~0_1) InVars {~n2~0=v_~n2~0_1} OutVars{~n2~0=v_~n2~0_1, ~tmp1~0=v_~tmp1~0_1} AuxVars[] AssignedVars[~tmp1~0] {6575#(= ~tmp1~0 0)} is VALID [2022-02-20 20:58:25,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {6575#(= ~tmp1~0 0)} [242] L48-->L51: Formula: (= v_~n1~0_1 (+ v_~tmp1~0_2 1)) InVars {~tmp1~0=v_~tmp1~0_2} OutVars{~n1~0=v_~n1~0_1, ~tmp1~0=v_~tmp1~0_2} AuxVars[] AssignedVars[~n1~0] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {6576#(<= 1 ~n1~0)} [168] L110-3-->L110-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {6576#(<= 1 ~n1~0)} [185] L110-4-->L111: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {6576#(<= 1 ~n1~0)} [179] L111-->L111-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {6576#(<= 1 ~n1~0)} [200] L111-1-->L111-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {6576#(<= 1 ~n1~0)} [190] L111-2-->L111-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~pre3#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {6576#(<= 1 ~n1~0)} [263] L111-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {6576#(<= 1 ~n1~0)} [243] L51-->L54: Formula: (= v_~e1~0_2 0) InVars {} OutVars{~e1~0=v_~e1~0_2} AuxVars[] AssignedVars[~e1~0] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {6576#(<= 1 ~n1~0)} [244] L54-->L57: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e2~0_11 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))) InVars {~e2~0=v_~e2~0_11} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~e2~0=v_~e2~0_11, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {6576#(<= 1 ~n1~0)} [245] L57-->L60: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (ite (or (<= v_~n1~0_15 v_~n2~0_15) (= v_~n2~0_15 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|)) InVars {~n2~0=v_~n2~0_15, ~n1~0=v_~n1~0_15} OutVars{~n2~0=v_~n2~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {6576#(<= 1 ~n1~0)} [251] thread2ENTRY-->L77: Formula: (= v_~e2~0_2 1) InVars {} OutVars{~e2~0=v_~e2~0_2} AuxVars[] AssignedVars[~e2~0] {6576#(<= 1 ~n1~0)} is VALID [2022-02-20 20:58:25,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {6576#(<= 1 ~n1~0)} [252] L77-->L80: Formula: (= v_~tmp2~0_1 v_~n1~0_4) InVars {~n1~0=v_~n1~0_4} OutVars{~tmp2~0=v_~tmp2~0_1, ~n1~0=v_~n1~0_4} AuxVars[] AssignedVars[~tmp2~0] {6577#(and (<= 1 ~n1~0) (<= ~n1~0 ~tmp2~0))} is VALID [2022-02-20 20:58:25,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {6577#(and (<= 1 ~n1~0) (<= ~n1~0 ~tmp2~0))} [253] L80-->L83: Formula: (= v_~n2~0_3 (+ v_~tmp2~0_2 1)) InVars {~tmp2~0=v_~tmp2~0_2} OutVars{~n2~0=v_~n2~0_3, ~tmp2~0=v_~tmp2~0_2} AuxVars[] AssignedVars[~n2~0] {6578#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0))} is VALID [2022-02-20 20:58:25,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {6578#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0))} [254] L83-->L86: Formula: (= v_~e2~0_3 0) InVars {} OutVars{~e2~0=v_~e2~0_3} AuxVars[] AssignedVars[~e2~0] {6578#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0))} is VALID [2022-02-20 20:58:25,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {6578#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0))} [255] L86-->L89: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (ite (= (mod v_~e1~0_11 256) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~e1~0=v_~e1~0_11} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {6578#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0))} is VALID [2022-02-20 20:58:25,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {6578#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0))} [256] L89-->L92: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (or (< v_~n2~0_19 v_~n1~0_19) (= v_~n1~0_19 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {6573#false} is VALID [2022-02-20 20:58:25,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {6573#false} [257] L92-->L95: Formula: (= v_~i2~0_1 v_~i~0_3) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] {6573#false} is VALID [2022-02-20 20:58:25,437 INFO L290 TraceCheckUtils]: 46: Hoare triple {6573#false} [246] L60-->L63: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] {6573#false} is VALID [2022-02-20 20:58:25,437 INFO L290 TraceCheckUtils]: 47: Hoare triple {6573#false} [247] L63-->L66: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] {6573#false} is VALID [2022-02-20 20:58:25,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {6573#false} [258] L95-->L98: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] {6573#false} is VALID [2022-02-20 20:58:25,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {6573#false} [259] L98-->L101: Formula: (= v_~n2~0_5 0) InVars {} OutVars{~n2~0=v_~n2~0_5} AuxVars[] AssignedVars[~n2~0] {6573#false} is VALID [2022-02-20 20:58:25,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {6573#false} [248] L66-->L69: Formula: (= v_~n1~0_3 0) InVars {} OutVars{~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[~n1~0] {6573#false} is VALID [2022-02-20 20:58:25,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {6573#false} [249] L69-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] {6573#false} is VALID [2022-02-20 20:58:25,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {6573#false} [250] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-02-20 20:58:25,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {6573#false} [162] L111-4-->L111-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {6573#false} is VALID [2022-02-20 20:58:25,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {6573#false} [170] L111-5-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {6573#false} is VALID [2022-02-20 20:58:25,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {6573#false} [214] L112-->L112-1: Formula: (= |v_ULTIMATE.start_main_#t~mem5#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {6573#false} is VALID [2022-02-20 20:58:25,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {6573#false} [266] thread1EXIT-->L112-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem5#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) InVars {ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-02-20 20:58:25,439 INFO L290 TraceCheckUtils]: 57: Hoare triple {6573#false} [220] L112-2-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {6573#false} is VALID [2022-02-20 20:58:25,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {6573#false} [201] L113-->L113-1: Formula: (= |v_ULTIMATE.start_main_#t~mem6#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {6573#false} is VALID [2022-02-20 20:58:25,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {6573#false} [260] L101-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {6573#false} is VALID [2022-02-20 20:58:25,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {6573#false} [261] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-02-20 20:58:25,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {6573#false} [267] thread2EXIT-->L113-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem6#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-02-20 20:58:25,440 INFO L290 TraceCheckUtils]: 62: Hoare triple {6573#false} [207] L113-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {6573#false} is VALID [2022-02-20 20:58:25,440 INFO L290 TraceCheckUtils]: 63: Hoare triple {6573#false} [221] L115-->L115-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-02-20 20:58:25,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {6573#false} [225] L115-1-->L115-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= 2 v_~i~0_6)) 1 0)) InVars {~i~0=v_~i~0_6} OutVars{~i~0=v_~i~0_6, 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] {6573#false} is VALID [2022-02-20 20:58:25,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {6573#false} [226] L115-2-->L34: 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] {6573#false} is VALID [2022-02-20 20:58:25,441 INFO L290 TraceCheckUtils]: 66: Hoare triple {6573#false} [186] L34-->L35: 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] {6573#false} is VALID [2022-02-20 20:58:25,441 INFO L290 TraceCheckUtils]: 67: Hoare triple {6573#false} [211] L35-->L34-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[] {6573#false} is VALID [2022-02-20 20:58:25,441 INFO L290 TraceCheckUtils]: 68: Hoare triple {6573#false} [204] L34-1-->L116: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-02-20 20:58:25,441 INFO L290 TraceCheckUtils]: 69: Hoare triple {6573#false} [187] L116-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-02-20 20:58:25,444 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:58:25,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:25,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505603221] [2022-02-20 20:58:25,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505603221] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:25,445 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:25,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:58:25,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798847499] [2022-02-20 20:58:25,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:25,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 70 [2022-02-20 20:58:25,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:25,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:58:25,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:25,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:58:25,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:25,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:58:25,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:58:25,493 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 83 [2022-02-20 20:58:25,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 278 flow. Second operand has 7 states, 7 states have (on average 65.57142857142857) internal successors, (459), 7 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:25,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:25,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 83 [2022-02-20 20:58:25,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:25,701 INFO L129 PetriNetUnfolder]: 32/263 cut-off events. [2022-02-20 20:58:25,701 INFO L130 PetriNetUnfolder]: For 212/218 co-relation queries the response was YES. [2022-02-20 20:58:25,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 263 events. 32/263 cut-off events. For 212/218 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1089 event pairs, 13 based on Foata normal form. 9/267 useless extension candidates. Maximal degree in co-relation 493. Up to 36 conditions per place. [2022-02-20 20:58:25,702 INFO L132 encePairwiseOnDemand]: 75/83 looper letters, 13 selfloop transitions, 8 changer transitions 16/91 dead transitions. [2022-02-20 20:58:25,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 91 transitions, 379 flow [2022-02-20 20:58:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:58:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:58:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 604 transitions. [2022-02-20 20:58:25,709 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8085676037483266 [2022-02-20 20:58:25,709 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 604 transitions. [2022-02-20 20:58:25,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 604 transitions. [2022-02-20 20:58:25,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:25,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 604 transitions. [2022-02-20 20:58:25,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 67.11111111111111) internal successors, (604), 9 states have internal predecessors, (604), 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:58:25,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 83.0) internal successors, (830), 10 states have internal predecessors, (830), 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:58:25,713 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 83.0) internal successors, (830), 10 states have internal predecessors, (830), 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:58:25,713 INFO L186 Difference]: Start difference. First operand has 99 places, 80 transitions, 278 flow. Second operand 9 states and 604 transitions. [2022-02-20 20:58:25,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 91 transitions, 379 flow [2022-02-20 20:58:26,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 333 flow, removed 6 selfloop flow, removed 11 redundant places. [2022-02-20 20:58:26,723 INFO L242 Difference]: Finished difference. Result has 96 places, 74 transitions, 220 flow [2022-02-20 20:58:26,723 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=96, PETRI_TRANSITIONS=74} [2022-02-20 20:58:26,724 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, 18 predicate places. [2022-02-20 20:58:26,724 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 74 transitions, 220 flow [2022-02-20 20:58:26,738 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 698 states, 690 states have (on average 2.1449275362318843) internal successors, (1480), 697 states have internal predecessors, (1480), 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:58:26,739 INFO L78 Accepts]: Start accepts. Automaton has has 698 states, 690 states have (on average 2.1449275362318843) internal successors, (1480), 697 states have internal predecessors, (1480), 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 70 [2022-02-20 20:58:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:26,739 INFO L470 AbstractCegarLoop]: Abstraction has has 96 places, 74 transitions, 220 flow [2022-02-20 20:58:26,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 65.57142857142857) internal successors, (459), 7 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:26,740 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:58:26,740 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:58:26,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:58:26,740 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:58:26,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:58:26,741 INFO L85 PathProgramCache]: Analyzing trace with hash -830192511, now seen corresponding path program 7 times [2022-02-20 20:58:26,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:58:26,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582503285] [2022-02-20 20:58:26,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:58:26,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:58:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:58:26,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {7290#true} [213] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7290#true} is VALID [2022-02-20 20:58:26,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {7290#true} [194] 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] {7290#true} is VALID [2022-02-20 20:58:26,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {7290#true} [222] 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[] {7290#true} is VALID [2022-02-20 20:58:26,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {7290#true} [223] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {7290#true} is VALID [2022-02-20 20:58:26,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {7290#true} [189] L21-->L21-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[] {7290#true} is VALID [2022-02-20 20:58:26,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {7290#true} [208] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {7290#true} is VALID [2022-02-20 20:58:26,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {7290#true} [206] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {7290#true} is VALID [2022-02-20 20:58:26,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {7290#true} [177] L21-3-->L21-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 17)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {7290#true} is VALID [2022-02-20 20:58:26,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {7290#true} [231] L21-4-->L38: Formula: (= v_~e1~0_4 0) InVars {} OutVars{~e1~0=v_~e1~0_4} AuxVars[] AssignedVars[~e1~0] {7290#true} is VALID [2022-02-20 20:58:26,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {7290#true} [232] L38-->L39: Formula: (= v_~e2~0_4 0) InVars {} OutVars{~e2~0=v_~e2~0_4} AuxVars[] AssignedVars[~e2~0] {7290#true} is VALID [2022-02-20 20:58:26,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {7290#true} [209] L39-->L39-1: Formula: (= v_~n1~0_6 0) InVars {} OutVars{~n1~0=v_~n1~0_6} AuxVars[] AssignedVars[~n1~0] {7292#(= ~n1~0 0)} is VALID [2022-02-20 20:58:26,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {7292#(= ~n1~0 0)} [181] L39-1-->L39-2: Formula: (= v_~n2~0_6 0) InVars {} OutVars{~n2~0=v_~n2~0_6} AuxVars[] AssignedVars[~n2~0] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [224] L39-2-->L39-3: Formula: (= v_~tmp1~0_3 0) InVars {} OutVars{~tmp1~0=v_~tmp1~0_3} AuxVars[] AssignedVars[~tmp1~0] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [212] L39-3-->L39-4: Formula: (= v_~tmp2~0_3 0) InVars {} OutVars{~tmp2~0=v_~tmp2~0_3} AuxVars[] AssignedVars[~tmp2~0] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [173] L39-4-->L39-5: Formula: (= v_~i~0_5 0) InVars {} OutVars{~i~0=v_~i~0_5} AuxVars[] AssignedVars[~i~0] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [202] L39-5-->L39-6: Formula: (= v_~i1~0_3 0) InVars {} OutVars{~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[~i1~0] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [230] L39-6-->L-1-3: Formula: (= v_~i2~0_3 0) InVars {} OutVars{~i2~0=v_~i2~0_3} AuxVars[] AssignedVars[~i2~0] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [228] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [203] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [175] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [199] L-1-6-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_1|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet2#1, ULTIMATE.start_main_#t~pre1#1, ULTIMATE.start_main_#t~mem5#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre3#1, ULTIMATE.start_main_~#t2~0#1.base] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [219] L107-->L107-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] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [215] L107-1-->L107-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] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [236] L107-2-->L110: Formula: (= |v_ULTIMATE.start_main_#t~pre1#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [161] L110-->L110-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [178] L110-1-->L110-2: 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~pre1#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_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_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [265] L110-2-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre1#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_6|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_6|, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_thidvar0] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [168] L110-3-->L110-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre1#1=|v_ULTIMATE.start_main_#t~pre1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre1#1] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [185] L110-4-->L111: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet2#1=|v_ULTIMATE.start_main_#t~nondet2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2#1] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [179] L111-->L111-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [200] L111-1-->L111-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [190] L111-2-->L111-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~pre3#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [263] L111-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre3#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_6|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [251] thread2ENTRY-->L77: Formula: (= v_~e2~0_2 1) InVars {} OutVars{~e2~0=v_~e2~0_2} AuxVars[] AssignedVars[~e2~0] {7293#(and (= ~n2~0 0) (= ~n1~0 0))} is VALID [2022-02-20 20:58:26,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {7293#(and (= ~n2~0 0) (= ~n1~0 0))} [252] L77-->L80: Formula: (= v_~tmp2~0_1 v_~n1~0_4) InVars {~n1~0=v_~n1~0_4} OutVars{~tmp2~0=v_~tmp2~0_1, ~n1~0=v_~n1~0_4} AuxVars[] AssignedVars[~tmp2~0] {7294#(and (= ~tmp2~0 0) (= ~n2~0 0))} is VALID [2022-02-20 20:58:26,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {7294#(and (= ~tmp2~0 0) (= ~n2~0 0))} [240] thread1ENTRY-->L45: Formula: (= v_~e1~0_1 1) InVars {} OutVars{~e1~0=v_~e1~0_1} AuxVars[] AssignedVars[~e1~0] {7294#(and (= ~tmp2~0 0) (= ~n2~0 0))} is VALID [2022-02-20 20:58:26,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {7294#(and (= ~tmp2~0 0) (= ~n2~0 0))} [241] L45-->L48: Formula: (= v_~tmp1~0_1 v_~n2~0_1) InVars {~n2~0=v_~n2~0_1} OutVars{~n2~0=v_~n2~0_1, ~tmp1~0=v_~tmp1~0_1} AuxVars[] AssignedVars[~tmp1~0] {7295#(and (= ~tmp2~0 0) (= ~tmp1~0 0))} is VALID [2022-02-20 20:58:26,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {7295#(and (= ~tmp2~0 0) (= ~tmp1~0 0))} [253] L80-->L83: Formula: (= v_~n2~0_3 (+ v_~tmp2~0_2 1)) InVars {~tmp2~0=v_~tmp2~0_2} OutVars{~n2~0=v_~n2~0_3, ~tmp2~0=v_~tmp2~0_2} AuxVars[] AssignedVars[~n2~0] {7296#(and (<= 1 ~n2~0) (= ~tmp1~0 0))} is VALID [2022-02-20 20:58:26,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {7296#(and (<= 1 ~n2~0) (= ~tmp1~0 0))} [242] L48-->L51: Formula: (= v_~n1~0_1 (+ v_~tmp1~0_2 1)) InVars {~tmp1~0=v_~tmp1~0_2} OutVars{~n1~0=v_~n1~0_1, ~tmp1~0=v_~tmp1~0_2} AuxVars[] AssignedVars[~n1~0] {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} is VALID [2022-02-20 20:58:26,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} [243] L51-->L54: Formula: (= v_~e1~0_2 0) InVars {} OutVars{~e1~0=v_~e1~0_2} AuxVars[] AssignedVars[~e1~0] {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} is VALID [2022-02-20 20:58:26,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} [254] L83-->L86: Formula: (= v_~e2~0_3 0) InVars {} OutVars{~e2~0=v_~e2~0_3} AuxVars[] AssignedVars[~e2~0] {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} is VALID [2022-02-20 20:58:26,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} [255] L86-->L89: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= (ite (= (mod v_~e1~0_11 256) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~e1~0=v_~e1~0_11} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~e1~0=v_~e1~0_11} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} is VALID [2022-02-20 20:58:26,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} [244] L54-->L57: Formula: (and (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~e2~0_11 256) 0) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1| 0))) InVars {~e2~0=v_~e2~0_11} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~e2~0=v_~e2~0_11, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} is VALID [2022-02-20 20:58:26,874 INFO L290 TraceCheckUtils]: 43: Hoare triple {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} [245] L57-->L60: Formula: (and (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3| 0)) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) (= (ite (or (<= v_~n1~0_15 v_~n2~0_15) (= v_~n2~0_15 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|)) InVars {~n2~0=v_~n2~0_15, ~n1~0=v_~n1~0_15} OutVars{~n2~0=v_~n2~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, ~n1~0=v_~n1~0_15, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} is VALID [2022-02-20 20:58:26,874 INFO L290 TraceCheckUtils]: 44: Hoare triple {7297#(and (<= ~n1~0 ~n2~0) (not (= ~n1~0 0)))} [256] L89-->L92: Formula: (and (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (or (< v_~n2~0_19 v_~n1~0_19) (= v_~n1~0_19 0)) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0))) InVars {~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_19, ~n1~0=v_~n1~0_19} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1] {7291#false} is VALID [2022-02-20 20:58:26,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {7291#false} [246] L60-->L63: Formula: (= v_~i1~0_1 v_~i~0_1) InVars {~i~0=v_~i~0_1} OutVars{~i~0=v_~i~0_1, ~i1~0=v_~i1~0_1} AuxVars[] AssignedVars[~i1~0] {7291#false} is VALID [2022-02-20 20:58:26,875 INFO L290 TraceCheckUtils]: 46: Hoare triple {7291#false} [257] L92-->L95: Formula: (= v_~i2~0_1 v_~i~0_3) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3, ~i2~0=v_~i2~0_1} AuxVars[] AssignedVars[~i2~0] {7291#false} is VALID [2022-02-20 20:58:26,875 INFO L290 TraceCheckUtils]: 47: Hoare triple {7291#false} [247] L63-->L66: Formula: (= (+ v_~i1~0_2 1) v_~i~0_2) InVars {~i1~0=v_~i1~0_2} OutVars{~i~0=v_~i~0_2, ~i1~0=v_~i1~0_2} AuxVars[] AssignedVars[~i~0] {7291#false} is VALID [2022-02-20 20:58:26,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {7291#false} [258] L95-->L98: Formula: (= (+ v_~i2~0_2 1) v_~i~0_4) InVars {~i2~0=v_~i2~0_2} OutVars{~i~0=v_~i~0_4, ~i2~0=v_~i2~0_2} AuxVars[] AssignedVars[~i~0] {7291#false} is VALID [2022-02-20 20:58:26,875 INFO L290 TraceCheckUtils]: 49: Hoare triple {7291#false} [259] L98-->L101: Formula: (= v_~n2~0_5 0) InVars {} OutVars{~n2~0=v_~n2~0_5} AuxVars[] AssignedVars[~n2~0] {7291#false} is VALID [2022-02-20 20:58:26,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {7291#false} [260] L101-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 51: Hoare triple {7291#false} [261] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 52: Hoare triple {7291#false} [162] L111-4-->L111-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 53: Hoare triple {7291#false} [170] L111-5-->L112: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 54: Hoare triple {7291#false} [214] L112-->L112-1: Formula: (= |v_ULTIMATE.start_main_#t~mem5#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 55: Hoare triple {7291#false} [248] L66-->L69: Formula: (= v_~n1~0_3 0) InVars {} OutVars{~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[~n1~0] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {7291#false} [249] L69-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_1|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {7291#false} [250] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {7291#false} [266] thread1EXIT-->L112-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= v_thread1Thread1of1ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem5#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))) InVars {ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {7291#false} [220] L112-2-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem5#1=|v_ULTIMATE.start_main_#t~mem5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5#1] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {7291#false} [201] L113-->L113-1: Formula: (= |v_ULTIMATE.start_main_#t~mem6#1_2| (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 61: Hoare triple {7291#false} [267] thread2EXIT-->L113-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem6#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_5|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[] {7291#false} is VALID [2022-02-20 20:58:26,876 INFO L290 TraceCheckUtils]: 62: Hoare triple {7291#false} [207] L113-2-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem6#1] {7291#false} is VALID [2022-02-20 20:58:26,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {7291#false} [221] L115-->L115-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7291#false} is VALID [2022-02-20 20:58:26,877 INFO L290 TraceCheckUtils]: 64: Hoare triple {7291#false} [225] L115-1-->L115-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (not (= 2 v_~i~0_6)) 1 0)) InVars {~i~0=v_~i~0_6} OutVars{~i~0=v_~i~0_6, 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] {7291#false} is VALID [2022-02-20 20:58:26,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {7291#false} [226] L115-2-->L34: 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] {7291#false} is VALID [2022-02-20 20:58:26,877 INFO L290 TraceCheckUtils]: 66: Hoare triple {7291#false} [186] L34-->L35: 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] {7291#false} is VALID [2022-02-20 20:58:26,877 INFO L290 TraceCheckUtils]: 67: Hoare triple {7291#false} [211] L35-->L34-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[] {7291#false} is VALID [2022-02-20 20:58:26,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {7291#false} [204] L34-1-->L116: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7291#false} is VALID [2022-02-20 20:58:26,878 INFO L290 TraceCheckUtils]: 69: Hoare triple {7291#false} [187] L116-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7291#false} is VALID [2022-02-20 20:58:26,878 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:58:26,878 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:58:26,878 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582503285] [2022-02-20 20:58:26,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582503285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:58:26,879 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:58:26,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 20:58:26,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667402778] [2022-02-20 20:58:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:58:26,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 70 [2022-02-20 20:58:26,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:58:26,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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:58:26,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:58:26,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 20:58:26,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:58:26,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 20:58:26,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 20:58:26,929 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 83 [2022-02-20 20:58:26,936 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 74 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 65.25) internal successors, (522), 8 states have internal predecessors, (522), 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:58:26,937 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:58:26,937 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 83 [2022-02-20 20:58:26,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:58:27,119 INFO L129 PetriNetUnfolder]: 7/91 cut-off events. [2022-02-20 20:58:27,119 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-02-20 20:58:27,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 91 events. 7/91 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 3 based on Foata normal form. 3/93 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2022-02-20 20:58:27,120 INFO L132 encePairwiseOnDemand]: 74/83 looper letters, 0 selfloop transitions, 0 changer transitions 68/68 dead transitions. [2022-02-20 20:58:27,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 68 transitions, 254 flow [2022-02-20 20:58:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:58:27,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-02-20 20:58:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 529 transitions. [2022-02-20 20:58:27,125 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7966867469879518 [2022-02-20 20:58:27,126 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 529 transitions. [2022-02-20 20:58:27,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 529 transitions. [2022-02-20 20:58:27,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:58:27,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 529 transitions. [2022-02-20 20:58:27,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 66.125) internal successors, (529), 8 states have internal predecessors, (529), 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:58:27,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 83.0) internal successors, (747), 9 states have internal predecessors, (747), 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:58:27,129 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 83.0) internal successors, (747), 9 states have internal predecessors, (747), 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:58:27,129 INFO L186 Difference]: Start difference. First operand has 96 places, 74 transitions, 220 flow. Second operand 8 states and 529 transitions. [2022-02-20 20:58:27,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 68 transitions, 254 flow [2022-02-20 20:58:27,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 68 transitions, 215 flow, removed 5 selfloop flow, removed 13 redundant places. [2022-02-20 20:58:27,173 INFO L242 Difference]: Finished difference. Result has 77 places, 0 transitions, 0 flow [2022-02-20 20:58:27,173 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=77, PETRI_TRANSITIONS=0} [2022-02-20 20:58:27,174 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2022-02-20 20:58:27,174 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 0 transitions, 0 flow [2022-02-20 20:58:27,174 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:58:27,174 INFO L78 Accepts]: Start accepts. Automaton has has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-02-20 20:58:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:58:27,175 INFO L470 AbstractCegarLoop]: Abstraction has has 77 places, 0 transitions, 0 flow [2022-02-20 20:58:27,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 65.25) internal successors, (522), 8 states have internal predecessors, (522), 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:58:27,177 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 20:58:27,178 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-20 20:58:27,178 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-20 20:58:27,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:58:27,181 INFO L732 BasicCegarLoop]: Path program histogram: [7] [2022-02-20 20:58:27,183 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:58:27,183 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:58:27,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:58:27 BasicIcfg [2022-02-20 20:58:27,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:58:27,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:58:27,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:58:27,187 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:58:27,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:58:15" (3/4) ... [2022-02-20 20:58:27,189 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:58:27,194 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-02-20 20:58:27,194 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-02-20 20:58:27,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-02-20 20:58:27,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:58:27,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:58:27,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:58:27,230 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:58:27,233 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:58:27,234 INFO L158 Benchmark]: Toolchain (without parser) took 12968.89ms. Allocated memory was 92.3MB in the beginning and 369.1MB in the end (delta: 276.8MB). Free memory was 61.6MB in the beginning and 183.8MB in the end (delta: -122.3MB). Peak memory consumption was 153.6MB. Max. memory is 16.1GB. [2022-02-20 20:58:27,234 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:58:27,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.47ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 66.8MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 20:58:27,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.23ms. Allocated memory is still 92.3MB. Free memory was 66.8MB in the beginning and 64.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:58:27,235 INFO L158 Benchmark]: Boogie Preprocessor took 34.63ms. Allocated memory is still 92.3MB. Free memory was 64.8MB in the beginning and 63.4MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:58:27,235 INFO L158 Benchmark]: RCFGBuilder took 472.39ms. Allocated memory is still 92.3MB. Free memory was 63.4MB in the beginning and 46.9MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 20:58:27,236 INFO L158 Benchmark]: TraceAbstraction took 12135.83ms. Allocated memory was 92.3MB in the beginning and 369.1MB in the end (delta: 276.8MB). Free memory was 46.6MB in the beginning and 187.0MB in the end (delta: -140.4MB). Peak memory consumption was 137.8MB. Max. memory is 16.1GB. [2022-02-20 20:58:27,236 INFO L158 Benchmark]: Witness Printer took 46.39ms. Allocated memory is still 369.1MB. Free memory was 187.0MB in the beginning and 183.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:58:27,238 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.47ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 66.8MB in the end (delta: -5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.23ms. Allocated memory is still 92.3MB. Free memory was 66.8MB in the beginning and 64.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.63ms. Allocated memory is still 92.3MB. Free memory was 64.8MB in the beginning and 63.4MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 472.39ms. Allocated memory is still 92.3MB. Free memory was 63.4MB in the beginning and 46.9MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12135.83ms. Allocated memory was 92.3MB in the beginning and 369.1MB in the end (delta: 276.8MB). Free memory was 46.6MB in the beginning and 187.0MB in the end (delta: -140.4MB). Peak memory consumption was 137.8MB. Max. memory is 16.1GB. * Witness Printer took 46.39ms. Allocated memory is still 369.1MB. Free memory was 187.0MB in the beginning and 183.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 116]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 279 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 209 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 497 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 683 IncrementalHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 62 mSDtfsCounter, 683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=5, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 1510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:58:27,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE