./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5cca3532c956cbfb3f8d24df68dd431ff61516e63bcc0106c0529c479d6a4ef --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:03:59,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:03:59,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:03:59,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:03:59,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:03:59,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:03:59,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:03:59,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:03:59,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:03:59,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:03:59,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:03:59,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:03:59,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:03:59,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:03:59,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:03:59,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:03:59,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:03:59,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:03:59,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:03:59,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:03:59,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:03:59,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:03:59,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:03:59,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:03:59,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:03:59,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:03:59,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:03:59,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:03:59,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:03:59,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:03:59,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:03:59,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:03:59,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:03:59,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:03:59,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:03:59,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:03:59,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:03:59,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:03:59,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:03:59,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:03:59,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:03:59,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:03:59,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:03:59,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:03:59,663 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:03:59,663 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:03:59,664 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:03:59,664 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:03:59,665 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:03:59,665 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:03:59,665 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:03:59,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:03:59,665 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:03:59,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:03:59,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:03:59,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:03:59,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:03:59,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:03:59,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:03:59,666 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:03:59,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:03:59,667 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:03:59,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:03:59,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:03:59,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:03:59,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:03:59,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:03:59,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:03:59,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:03:59,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:03:59,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:03:59,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:03:59,669 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:03:59,669 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:03:59,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:03:59,670 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 -> d5cca3532c956cbfb3f8d24df68dd431ff61516e63bcc0106c0529c479d6a4ef [2022-02-20 19:03:59,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:03:59,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:03:59,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:03:59,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:03:59,874 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:03:59,875 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i [2022-02-20 19:03:59,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d26923d/f3bea1cf230f43e1ac20b2ef175010cb/FLAG35c549bf3 [2022-02-20 19:04:00,356 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:04:00,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i [2022-02-20 19:04:00,367 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d26923d/f3bea1cf230f43e1ac20b2ef175010cb/FLAG35c549bf3 [2022-02-20 19:04:00,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d26923d/f3bea1cf230f43e1ac20b2ef175010cb [2022-02-20 19:04:00,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:04:00,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:04:00,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:04:00,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:04:00,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:04:00,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:00,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4131e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00, skipping insertion in model container [2022-02-20 19:04:00,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:00,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:04:00,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:04:00,628 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/seq-pthread/cs_time_var_mutex.i[23611,23624] [2022-02-20 19:04:00,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:04:00,745 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:04:00,766 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/seq-pthread/cs_time_var_mutex.i[23611,23624] [2022-02-20 19:04:00,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:04:00,845 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:04:00,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00 WrapperNode [2022-02-20 19:04:00,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:04:00,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:04:00,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:04:00,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:04:00,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:00,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:00,934 INFO L137 Inliner]: procedures = 145, calls = 317, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 519 [2022-02-20 19:04:00,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:04:00,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:04:00,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:04:00,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:04:00,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:00,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:00,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:00,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:01,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:01,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:01,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:01,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:04:01,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:04:01,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:04:01,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:04:01,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (1/1) ... [2022-02-20 19:04:01,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:04:01,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:04:01,093 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 19:04:01,118 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 19:04:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 19:04:01,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 19:04:01,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 19:04:01,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 19:04:01,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:04:01,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 19:04:01,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 19:04:01,127 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2022-02-20 19:04:01,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2022-02-20 19:04:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-02-20 19:04:01,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-02-20 19:04:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 19:04:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-02-20 19:04:01,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-02-20 19:04:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-02-20 19:04:01,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-02-20 19:04:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 19:04:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 19:04:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-02-20 19:04:01,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-02-20 19:04:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:04:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_destroy [2022-02-20 19:04:01,130 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_destroy [2022-02-20 19:04:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:04:01,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:04:01,299 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:04:01,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:04:04,046 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:04:04,055 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:04:04,055 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:04:04,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:04:04 BoogieIcfgContainer [2022-02-20 19:04:04,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:04:04,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:04:04,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:04:04,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:04:04,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:04:00" (1/3) ... [2022-02-20 19:04:04,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3f75ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:04:04, skipping insertion in model container [2022-02-20 19:04:04,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:04:00" (2/3) ... [2022-02-20 19:04:04,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3f75ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:04:04, skipping insertion in model container [2022-02-20 19:04:04,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:04:04" (3/3) ... [2022-02-20 19:04:04,062 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_time_var_mutex.i [2022-02-20 19:04:04,066 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:04:04,066 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 19:04:04,096 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:04:04,104 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 19:04:04,104 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 19:04:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 95 states have internal predecessors, (126), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-02-20 19:04:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-02-20 19:04:04,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:04:04,134 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:04:04,135 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:04:04,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:04:04,139 INFO L85 PathProgramCache]: Analyzing trace with hash -5089063, now seen corresponding path program 1 times [2022-02-20 19:04:04,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:04:04,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508054109] [2022-02-20 19:04:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:04,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:04:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 19:04:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #328#return; {152#false} is VALID [2022-02-20 19:04:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 19:04:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #330#return; {152#false} is VALID [2022-02-20 19:04:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 19:04:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #332#return; {152#false} is VALID [2022-02-20 19:04:46,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 19:04:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #334#return; {152#false} is VALID [2022-02-20 19:04:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 19:04:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #336#return; {152#false} is VALID [2022-02-20 19:04:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 19:04:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #338#return; {152#false} is VALID [2022-02-20 19:04:46,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 19:04:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #340#return; {152#false} is VALID [2022-02-20 19:04:46,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 19:04:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #342#return; {152#false} is VALID [2022-02-20 19:04:46,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 19:04:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #344#return; {152#false} is VALID [2022-02-20 19:04:46,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-20 19:04:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #346#return; {152#false} is VALID [2022-02-20 19:04:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-02-20 19:04:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #348#return; {152#false} is VALID [2022-02-20 19:04:46,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 19:04:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #350#return; {152#false} is VALID [2022-02-20 19:04:46,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-02-20 19:04:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #352#return; {152#false} is VALID [2022-02-20 19:04:46,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-02-20 19:04:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #354#return; {152#false} is VALID [2022-02-20 19:04:46,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-02-20 19:04:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #356#return; {152#false} is VALID [2022-02-20 19:04:46,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-02-20 19:04:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #358#return; {152#false} is VALID [2022-02-20 19:04:46,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-02-20 19:04:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #360#return; {152#false} is VALID [2022-02-20 19:04:46,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-02-20 19:04:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #362#return; {152#false} is VALID [2022-02-20 19:04:46,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-02-20 19:04:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #364#return; {152#false} is VALID [2022-02-20 19:04:46,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-02-20 19:04:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #366#return; {152#false} is VALID [2022-02-20 19:04:46,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-02-20 19:04:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #368#return; {152#false} is VALID [2022-02-20 19:04:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-02-20 19:04:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:04:46,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#false} {152#false} #370#return; {152#false} is VALID [2022-02-20 19:04:46,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet133#1, ULTIMATE.init_#t~nondet134#1, ULTIMATE.init_#t~nondet135#1, ULTIMATE.init_#t~nondet136#1, ULTIMATE.init_#t~nondet137#1, ULTIMATE.init_#t~nondet138#1, ULTIMATE.init_#t~nondet139#1, ULTIMATE.init_#t~nondet140#1, ULTIMATE.init_#t~nondet141#1, ULTIMATE.init_#t~nondet142#1, ULTIMATE.init_#t~nondet143#1, ULTIMATE.init_#t~nondet144#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(9, 5);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 6 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 7 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 8 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(36, 6);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 24 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 28 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 32 + ~#__CS_thread_lockedon~0.offset, 4);~#block~0.base, ~#block~0.offset := 7, 0;call #Ultimate.allocInit(12, 7);call write~init~int(0, ~#block~0.base, ~#block~0.offset, 4);call write~init~int(0, ~#block~0.base, 4 + ~#block~0.offset, 4);call write~init~int(0, ~#block~0.base, 8 + ~#block~0.offset, 4);~#busy~0.base, ~#busy~0.offset := 8, 0;call #Ultimate.allocInit(12, 8);call write~init~int(0, ~#busy~0.base, ~#busy~0.offset, 4);call write~init~int(0, ~#busy~0.base, 4 + ~#busy~0.offset, 4);call write~init~int(0, ~#busy~0.base, 8 + ~#busy~0.offset, 4);~#inode~0.base, ~#inode~0.offset := 9, 0;call #Ultimate.allocInit(12, 9);call write~init~int(0, ~#inode~0.base, ~#inode~0.offset, 4);call write~init~int(0, ~#inode~0.base, 4 + ~#inode~0.offset, 4);call write~init~int(0, ~#inode~0.base, 8 + ~#inode~0.offset, 4);~#m_inode~0.base, ~#m_inode~0.offset := 10, 0;call #Ultimate.allocInit(3, 10);call write~init~int(0, ~#m_inode~0.base, ~#m_inode~0.offset, 1);call write~init~int(0, ~#m_inode~0.base, 1 + ~#m_inode~0.offset, 1);call write~init~int(0, ~#m_inode~0.base, 2 + ~#m_inode~0.offset, 1);~#m_busy~0.base, ~#m_busy~0.offset := 11, 0;call #Ultimate.allocInit(3, 11);call write~init~int(0, ~#m_busy~0.base, ~#m_busy~0.offset, 1);call write~init~int(0, ~#m_busy~0.base, 1 + ~#m_busy~0.offset, 1);call write~init~int(0, ~#m_busy~0.base, 2 + ~#m_busy~0.offset, 1);~__CS_u~0.block := ~__CS_u~0.block[0 := 0];~__CS_u~0.block := ~__CS_u~0.block[1 := 0];~__CS_u~0.block := ~__CS_u~0.block[2 := 0];~__CS_u~0.busy := ~__CS_u~0.busy[0 := ULTIMATE.init_#t~nondet133#1];~__CS_u~0.busy := ~__CS_u~0.busy[1 := ULTIMATE.init_#t~nondet134#1];~__CS_u~0.busy := ~__CS_u~0.busy[2 := ULTIMATE.init_#t~nondet135#1];~__CS_u~0.inode := ~__CS_u~0.inode[0 := ULTIMATE.init_#t~nondet136#1];~__CS_u~0.inode := ~__CS_u~0.inode[1 := ULTIMATE.init_#t~nondet137#1];~__CS_u~0.inode := ~__CS_u~0.inode[2 := ULTIMATE.init_#t~nondet138#1];~__CS_u~0.m_inode := ~__CS_u~0.m_inode[0 := ULTIMATE.init_#t~nondet139#1];~__CS_u~0.m_inode := ~__CS_u~0.m_inode[1 := ULTIMATE.init_#t~nondet140#1];~__CS_u~0.m_inode := ~__CS_u~0.m_inode[2 := ULTIMATE.init_#t~nondet141#1];~__CS_u~0.m_busy := ~__CS_u~0.m_busy[0 := ULTIMATE.init_#t~nondet142#1];~__CS_u~0.m_busy := ~__CS_u~0.m_busy[1 := ULTIMATE.init_#t~nondet143#1];~__CS_u~0.m_busy := ~__CS_u~0.m_busy[2 := ULTIMATE.init_#t~nondet144#1];havoc ULTIMATE.init_#t~nondet133#1;havoc ULTIMATE.init_#t~nondet134#1;havoc ULTIMATE.init_#t~nondet135#1;havoc ULTIMATE.init_#t~nondet136#1;havoc ULTIMATE.init_#t~nondet137#1;havoc ULTIMATE.init_#t~nondet138#1;havoc ULTIMATE.init_#t~nondet139#1;havoc ULTIMATE.init_#t~nondet140#1;havoc ULTIMATE.init_#t~nondet141#1;havoc ULTIMATE.init_#t~nondet142#1;havoc ULTIMATE.init_#t~nondet143#1;havoc ULTIMATE.init_#t~nondet144#1; {151#true} is VALID [2022-02-20 19:04:46,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~post52#1, main_#t~post46#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1.base, main_#t~mem63#1.offset, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_#t~mem71#1, main_#t~mem72#1, main_#t~mem73#1, main_#t~mem74#1, main_#t~mem75#1, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~ret80#1.base, main_#t~ret80#1.offset, main_#t~mem81#1, main_#t~mem82#1, main_#t~ret84#1.base, main_#t~ret84#1.offset, main_#t~mem85#1, main_#t~mem86#1, main_#t~ret88#1.base, main_#t~ret88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_#t~mem97#1, main_#t~mem98#1, main_#t~mem99#1, main_#t~mem100#1, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1.base, main_#t~mem106#1.offset, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1.base, main_#t~mem109#1.offset, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~mem114#1, main_#t~mem115#1, main_#t~mem116#1, main_#t~mem117#1, main_#t~mem118#1, main_#t~mem119#1, main_#t~mem120#1, main_#t~mem121#1, main_#t~mem122#1, main_#t~mem123#1, main_#t~mem124#1, main_#t~mem125#1, main_#t~mem126#1, main_#t~mem127#1, main_#t~mem128#1, main_#t~mem129#1, main_#t~mem130#1, main_#t~mem131#1, main_#t~mem132#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_block~0#1.base, main_~#__CS_cp_block~0#1.offset, main_~#__CS_cp_busy~0#1.base, main_~#__CS_cp_busy~0#1.offset, main_~#__CS_cp_inode~0#1.base, main_~#__CS_cp_inode~0#1.offset, main_~#__CS_cp_m_inode~0#1.base, main_~#__CS_cp_m_inode~0#1.offset, main_~#__CS_cp_m_busy~0#1.base, main_~#__CS_cp_m_busy~0#1.offset, main_~i~0#1, main_~j~2#1;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(9);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(36);call main_~#__CS_cp_block~0#1.base, main_~#__CS_cp_block~0#1.offset := #Ultimate.allocOnStack(12);call main_~#__CS_cp_busy~0#1.base, main_~#__CS_cp_busy~0#1.offset := #Ultimate.allocOnStack(12);call main_~#__CS_cp_inode~0#1.base, main_~#__CS_cp_inode~0#1.offset := #Ultimate.allocOnStack(12);call main_~#__CS_cp_m_inode~0#1.base, main_~#__CS_cp_m_inode~0#1.offset := #Ultimate.allocOnStack(3);call main_~#__CS_cp_m_busy~0#1.base, main_~#__CS_cp_m_busy~0#1.offset := #Ultimate.allocOnStack(3);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {153#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 19:04:46,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {153#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 3); {152#false} is VALID [2022-02-20 19:04:46,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {152#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 6 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 6 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 7 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem58#1, ~#__CS_thread_status~0.base, 7 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 8 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem60#1, ~#__CS_thread_status~0.base, 8 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem60#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 24 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 24 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1.base, main_#t~mem63#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem63#1.base, main_#t~mem63#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem63#1.base, main_#t~mem63#1.offset;call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 28 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem64#1.base, main_#t~mem64#1.offset, ~#__CS_thread_lockedon~0.base, 28 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 32 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, ~#__CS_thread_lockedon~0.base, 32 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1 := read~int(main_~#__CS_cp_block~0#1.base, 4 + main_~#__CS_cp_block~0#1.offset, 4);call write~int(main_#t~mem67#1, ~#block~0.base, 4 + ~#block~0.offset, 4);havoc main_#t~mem67#1;call main_#t~mem68#1 := read~int(main_~#__CS_cp_block~0#1.base, 8 + main_~#__CS_cp_block~0#1.offset, 4);call write~int(main_#t~mem68#1, ~#block~0.base, 8 + ~#block~0.offset, 4);havoc main_#t~mem68#1;call main_#t~mem69#1 := read~int(main_~#__CS_cp_busy~0#1.base, 4 + main_~#__CS_cp_busy~0#1.offset, 4);call write~int(main_#t~mem69#1, ~#busy~0.base, 4 + ~#busy~0.offset, 4);havoc main_#t~mem69#1;call main_#t~mem70#1 := read~int(main_~#__CS_cp_busy~0#1.base, 8 + main_~#__CS_cp_busy~0#1.offset, 4);call write~int(main_#t~mem70#1, ~#busy~0.base, 8 + ~#busy~0.offset, 4);havoc main_#t~mem70#1;call main_#t~mem71#1 := read~int(main_~#__CS_cp_inode~0#1.base, 4 + main_~#__CS_cp_inode~0#1.offset, 4);call write~int(main_#t~mem71#1, ~#inode~0.base, 4 + ~#inode~0.offset, 4);havoc main_#t~mem71#1;call main_#t~mem72#1 := read~int(main_~#__CS_cp_inode~0#1.base, 8 + main_~#__CS_cp_inode~0#1.offset, 4);call write~int(main_#t~mem72#1, ~#inode~0.base, 8 + ~#inode~0.offset, 4);havoc main_#t~mem72#1;call main_#t~mem73#1 := read~int(main_~#__CS_cp_m_inode~0#1.base, 1 + main_~#__CS_cp_m_inode~0#1.offset, 1);call write~int(main_#t~mem73#1, ~#m_inode~0.base, 1 + ~#m_inode~0.offset, 1);havoc main_#t~mem73#1;call main_#t~mem74#1 := read~int(main_~#__CS_cp_m_inode~0#1.base, 2 + main_~#__CS_cp_m_inode~0#1.offset, 1);call write~int(main_#t~mem74#1, ~#m_inode~0.base, 2 + ~#m_inode~0.offset, 1);havoc main_#t~mem74#1;call main_#t~mem75#1 := read~int(main_~#__CS_cp_m_busy~0#1.base, 1 + main_~#__CS_cp_m_busy~0#1.offset, 1);call write~int(main_#t~mem75#1, ~#m_busy~0.base, 1 + ~#m_busy~0.offset, 1);havoc main_#t~mem75#1;call main_#t~mem76#1 := read~int(main_~#__CS_cp_m_busy~0#1.base, 2 + main_~#__CS_cp_m_busy~0#1.offset, 1);call write~int(main_#t~mem76#1, ~#m_busy~0.base, 2 + ~#m_busy~0.offset, 1);havoc main_#t~mem76#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem77#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#false} assume !(1 == main_#t~mem77#1 % 256);havoc main_#t~mem77#1; {152#false} is VALID [2022-02-20 19:04:46,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#false} call main_#t~mem81#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#false} assume !(1 == main_#t~mem81#1 % 256);havoc main_#t~mem81#1; {152#false} is VALID [2022-02-20 19:04:46,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#false} call main_#t~mem85#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#false} assume !(1 == main_#t~mem85#1 % 256);havoc main_#t~mem85#1; {152#false} is VALID [2022-02-20 19:04:46,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#false} call main_#t~mem89#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,943 INFO L272 TraceCheckUtils]: 10: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,946 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {152#false} {152#false} #328#return; {152#false} is VALID [2022-02-20 19:04:46,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {152#false} havoc main_#t~mem89#1;havoc main_#t~mem90#1;call main_#t~mem91#1 := read~int(~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 6 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,947 INFO L272 TraceCheckUtils]: 16: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,949 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {152#false} {152#false} #330#return; {152#false} is VALID [2022-02-20 19:04:46,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {152#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,949 INFO L272 TraceCheckUtils]: 22: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,951 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {152#false} {152#false} #332#return; {152#false} is VALID [2022-02-20 19:04:46,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {152#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem96#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 7 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,952 INFO L272 TraceCheckUtils]: 28: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem95#1 % 256 == main_#t~mem96#1 % 256 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,961 INFO L290 TraceCheckUtils]: 31: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,961 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {152#false} {152#false} #334#return; {152#false} is VALID [2022-02-20 19:04:46,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {152#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem98#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,964 INFO L272 TraceCheckUtils]: 34: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem97#1 % 256 == main_#t~mem98#1 % 256 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,965 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {152#false} {152#false} #336#return; {152#false} is VALID [2022-02-20 19:04:46,965 INFO L290 TraceCheckUtils]: 39: Hoare triple {152#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;call main_#t~mem99#1 := read~int(~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem100#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 8 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,966 INFO L272 TraceCheckUtils]: 40: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem99#1 % 256 == main_#t~mem100#1 % 256 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,967 INFO L290 TraceCheckUtils]: 42: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,967 INFO L290 TraceCheckUtils]: 43: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,967 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {152#false} {152#false} #338#return; {152#false} is VALID [2022-02-20 19:04:46,967 INFO L290 TraceCheckUtils]: 45: Hoare triple {152#false} havoc main_#t~mem99#1;havoc main_#t~mem100#1;call main_#t~mem101#1.base, main_#t~mem101#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem102#1.base, main_#t~mem102#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,968 INFO L272 TraceCheckUtils]: 46: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem101#1.base == main_#t~mem102#1.base && main_#t~mem101#1.offset == main_#t~mem102#1.offset then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,969 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {152#false} {152#false} #340#return; {152#false} is VALID [2022-02-20 19:04:46,969 INFO L290 TraceCheckUtils]: 51: Hoare triple {152#false} havoc main_#t~mem101#1.base, main_#t~mem101#1.offset;havoc main_#t~mem102#1.base, main_#t~mem102#1.offset;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 24 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,969 INFO L272 TraceCheckUtils]: 52: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem103#1.base == main_#t~mem104#1.base && main_#t~mem103#1.offset == main_#t~mem104#1.offset then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,970 INFO L290 TraceCheckUtils]: 53: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,970 INFO L290 TraceCheckUtils]: 54: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,973 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {152#false} {152#false} #342#return; {152#false} is VALID [2022-02-20 19:04:46,973 INFO L290 TraceCheckUtils]: 57: Hoare triple {152#false} havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem106#1.base, main_#t~mem106#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,973 INFO L272 TraceCheckUtils]: 58: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem105#1.base == main_#t~mem106#1.base && main_#t~mem105#1.offset == main_#t~mem106#1.offset then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,974 INFO L290 TraceCheckUtils]: 61: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,975 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {152#false} {152#false} #344#return; {152#false} is VALID [2022-02-20 19:04:46,975 INFO L290 TraceCheckUtils]: 63: Hoare triple {152#false} havoc main_#t~mem105#1.base, main_#t~mem105#1.offset;havoc main_#t~mem106#1.base, main_#t~mem106#1.offset;call main_#t~mem107#1.base, main_#t~mem107#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 28 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,977 INFO L272 TraceCheckUtils]: 64: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem107#1.base == main_#t~mem108#1.base && main_#t~mem107#1.offset == main_#t~mem108#1.offset then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,978 INFO L290 TraceCheckUtils]: 65: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,978 INFO L290 TraceCheckUtils]: 66: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,979 INFO L290 TraceCheckUtils]: 67: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,979 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {152#false} {152#false} #346#return; {152#false} is VALID [2022-02-20 19:04:46,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {152#false} havoc main_#t~mem107#1.base, main_#t~mem107#1.offset;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;call main_#t~mem109#1.base, main_#t~mem109#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem110#1.base, main_#t~mem110#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,980 INFO L272 TraceCheckUtils]: 70: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem109#1.base == main_#t~mem110#1.base && main_#t~mem109#1.offset == main_#t~mem110#1.offset then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,980 INFO L290 TraceCheckUtils]: 71: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,981 INFO L290 TraceCheckUtils]: 72: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,981 INFO L290 TraceCheckUtils]: 73: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,981 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {152#false} {152#false} #348#return; {152#false} is VALID [2022-02-20 19:04:46,981 INFO L290 TraceCheckUtils]: 75: Hoare triple {152#false} havoc main_#t~mem109#1.base, main_#t~mem109#1.offset;havoc main_#t~mem110#1.base, main_#t~mem110#1.offset;call main_#t~mem111#1.base, main_#t~mem111#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem112#1.base, main_#t~mem112#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 32 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,981 INFO L272 TraceCheckUtils]: 76: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem111#1.base == main_#t~mem112#1.base && main_#t~mem111#1.offset == main_#t~mem112#1.offset then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,981 INFO L290 TraceCheckUtils]: 77: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,982 INFO L290 TraceCheckUtils]: 78: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,982 INFO L290 TraceCheckUtils]: 79: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,983 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {152#false} {152#false} #350#return; {152#false} is VALID [2022-02-20 19:04:46,983 INFO L290 TraceCheckUtils]: 81: Hoare triple {152#false} havoc main_#t~mem111#1.base, main_#t~mem111#1.offset;havoc main_#t~mem112#1.base, main_#t~mem112#1.offset;call main_#t~mem113#1 := read~int(~#block~0.base, ~#block~0.offset, 4);call main_#t~mem114#1 := read~int(main_~#__CS_cp_block~0#1.base, 4 + main_~#__CS_cp_block~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,983 INFO L272 TraceCheckUtils]: 82: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem113#1 == main_#t~mem114#1 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,983 INFO L290 TraceCheckUtils]: 83: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,984 INFO L290 TraceCheckUtils]: 84: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,984 INFO L290 TraceCheckUtils]: 85: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,984 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {152#false} {152#false} #352#return; {152#false} is VALID [2022-02-20 19:04:46,984 INFO L290 TraceCheckUtils]: 87: Hoare triple {152#false} havoc main_#t~mem113#1;havoc main_#t~mem114#1;call main_#t~mem115#1 := read~int(~#block~0.base, 4 + ~#block~0.offset, 4);call main_#t~mem116#1 := read~int(main_~#__CS_cp_block~0#1.base, 8 + main_~#__CS_cp_block~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,985 INFO L272 TraceCheckUtils]: 88: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem115#1 == main_#t~mem116#1 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,985 INFO L290 TraceCheckUtils]: 89: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,986 INFO L290 TraceCheckUtils]: 90: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,987 INFO L290 TraceCheckUtils]: 91: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,987 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {152#false} {152#false} #354#return; {152#false} is VALID [2022-02-20 19:04:46,987 INFO L290 TraceCheckUtils]: 93: Hoare triple {152#false} havoc main_#t~mem115#1;havoc main_#t~mem116#1;call main_#t~mem117#1 := read~int(~#busy~0.base, ~#busy~0.offset, 4);call main_#t~mem118#1 := read~int(main_~#__CS_cp_busy~0#1.base, 4 + main_~#__CS_cp_busy~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,987 INFO L272 TraceCheckUtils]: 94: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem117#1 == main_#t~mem118#1 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,987 INFO L290 TraceCheckUtils]: 95: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,988 INFO L290 TraceCheckUtils]: 96: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,988 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {152#false} {152#false} #356#return; {152#false} is VALID [2022-02-20 19:04:46,988 INFO L290 TraceCheckUtils]: 99: Hoare triple {152#false} havoc main_#t~mem117#1;havoc main_#t~mem118#1;call main_#t~mem119#1 := read~int(~#busy~0.base, 4 + ~#busy~0.offset, 4);call main_#t~mem120#1 := read~int(main_~#__CS_cp_busy~0#1.base, 8 + main_~#__CS_cp_busy~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,989 INFO L272 TraceCheckUtils]: 100: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem119#1 == main_#t~mem120#1 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,989 INFO L290 TraceCheckUtils]: 101: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,989 INFO L290 TraceCheckUtils]: 102: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,989 INFO L290 TraceCheckUtils]: 103: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,990 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {152#false} {152#false} #358#return; {152#false} is VALID [2022-02-20 19:04:46,990 INFO L290 TraceCheckUtils]: 105: Hoare triple {152#false} havoc main_#t~mem119#1;havoc main_#t~mem120#1;call main_#t~mem121#1 := read~int(~#inode~0.base, ~#inode~0.offset, 4);call main_#t~mem122#1 := read~int(main_~#__CS_cp_inode~0#1.base, 4 + main_~#__CS_cp_inode~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,990 INFO L272 TraceCheckUtils]: 106: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem121#1 == main_#t~mem122#1 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,990 INFO L290 TraceCheckUtils]: 107: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,991 INFO L290 TraceCheckUtils]: 108: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,991 INFO L290 TraceCheckUtils]: 109: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,991 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {152#false} {152#false} #360#return; {152#false} is VALID [2022-02-20 19:04:46,991 INFO L290 TraceCheckUtils]: 111: Hoare triple {152#false} havoc main_#t~mem121#1;havoc main_#t~mem122#1;call main_#t~mem123#1 := read~int(~#inode~0.base, 4 + ~#inode~0.offset, 4);call main_#t~mem124#1 := read~int(main_~#__CS_cp_inode~0#1.base, 8 + main_~#__CS_cp_inode~0#1.offset, 4); {152#false} is VALID [2022-02-20 19:04:46,992 INFO L272 TraceCheckUtils]: 112: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem123#1 == main_#t~mem124#1 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,992 INFO L290 TraceCheckUtils]: 113: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,992 INFO L290 TraceCheckUtils]: 114: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,992 INFO L290 TraceCheckUtils]: 115: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,993 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {152#false} {152#false} #362#return; {152#false} is VALID [2022-02-20 19:04:46,993 INFO L290 TraceCheckUtils]: 117: Hoare triple {152#false} havoc main_#t~mem123#1;havoc main_#t~mem124#1;call main_#t~mem125#1 := read~int(~#m_inode~0.base, ~#m_inode~0.offset, 1);call main_#t~mem126#1 := read~int(main_~#__CS_cp_m_inode~0#1.base, 1 + main_~#__CS_cp_m_inode~0#1.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,993 INFO L272 TraceCheckUtils]: 118: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem125#1 % 256 == main_#t~mem126#1 % 256 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,993 INFO L290 TraceCheckUtils]: 119: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,994 INFO L290 TraceCheckUtils]: 120: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,994 INFO L290 TraceCheckUtils]: 121: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,994 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {152#false} {152#false} #364#return; {152#false} is VALID [2022-02-20 19:04:46,994 INFO L290 TraceCheckUtils]: 123: Hoare triple {152#false} havoc main_#t~mem125#1;havoc main_#t~mem126#1;call main_#t~mem127#1 := read~int(~#m_inode~0.base, 1 + ~#m_inode~0.offset, 1);call main_#t~mem128#1 := read~int(main_~#__CS_cp_m_inode~0#1.base, 2 + main_~#__CS_cp_m_inode~0#1.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,995 INFO L272 TraceCheckUtils]: 124: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem127#1 % 256 == main_#t~mem128#1 % 256 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,995 INFO L290 TraceCheckUtils]: 125: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,995 INFO L290 TraceCheckUtils]: 126: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,996 INFO L290 TraceCheckUtils]: 127: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,996 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {152#false} {152#false} #366#return; {152#false} is VALID [2022-02-20 19:04:46,996 INFO L290 TraceCheckUtils]: 129: Hoare triple {152#false} havoc main_#t~mem127#1;havoc main_#t~mem128#1;call main_#t~mem129#1 := read~int(~#m_busy~0.base, ~#m_busy~0.offset, 1);call main_#t~mem130#1 := read~int(main_~#__CS_cp_m_busy~0#1.base, 1 + main_~#__CS_cp_m_busy~0#1.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,996 INFO L272 TraceCheckUtils]: 130: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem129#1 % 256 == main_#t~mem130#1 % 256 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,996 INFO L290 TraceCheckUtils]: 131: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,997 INFO L290 TraceCheckUtils]: 132: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,997 INFO L290 TraceCheckUtils]: 133: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,997 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {152#false} {152#false} #368#return; {152#false} is VALID [2022-02-20 19:04:46,997 INFO L290 TraceCheckUtils]: 135: Hoare triple {152#false} havoc main_#t~mem129#1;havoc main_#t~mem130#1;call main_#t~mem131#1 := read~int(~#m_busy~0.base, 1 + ~#m_busy~0.offset, 1);call main_#t~mem132#1 := read~int(main_~#__CS_cp_m_busy~0#1.base, 2 + main_~#__CS_cp_m_busy~0#1.offset, 1); {152#false} is VALID [2022-02-20 19:04:46,998 INFO L272 TraceCheckUtils]: 136: Hoare triple {152#false} call assume_abort_if_not((if main_#t~mem131#1 % 256 == main_#t~mem132#1 % 256 then 1 else 0)); {151#true} is VALID [2022-02-20 19:04:46,998 INFO L290 TraceCheckUtils]: 137: Hoare triple {151#true} ~cond := #in~cond; {151#true} is VALID [2022-02-20 19:04:46,998 INFO L290 TraceCheckUtils]: 138: Hoare triple {151#true} assume 0 == ~cond;assume false; {152#false} is VALID [2022-02-20 19:04:46,998 INFO L290 TraceCheckUtils]: 139: Hoare triple {152#false} assume true; {152#false} is VALID [2022-02-20 19:04:46,999 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {152#false} {152#false} #370#return; {152#false} is VALID [2022-02-20 19:04:46,999 INFO L290 TraceCheckUtils]: 141: Hoare triple {152#false} havoc main_#t~mem131#1;havoc main_#t~mem132#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {152#false} is VALID [2022-02-20 19:04:47,000 INFO L290 TraceCheckUtils]: 142: Hoare triple {152#false} assume 0 == __VERIFIER_assert_~cond#1; {152#false} is VALID [2022-02-20 19:04:47,000 INFO L290 TraceCheckUtils]: 143: Hoare triple {152#false} assume !false; {152#false} is VALID [2022-02-20 19:04:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-02-20 19:04:47,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:04:47,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508054109] [2022-02-20 19:04:47,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508054109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:04:47,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:04:47,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:04:47,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413176043] [2022-02-20 19:04:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:04:47,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2022-02-20 19:04:47,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:04:47,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-02-20 19:04:47,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:47,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:04:47,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:04:47,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:04:47,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:04:47,130 INFO L87 Difference]: Start difference. First operand has 148 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 95 states have internal predecessors, (126), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-02-20 19:04:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:51,723 INFO L93 Difference]: Finished difference Result 298 states and 477 transitions. [2022-02-20 19:04:51,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:04:51,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2022-02-20 19:04:51,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:04:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-02-20 19:04:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2022-02-20 19:04:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-02-20 19:04:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2022-02-20 19:04:51,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 477 transitions. [2022-02-20 19:04:52,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:04:52,239 INFO L225 Difference]: With dead ends: 298 [2022-02-20 19:04:52,240 INFO L226 Difference]: Without dead ends: 148 [2022-02-20 19:04:52,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:04:52,250 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:04:52,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 416 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:04:52,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-02-20 19:04:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2022-02-20 19:04:52,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:04:52,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 145 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-02-20 19:04:52,309 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 145 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-02-20 19:04:52,312 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 145 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-02-20 19:04:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:52,331 INFO L93 Difference]: Finished difference Result 148 states and 213 transitions. [2022-02-20 19:04:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 213 transitions. [2022-02-20 19:04:52,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:52,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:52,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand 148 states. [2022-02-20 19:04:52,343 INFO L87 Difference]: Start difference. First operand has 145 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand 148 states. [2022-02-20 19:04:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:04:52,358 INFO L93 Difference]: Finished difference Result 148 states and 213 transitions. [2022-02-20 19:04:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 213 transitions. [2022-02-20 19:04:52,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:04:52,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:04:52,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:04:52,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:04:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-02-20 19:04:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 209 transitions. [2022-02-20 19:04:52,374 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 209 transitions. Word has length 144 [2022-02-20 19:04:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:04:52,375 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 209 transitions. [2022-02-20 19:04:52,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-02-20 19:04:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 209 transitions. [2022-02-20 19:04:52,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-02-20 19:04:52,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:04:52,380 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:04:52,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:04:52,380 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:04:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:04:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2025126427, now seen corresponding path program 1 times [2022-02-20 19:04:52,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:04:52,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364582190] [2022-02-20 19:04:52,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:04:52,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:04:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 19:05:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #328#return; {1154#false} is VALID [2022-02-20 19:05:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 19:05:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #330#return; {1154#false} is VALID [2022-02-20 19:05:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 19:05:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #332#return; {1154#false} is VALID [2022-02-20 19:05:00,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-20 19:05:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #334#return; {1154#false} is VALID [2022-02-20 19:05:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-02-20 19:05:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #336#return; {1154#false} is VALID [2022-02-20 19:05:00,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 19:05:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #338#return; {1154#false} is VALID [2022-02-20 19:05:00,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 19:05:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #340#return; {1154#false} is VALID [2022-02-20 19:05:00,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 19:05:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #342#return; {1154#false} is VALID [2022-02-20 19:05:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 19:05:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #344#return; {1154#false} is VALID [2022-02-20 19:05:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 19:05:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #346#return; {1154#false} is VALID [2022-02-20 19:05:00,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 19:05:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #348#return; {1154#false} is VALID [2022-02-20 19:05:00,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-02-20 19:05:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #350#return; {1154#false} is VALID [2022-02-20 19:05:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-02-20 19:05:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #352#return; {1154#false} is VALID [2022-02-20 19:05:00,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-02-20 19:05:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #354#return; {1154#false} is VALID [2022-02-20 19:05:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-02-20 19:05:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #356#return; {1154#false} is VALID [2022-02-20 19:05:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-02-20 19:05:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #358#return; {1154#false} is VALID [2022-02-20 19:05:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-02-20 19:05:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #360#return; {1154#false} is VALID [2022-02-20 19:05:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-02-20 19:05:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #362#return; {1154#false} is VALID [2022-02-20 19:05:00,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-02-20 19:05:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #364#return; {1154#false} is VALID [2022-02-20 19:05:00,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-02-20 19:05:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #366#return; {1154#false} is VALID [2022-02-20 19:05:00,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-02-20 19:05:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #368#return; {1154#false} is VALID [2022-02-20 19:05:00,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-02-20 19:05:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:05:00,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1153#true} {1154#false} #370#return; {1154#false} is VALID [2022-02-20 19:05:00,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} assume { :begin_inline_ULTIMATE.init } true;havoc ULTIMATE.init_#t~nondet133#1, ULTIMATE.init_#t~nondet134#1, ULTIMATE.init_#t~nondet135#1, ULTIMATE.init_#t~nondet136#1, ULTIMATE.init_#t~nondet137#1, ULTIMATE.init_#t~nondet138#1, ULTIMATE.init_#t~nondet139#1, ULTIMATE.init_#t~nondet140#1, ULTIMATE.init_#t~nondet141#1, ULTIMATE.init_#t~nondet142#1, ULTIMATE.init_#t~nondet143#1, ULTIMATE.init_#t~nondet144#1;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);~__CS_round~0 := 0;~__CS_ret~0 := 0;~__CS_ret_PREEMPTED~0 := 1;~__CS_ret_ERROR~0 := 2;~__CS_ret_FINISHED~0 := 4;~__CS_error~0 := 0;~__CS_thread_index~0 := 0;~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset := 3, 0;call #Ultimate.allocInit(3, 3);call write~init~int(0, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1);call write~init~int(0, ~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1);~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset := 4, 0;call #Ultimate.allocInit(3, 4);call write~init~int(0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 1 + ~#__CS_thread_born_round~0.offset, 1);call write~init~int(0, ~#__CS_thread_born_round~0.base, 2 + ~#__CS_thread_born_round~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := 0], ~__CS_thread~0.offset[0 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[1 := 0], ~__CS_thread~0.offset[1 := 0];~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[2 := 0], ~__CS_thread~0.offset[2 := 0];~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset := 5, 0;call #Ultimate.allocInit(9, 5);call write~init~int(0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 6 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 7 + ~#__CS_thread_status~0.offset, 1);call write~init~int(0, ~#__CS_thread_status~0.base, 8 + ~#__CS_thread_status~0.offset, 1);~__THREAD_UNUSED~0 := 0;~__THREAD_RUNNING~0 := 1;~__THREAD_FINISHED~0 := 2;~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset := 6, 0;call #Ultimate.allocInit(36, 6);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 24 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 28 + ~#__CS_thread_lockedon~0.offset, 4);call write~init~$Pointer$(0, 0, ~#__CS_thread_lockedon~0.base, 32 + ~#__CS_thread_lockedon~0.offset, 4);~#block~0.base, ~#block~0.offset := 7, 0;call #Ultimate.allocInit(12, 7);call write~init~int(0, ~#block~0.base, ~#block~0.offset, 4);call write~init~int(0, ~#block~0.base, 4 + ~#block~0.offset, 4);call write~init~int(0, ~#block~0.base, 8 + ~#block~0.offset, 4);~#busy~0.base, ~#busy~0.offset := 8, 0;call #Ultimate.allocInit(12, 8);call write~init~int(0, ~#busy~0.base, ~#busy~0.offset, 4);call write~init~int(0, ~#busy~0.base, 4 + ~#busy~0.offset, 4);call write~init~int(0, ~#busy~0.base, 8 + ~#busy~0.offset, 4);~#inode~0.base, ~#inode~0.offset := 9, 0;call #Ultimate.allocInit(12, 9);call write~init~int(0, ~#inode~0.base, ~#inode~0.offset, 4);call write~init~int(0, ~#inode~0.base, 4 + ~#inode~0.offset, 4);call write~init~int(0, ~#inode~0.base, 8 + ~#inode~0.offset, 4);~#m_inode~0.base, ~#m_inode~0.offset := 10, 0;call #Ultimate.allocInit(3, 10);call write~init~int(0, ~#m_inode~0.base, ~#m_inode~0.offset, 1);call write~init~int(0, ~#m_inode~0.base, 1 + ~#m_inode~0.offset, 1);call write~init~int(0, ~#m_inode~0.base, 2 + ~#m_inode~0.offset, 1);~#m_busy~0.base, ~#m_busy~0.offset := 11, 0;call #Ultimate.allocInit(3, 11);call write~init~int(0, ~#m_busy~0.base, ~#m_busy~0.offset, 1);call write~init~int(0, ~#m_busy~0.base, 1 + ~#m_busy~0.offset, 1);call write~init~int(0, ~#m_busy~0.base, 2 + ~#m_busy~0.offset, 1);~__CS_u~0.block := ~__CS_u~0.block[0 := 0];~__CS_u~0.block := ~__CS_u~0.block[1 := 0];~__CS_u~0.block := ~__CS_u~0.block[2 := 0];~__CS_u~0.busy := ~__CS_u~0.busy[0 := ULTIMATE.init_#t~nondet133#1];~__CS_u~0.busy := ~__CS_u~0.busy[1 := ULTIMATE.init_#t~nondet134#1];~__CS_u~0.busy := ~__CS_u~0.busy[2 := ULTIMATE.init_#t~nondet135#1];~__CS_u~0.inode := ~__CS_u~0.inode[0 := ULTIMATE.init_#t~nondet136#1];~__CS_u~0.inode := ~__CS_u~0.inode[1 := ULTIMATE.init_#t~nondet137#1];~__CS_u~0.inode := ~__CS_u~0.inode[2 := ULTIMATE.init_#t~nondet138#1];~__CS_u~0.m_inode := ~__CS_u~0.m_inode[0 := ULTIMATE.init_#t~nondet139#1];~__CS_u~0.m_inode := ~__CS_u~0.m_inode[1 := ULTIMATE.init_#t~nondet140#1];~__CS_u~0.m_inode := ~__CS_u~0.m_inode[2 := ULTIMATE.init_#t~nondet141#1];~__CS_u~0.m_busy := ~__CS_u~0.m_busy[0 := ULTIMATE.init_#t~nondet142#1];~__CS_u~0.m_busy := ~__CS_u~0.m_busy[1 := ULTIMATE.init_#t~nondet143#1];~__CS_u~0.m_busy := ~__CS_u~0.m_busy[2 := ULTIMATE.init_#t~nondet144#1];havoc ULTIMATE.init_#t~nondet133#1;havoc ULTIMATE.init_#t~nondet134#1;havoc ULTIMATE.init_#t~nondet135#1;havoc ULTIMATE.init_#t~nondet136#1;havoc ULTIMATE.init_#t~nondet137#1;havoc ULTIMATE.init_#t~nondet138#1;havoc ULTIMATE.init_#t~nondet139#1;havoc ULTIMATE.init_#t~nondet140#1;havoc ULTIMATE.init_#t~nondet141#1;havoc ULTIMATE.init_#t~nondet142#1;havoc ULTIMATE.init_#t~nondet143#1;havoc ULTIMATE.init_#t~nondet144#1; {1153#true} is VALID [2022-02-20 19:05:00,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~post52#1, main_#t~post46#1, main_#t~mem55#1, main_#t~mem56#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~mem59#1, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1.base, main_#t~mem63#1.offset, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_#t~mem71#1, main_#t~mem72#1, main_#t~mem73#1, main_#t~mem74#1, main_#t~mem75#1, main_#t~mem76#1, main_#t~mem77#1, main_#t~mem78#1, main_#t~ret80#1.base, main_#t~ret80#1.offset, main_#t~mem81#1, main_#t~mem82#1, main_#t~ret84#1.base, main_#t~ret84#1.offset, main_#t~mem85#1, main_#t~mem86#1, main_#t~ret88#1.base, main_#t~ret88#1.offset, main_#t~mem89#1, main_#t~mem90#1, main_#t~mem91#1, main_#t~mem92#1, main_#t~mem93#1, main_#t~mem94#1, main_#t~mem95#1, main_#t~mem96#1, main_#t~mem97#1, main_#t~mem98#1, main_#t~mem99#1, main_#t~mem100#1, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1.base, main_#t~mem106#1.offset, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1.base, main_#t~mem109#1.offset, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~mem114#1, main_#t~mem115#1, main_#t~mem116#1, main_#t~mem117#1, main_#t~mem118#1, main_#t~mem119#1, main_#t~mem120#1, main_#t~mem121#1, main_#t~mem122#1, main_#t~mem123#1, main_#t~mem124#1, main_#t~mem125#1, main_#t~mem126#1, main_#t~mem127#1, main_#t~mem128#1, main_#t~mem129#1, main_#t~mem130#1, main_#t~mem131#1, main_#t~mem132#1, main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset, main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset, main_~#__CS_cp_block~0#1.base, main_~#__CS_cp_block~0#1.offset, main_~#__CS_cp_busy~0#1.base, main_~#__CS_cp_busy~0#1.offset, main_~#__CS_cp_inode~0#1.base, main_~#__CS_cp_inode~0#1.offset, main_~#__CS_cp_m_inode~0#1.base, main_~#__CS_cp_m_inode~0#1.offset, main_~#__CS_cp_m_busy~0#1.base, main_~#__CS_cp_m_busy~0#1.offset, main_~i~0#1, main_~j~2#1;call main_~#__CS_cp___CS_thread_status~0#1.base, main_~#__CS_cp___CS_thread_status~0#1.offset := #Ultimate.allocOnStack(9);call main_~#__CS_cp___CS_thread_lockedon~0#1.base, main_~#__CS_cp___CS_thread_lockedon~0#1.offset := #Ultimate.allocOnStack(36);call main_~#__CS_cp_block~0#1.base, main_~#__CS_cp_block~0#1.offset := #Ultimate.allocOnStack(12);call main_~#__CS_cp_busy~0#1.base, main_~#__CS_cp_busy~0#1.offset := #Ultimate.allocOnStack(12);call main_~#__CS_cp_inode~0#1.base, main_~#__CS_cp_inode~0#1.offset := #Ultimate.allocOnStack(12);call main_~#__CS_cp_m_inode~0#1.base, main_~#__CS_cp_m_inode~0#1.offset := #Ultimate.allocOnStack(3);call main_~#__CS_cp_m_busy~0#1.base, main_~#__CS_cp_m_busy~0#1.offset := #Ultimate.allocOnStack(3);havoc main_~i~0#1;havoc main_~j~2#1;main_~i~0#1 := 0; {1153#true} is VALID [2022-02-20 19:05:00,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {1153#true} assume !!(main_~i~0#1 < 3);assume -2147483648 <= main_#t~nondet47#1 && main_#t~nondet47#1 <= 2147483647;call write~int(main_#t~nondet47#1, main_~#__CS_cp_block~0#1.base, main_~#__CS_cp_block~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet47#1;assume -2147483648 <= main_#t~nondet48#1 && main_#t~nondet48#1 <= 2147483647;call write~int(main_#t~nondet48#1, main_~#__CS_cp_busy~0#1.base, main_~#__CS_cp_busy~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet48#1;assume -2147483648 <= main_#t~nondet49#1 && main_#t~nondet49#1 <= 2147483647;call write~int(main_#t~nondet49#1, main_~#__CS_cp_inode~0#1.base, main_~#__CS_cp_inode~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet49#1;call write~int(main_#t~nondet50#1, main_~#__CS_cp_m_inode~0#1.base, main_~#__CS_cp_m_inode~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet50#1;call write~int(main_#t~nondet51#1, main_~#__CS_cp_m_busy~0#1.base, main_~#__CS_cp_m_busy~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet51#1;main_~j~2#1 := 0; {1155#(= |ULTIMATE.start_main_~j~2#1| 0)} is VALID [2022-02-20 19:05:00,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {1155#(= |ULTIMATE.start_main_~j~2#1| 0)} assume !(main_~j~2#1 < 3); {1154#false} is VALID [2022-02-20 19:05:00,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {1154#false} main_#t~post46#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post46#1;havoc main_#t~post46#1; {1154#false} is VALID [2022-02-20 19:05:00,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {1154#false} assume !(main_~i~0#1 < 3); {1154#false} is VALID [2022-02-20 19:05:00,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {1154#false} call main_#t~mem55#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem55#1, ~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem55#1;call main_#t~mem56#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 6 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem56#1, ~#__CS_thread_status~0.base, 6 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem56#1;call main_#t~mem57#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem57#1, ~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem57#1;call main_#t~mem58#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 7 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem58#1, ~#__CS_thread_status~0.base, 7 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem58#1;call main_#t~mem59#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem59#1, ~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem59#1;call main_#t~mem60#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 8 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1);call write~int(main_#t~mem60#1, ~#__CS_thread_status~0.base, 8 + ~#__CS_thread_status~0.offset, 1);havoc main_#t~mem60#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, ~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;call main_#t~mem62#1.base, main_#t~mem62#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 24 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem62#1.base, main_#t~mem62#1.offset, ~#__CS_thread_lockedon~0.base, 24 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1.base, main_#t~mem63#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem63#1.base, main_#t~mem63#1.offset, ~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem63#1.base, main_#t~mem63#1.offset;call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 28 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem64#1.base, main_#t~mem64#1.offset, ~#__CS_thread_lockedon~0.base, 28 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, ~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 32 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4);call write~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, ~#__CS_thread_lockedon~0.base, 32 + ~#__CS_thread_lockedon~0.offset, 4);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1 := read~int(main_~#__CS_cp_block~0#1.base, 4 + main_~#__CS_cp_block~0#1.offset, 4);call write~int(main_#t~mem67#1, ~#block~0.base, 4 + ~#block~0.offset, 4);havoc main_#t~mem67#1;call main_#t~mem68#1 := read~int(main_~#__CS_cp_block~0#1.base, 8 + main_~#__CS_cp_block~0#1.offset, 4);call write~int(main_#t~mem68#1, ~#block~0.base, 8 + ~#block~0.offset, 4);havoc main_#t~mem68#1;call main_#t~mem69#1 := read~int(main_~#__CS_cp_busy~0#1.base, 4 + main_~#__CS_cp_busy~0#1.offset, 4);call write~int(main_#t~mem69#1, ~#busy~0.base, 4 + ~#busy~0.offset, 4);havoc main_#t~mem69#1;call main_#t~mem70#1 := read~int(main_~#__CS_cp_busy~0#1.base, 8 + main_~#__CS_cp_busy~0#1.offset, 4);call write~int(main_#t~mem70#1, ~#busy~0.base, 8 + ~#busy~0.offset, 4);havoc main_#t~mem70#1;call main_#t~mem71#1 := read~int(main_~#__CS_cp_inode~0#1.base, 4 + main_~#__CS_cp_inode~0#1.offset, 4);call write~int(main_#t~mem71#1, ~#inode~0.base, 4 + ~#inode~0.offset, 4);havoc main_#t~mem71#1;call main_#t~mem72#1 := read~int(main_~#__CS_cp_inode~0#1.base, 8 + main_~#__CS_cp_inode~0#1.offset, 4);call write~int(main_#t~mem72#1, ~#inode~0.base, 8 + ~#inode~0.offset, 4);havoc main_#t~mem72#1;call main_#t~mem73#1 := read~int(main_~#__CS_cp_m_inode~0#1.base, 1 + main_~#__CS_cp_m_inode~0#1.offset, 1);call write~int(main_#t~mem73#1, ~#m_inode~0.base, 1 + ~#m_inode~0.offset, 1);havoc main_#t~mem73#1;call main_#t~mem74#1 := read~int(main_~#__CS_cp_m_inode~0#1.base, 2 + main_~#__CS_cp_m_inode~0#1.offset, 1);call write~int(main_#t~mem74#1, ~#m_inode~0.base, 2 + ~#m_inode~0.offset, 1);havoc main_#t~mem74#1;call main_#t~mem75#1 := read~int(main_~#__CS_cp_m_busy~0#1.base, 1 + main_~#__CS_cp_m_busy~0#1.offset, 1);call write~int(main_#t~mem75#1, ~#m_busy~0.base, 1 + ~#m_busy~0.offset, 1);havoc main_#t~mem75#1;call main_#t~mem76#1 := read~int(main_~#__CS_cp_m_busy~0#1.base, 2 + main_~#__CS_cp_m_busy~0#1.offset, 1);call write~int(main_#t~mem76#1, ~#m_busy~0.base, 2 + ~#m_busy~0.offset, 1);havoc main_#t~mem76#1;~__CS_round~0 := 0;~__CS_thread_index~0 := 0;call write~int(~__CS_round~0, ~#__CS_thread_born_round~0.base, ~#__CS_thread_born_round~0.offset, 1);call write~int(~__THREAD_RUNNING~0, ~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);~__CS_thread~0.base, ~__CS_thread~0.offset := ~__CS_thread~0.base[0 := #funAddr~main_thread.base], ~__CS_thread~0.offset[0 := #funAddr~main_thread.offset];call write~int(1, ~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1);call main_#t~mem77#1 := read~int(~#__CS_thread_allocated~0.base, ~#__CS_thread_allocated~0.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {1154#false} assume !(1 == main_#t~mem77#1 % 256);havoc main_#t~mem77#1; {1154#false} is VALID [2022-02-20 19:05:00,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {1154#false} call main_#t~mem81#1 := read~int(~#__CS_thread_allocated~0.base, 1 + ~#__CS_thread_allocated~0.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {1154#false} assume !(1 == main_#t~mem81#1 % 256);havoc main_#t~mem81#1; {1154#false} is VALID [2022-02-20 19:05:00,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {1154#false} call main_#t~mem85#1 := read~int(~#__CS_thread_allocated~0.base, 2 + ~#__CS_thread_allocated~0.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {1154#false} assume !(1 == main_#t~mem85#1 % 256);havoc main_#t~mem85#1; {1154#false} is VALID [2022-02-20 19:05:00,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#false} call main_#t~mem89#1 := read~int(~#__CS_thread_status~0.base, ~#__CS_thread_status~0.offset, 1);call main_#t~mem90#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 3 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,484 INFO L272 TraceCheckUtils]: 13: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem89#1 % 256 == main_#t~mem90#1 % 256 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,485 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1153#true} {1154#false} #328#return; {1154#false} is VALID [2022-02-20 19:05:00,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {1154#false} havoc main_#t~mem89#1;havoc main_#t~mem90#1;call main_#t~mem91#1 := read~int(~#__CS_thread_status~0.base, 3 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem92#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 6 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,485 INFO L272 TraceCheckUtils]: 19: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem91#1 % 256 == main_#t~mem92#1 % 256 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,486 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1153#true} {1154#false} #330#return; {1154#false} is VALID [2022-02-20 19:05:00,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {1154#false} havoc main_#t~mem91#1;havoc main_#t~mem92#1;call main_#t~mem93#1 := read~int(~#__CS_thread_status~0.base, 1 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem94#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 4 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,486 INFO L272 TraceCheckUtils]: 25: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem93#1 % 256 == main_#t~mem94#1 % 256 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,487 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1153#true} {1154#false} #332#return; {1154#false} is VALID [2022-02-20 19:05:00,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {1154#false} havoc main_#t~mem93#1;havoc main_#t~mem94#1;call main_#t~mem95#1 := read~int(~#__CS_thread_status~0.base, 4 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem96#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 7 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,487 INFO L272 TraceCheckUtils]: 31: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem95#1 % 256 == main_#t~mem96#1 % 256 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,488 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1153#true} {1154#false} #334#return; {1154#false} is VALID [2022-02-20 19:05:00,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {1154#false} havoc main_#t~mem95#1;havoc main_#t~mem96#1;call main_#t~mem97#1 := read~int(~#__CS_thread_status~0.base, 2 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem98#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 5 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,488 INFO L272 TraceCheckUtils]: 37: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem97#1 % 256 == main_#t~mem98#1 % 256 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,488 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1153#true} {1154#false} #336#return; {1154#false} is VALID [2022-02-20 19:05:00,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {1154#false} havoc main_#t~mem97#1;havoc main_#t~mem98#1;call main_#t~mem99#1 := read~int(~#__CS_thread_status~0.base, 5 + ~#__CS_thread_status~0.offset, 1);call main_#t~mem100#1 := read~int(main_~#__CS_cp___CS_thread_status~0#1.base, 8 + main_~#__CS_cp___CS_thread_status~0#1.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,489 INFO L272 TraceCheckUtils]: 43: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem99#1 % 256 == main_#t~mem100#1 % 256 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,489 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {1153#true} {1154#false} #338#return; {1154#false} is VALID [2022-02-20 19:05:00,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {1154#false} havoc main_#t~mem99#1;havoc main_#t~mem100#1;call main_#t~mem101#1.base, main_#t~mem101#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem102#1.base, main_#t~mem102#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 12 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,490 INFO L272 TraceCheckUtils]: 49: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem101#1.base == main_#t~mem102#1.base && main_#t~mem101#1.offset == main_#t~mem102#1.offset then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,493 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1153#true} {1154#false} #340#return; {1154#false} is VALID [2022-02-20 19:05:00,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {1154#false} havoc main_#t~mem101#1.base, main_#t~mem101#1.offset;havoc main_#t~mem102#1.base, main_#t~mem102#1.offset;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 12 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 24 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,495 INFO L272 TraceCheckUtils]: 55: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem103#1.base == main_#t~mem104#1.base && main_#t~mem103#1.offset == main_#t~mem104#1.offset then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,495 INFO L290 TraceCheckUtils]: 58: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,495 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {1153#true} {1154#false} #342#return; {1154#false} is VALID [2022-02-20 19:05:00,496 INFO L290 TraceCheckUtils]: 60: Hoare triple {1154#false} havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 4 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem106#1.base, main_#t~mem106#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 16 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,496 INFO L272 TraceCheckUtils]: 61: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem105#1.base == main_#t~mem106#1.base && main_#t~mem105#1.offset == main_#t~mem106#1.offset then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,496 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {1153#true} {1154#false} #344#return; {1154#false} is VALID [2022-02-20 19:05:00,496 INFO L290 TraceCheckUtils]: 66: Hoare triple {1154#false} havoc main_#t~mem105#1.base, main_#t~mem105#1.offset;havoc main_#t~mem106#1.base, main_#t~mem106#1.offset;call main_#t~mem107#1.base, main_#t~mem107#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 16 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 28 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,497 INFO L272 TraceCheckUtils]: 67: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem107#1.base == main_#t~mem108#1.base && main_#t~mem107#1.offset == main_#t~mem108#1.offset then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,497 INFO L290 TraceCheckUtils]: 69: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,497 INFO L290 TraceCheckUtils]: 70: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,497 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {1153#true} {1154#false} #346#return; {1154#false} is VALID [2022-02-20 19:05:00,497 INFO L290 TraceCheckUtils]: 72: Hoare triple {1154#false} havoc main_#t~mem107#1.base, main_#t~mem107#1.offset;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;call main_#t~mem109#1.base, main_#t~mem109#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 8 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem110#1.base, main_#t~mem110#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 20 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,497 INFO L272 TraceCheckUtils]: 73: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem109#1.base == main_#t~mem110#1.base && main_#t~mem109#1.offset == main_#t~mem110#1.offset then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,497 INFO L290 TraceCheckUtils]: 74: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,498 INFO L290 TraceCheckUtils]: 75: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,498 INFO L290 TraceCheckUtils]: 76: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,498 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {1153#true} {1154#false} #348#return; {1154#false} is VALID [2022-02-20 19:05:00,498 INFO L290 TraceCheckUtils]: 78: Hoare triple {1154#false} havoc main_#t~mem109#1.base, main_#t~mem109#1.offset;havoc main_#t~mem110#1.base, main_#t~mem110#1.offset;call main_#t~mem111#1.base, main_#t~mem111#1.offset := read~$Pointer$(~#__CS_thread_lockedon~0.base, 20 + ~#__CS_thread_lockedon~0.offset, 4);call main_#t~mem112#1.base, main_#t~mem112#1.offset := read~$Pointer$(main_~#__CS_cp___CS_thread_lockedon~0#1.base, 32 + main_~#__CS_cp___CS_thread_lockedon~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,498 INFO L272 TraceCheckUtils]: 79: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem111#1.base == main_#t~mem112#1.base && main_#t~mem111#1.offset == main_#t~mem112#1.offset then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,498 INFO L290 TraceCheckUtils]: 80: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,498 INFO L290 TraceCheckUtils]: 81: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,498 INFO L290 TraceCheckUtils]: 82: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,499 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {1153#true} {1154#false} #350#return; {1154#false} is VALID [2022-02-20 19:05:00,499 INFO L290 TraceCheckUtils]: 84: Hoare triple {1154#false} havoc main_#t~mem111#1.base, main_#t~mem111#1.offset;havoc main_#t~mem112#1.base, main_#t~mem112#1.offset;call main_#t~mem113#1 := read~int(~#block~0.base, ~#block~0.offset, 4);call main_#t~mem114#1 := read~int(main_~#__CS_cp_block~0#1.base, 4 + main_~#__CS_cp_block~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,499 INFO L272 TraceCheckUtils]: 85: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem113#1 == main_#t~mem114#1 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,499 INFO L290 TraceCheckUtils]: 86: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,499 INFO L290 TraceCheckUtils]: 87: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,499 INFO L290 TraceCheckUtils]: 88: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,499 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {1153#true} {1154#false} #352#return; {1154#false} is VALID [2022-02-20 19:05:00,500 INFO L290 TraceCheckUtils]: 90: Hoare triple {1154#false} havoc main_#t~mem113#1;havoc main_#t~mem114#1;call main_#t~mem115#1 := read~int(~#block~0.base, 4 + ~#block~0.offset, 4);call main_#t~mem116#1 := read~int(main_~#__CS_cp_block~0#1.base, 8 + main_~#__CS_cp_block~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,500 INFO L272 TraceCheckUtils]: 91: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem115#1 == main_#t~mem116#1 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,500 INFO L290 TraceCheckUtils]: 92: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,501 INFO L290 TraceCheckUtils]: 93: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,501 INFO L290 TraceCheckUtils]: 94: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,501 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {1153#true} {1154#false} #354#return; {1154#false} is VALID [2022-02-20 19:05:00,501 INFO L290 TraceCheckUtils]: 96: Hoare triple {1154#false} havoc main_#t~mem115#1;havoc main_#t~mem116#1;call main_#t~mem117#1 := read~int(~#busy~0.base, ~#busy~0.offset, 4);call main_#t~mem118#1 := read~int(main_~#__CS_cp_busy~0#1.base, 4 + main_~#__CS_cp_busy~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,501 INFO L272 TraceCheckUtils]: 97: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem117#1 == main_#t~mem118#1 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,501 INFO L290 TraceCheckUtils]: 98: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,501 INFO L290 TraceCheckUtils]: 99: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,501 INFO L290 TraceCheckUtils]: 100: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,502 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {1153#true} {1154#false} #356#return; {1154#false} is VALID [2022-02-20 19:05:00,502 INFO L290 TraceCheckUtils]: 102: Hoare triple {1154#false} havoc main_#t~mem117#1;havoc main_#t~mem118#1;call main_#t~mem119#1 := read~int(~#busy~0.base, 4 + ~#busy~0.offset, 4);call main_#t~mem120#1 := read~int(main_~#__CS_cp_busy~0#1.base, 8 + main_~#__CS_cp_busy~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,502 INFO L272 TraceCheckUtils]: 103: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem119#1 == main_#t~mem120#1 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,502 INFO L290 TraceCheckUtils]: 104: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,502 INFO L290 TraceCheckUtils]: 105: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,502 INFO L290 TraceCheckUtils]: 106: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,502 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {1153#true} {1154#false} #358#return; {1154#false} is VALID [2022-02-20 19:05:00,502 INFO L290 TraceCheckUtils]: 108: Hoare triple {1154#false} havoc main_#t~mem119#1;havoc main_#t~mem120#1;call main_#t~mem121#1 := read~int(~#inode~0.base, ~#inode~0.offset, 4);call main_#t~mem122#1 := read~int(main_~#__CS_cp_inode~0#1.base, 4 + main_~#__CS_cp_inode~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,503 INFO L272 TraceCheckUtils]: 109: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem121#1 == main_#t~mem122#1 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,503 INFO L290 TraceCheckUtils]: 110: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,503 INFO L290 TraceCheckUtils]: 111: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,503 INFO L290 TraceCheckUtils]: 112: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,503 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {1153#true} {1154#false} #360#return; {1154#false} is VALID [2022-02-20 19:05:00,503 INFO L290 TraceCheckUtils]: 114: Hoare triple {1154#false} havoc main_#t~mem121#1;havoc main_#t~mem122#1;call main_#t~mem123#1 := read~int(~#inode~0.base, 4 + ~#inode~0.offset, 4);call main_#t~mem124#1 := read~int(main_~#__CS_cp_inode~0#1.base, 8 + main_~#__CS_cp_inode~0#1.offset, 4); {1154#false} is VALID [2022-02-20 19:05:00,504 INFO L272 TraceCheckUtils]: 115: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem123#1 == main_#t~mem124#1 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,504 INFO L290 TraceCheckUtils]: 116: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,504 INFO L290 TraceCheckUtils]: 117: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,504 INFO L290 TraceCheckUtils]: 118: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,504 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {1153#true} {1154#false} #362#return; {1154#false} is VALID [2022-02-20 19:05:00,504 INFO L290 TraceCheckUtils]: 120: Hoare triple {1154#false} havoc main_#t~mem123#1;havoc main_#t~mem124#1;call main_#t~mem125#1 := read~int(~#m_inode~0.base, ~#m_inode~0.offset, 1);call main_#t~mem126#1 := read~int(main_~#__CS_cp_m_inode~0#1.base, 1 + main_~#__CS_cp_m_inode~0#1.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,504 INFO L272 TraceCheckUtils]: 121: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem125#1 % 256 == main_#t~mem126#1 % 256 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,505 INFO L290 TraceCheckUtils]: 122: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,505 INFO L290 TraceCheckUtils]: 123: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,505 INFO L290 TraceCheckUtils]: 124: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,505 INFO L284 TraceCheckUtils]: 125: Hoare quadruple {1153#true} {1154#false} #364#return; {1154#false} is VALID [2022-02-20 19:05:00,505 INFO L290 TraceCheckUtils]: 126: Hoare triple {1154#false} havoc main_#t~mem125#1;havoc main_#t~mem126#1;call main_#t~mem127#1 := read~int(~#m_inode~0.base, 1 + ~#m_inode~0.offset, 1);call main_#t~mem128#1 := read~int(main_~#__CS_cp_m_inode~0#1.base, 2 + main_~#__CS_cp_m_inode~0#1.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,505 INFO L272 TraceCheckUtils]: 127: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem127#1 % 256 == main_#t~mem128#1 % 256 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,505 INFO L290 TraceCheckUtils]: 128: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,505 INFO L290 TraceCheckUtils]: 129: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,505 INFO L290 TraceCheckUtils]: 130: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,506 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {1153#true} {1154#false} #366#return; {1154#false} is VALID [2022-02-20 19:05:00,506 INFO L290 TraceCheckUtils]: 132: Hoare triple {1154#false} havoc main_#t~mem127#1;havoc main_#t~mem128#1;call main_#t~mem129#1 := read~int(~#m_busy~0.base, ~#m_busy~0.offset, 1);call main_#t~mem130#1 := read~int(main_~#__CS_cp_m_busy~0#1.base, 1 + main_~#__CS_cp_m_busy~0#1.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,506 INFO L272 TraceCheckUtils]: 133: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem129#1 % 256 == main_#t~mem130#1 % 256 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,506 INFO L290 TraceCheckUtils]: 134: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,506 INFO L290 TraceCheckUtils]: 135: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,506 INFO L290 TraceCheckUtils]: 136: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,506 INFO L284 TraceCheckUtils]: 137: Hoare quadruple {1153#true} {1154#false} #368#return; {1154#false} is VALID [2022-02-20 19:05:00,507 INFO L290 TraceCheckUtils]: 138: Hoare triple {1154#false} havoc main_#t~mem129#1;havoc main_#t~mem130#1;call main_#t~mem131#1 := read~int(~#m_busy~0.base, 1 + ~#m_busy~0.offset, 1);call main_#t~mem132#1 := read~int(main_~#__CS_cp_m_busy~0#1.base, 2 + main_~#__CS_cp_m_busy~0#1.offset, 1); {1154#false} is VALID [2022-02-20 19:05:00,507 INFO L272 TraceCheckUtils]: 139: Hoare triple {1154#false} call assume_abort_if_not((if main_#t~mem131#1 % 256 == main_#t~mem132#1 % 256 then 1 else 0)); {1153#true} is VALID [2022-02-20 19:05:00,507 INFO L290 TraceCheckUtils]: 140: Hoare triple {1153#true} ~cond := #in~cond; {1153#true} is VALID [2022-02-20 19:05:00,507 INFO L290 TraceCheckUtils]: 141: Hoare triple {1153#true} assume !(0 == ~cond); {1153#true} is VALID [2022-02-20 19:05:00,507 INFO L290 TraceCheckUtils]: 142: Hoare triple {1153#true} assume true; {1153#true} is VALID [2022-02-20 19:05:00,507 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {1153#true} {1154#false} #370#return; {1154#false} is VALID [2022-02-20 19:05:00,507 INFO L290 TraceCheckUtils]: 144: Hoare triple {1154#false} havoc main_#t~mem131#1;havoc main_#t~mem132#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 != ~__CS_error~0 % 256 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1154#false} is VALID [2022-02-20 19:05:00,507 INFO L290 TraceCheckUtils]: 145: Hoare triple {1154#false} assume 0 == __VERIFIER_assert_~cond#1; {1154#false} is VALID [2022-02-20 19:05:00,508 INFO L290 TraceCheckUtils]: 146: Hoare triple {1154#false} assume !false; {1154#false} is VALID [2022-02-20 19:05:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2022-02-20 19:05:00,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:05:00,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364582190] [2022-02-20 19:05:00,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364582190] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:05:00,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:05:00,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:05:00,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842278059] [2022-02-20 19:05:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:05:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2022-02-20 19:05:00,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:05:00,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-02-20 19:05:00,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:05:00,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:05:00,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:05:00,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:05:00,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:05:00,595 INFO L87 Difference]: Start difference. First operand 145 states and 209 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-02-20 19:05:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:05:04,955 INFO L93 Difference]: Finished difference Result 289 states and 418 transitions. [2022-02-20 19:05:04,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:05:04,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2022-02-20 19:05:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:05:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-02-20 19:05:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2022-02-20 19:05:04,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-02-20 19:05:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2022-02-20 19:05:04,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 417 transitions. [2022-02-20 19:05:05,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 417 edges. 417 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:05:05,317 INFO L225 Difference]: With dead ends: 289 [2022-02-20 19:05:05,317 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 19:05:05,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:05:05,318 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 1 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:05:05,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 409 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:05:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 19:05:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-02-20 19:05:05,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:05:05,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 146 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-02-20 19:05:05,328 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 146 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-02-20 19:05:05,329 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 146 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-02-20 19:05:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:05:05,335 INFO L93 Difference]: Finished difference Result 147 states and 211 transitions. [2022-02-20 19:05:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 211 transitions. [2022-02-20 19:05:05,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:05:05,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:05:05,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand 147 states. [2022-02-20 19:05:05,337 INFO L87 Difference]: Start difference. First operand has 146 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand 147 states. [2022-02-20 19:05:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:05:05,344 INFO L93 Difference]: Finished difference Result 147 states and 211 transitions. [2022-02-20 19:05:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 211 transitions. [2022-02-20 19:05:05,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:05:05,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:05:05,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:05:05,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:05:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-02-20 19:05:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 210 transitions. [2022-02-20 19:05:05,352 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 210 transitions. Word has length 147 [2022-02-20 19:05:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:05:05,353 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 210 transitions. [2022-02-20 19:05:05,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-02-20 19:05:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 210 transitions. [2022-02-20 19:05:05,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-02-20 19:05:05,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:05:05,354 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:05:05,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:05:05,355 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:05:05,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:05:05,355 INFO L85 PathProgramCache]: Analyzing trace with hash -611281689, now seen corresponding path program 1 times [2022-02-20 19:05:05,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:05:05,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902659442] [2022-02-20 19:05:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:05:05,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms