/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-17 23:09:51,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-17 23:09:51,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-17 23:09:51,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-17 23:09:51,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-17 23:09:51,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-17 23:09:51,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-17 23:09:51,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-17 23:09:51,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-17 23:09:51,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-17 23:09:51,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-17 23:09:51,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-17 23:09:51,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-17 23:09:51,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-17 23:09:51,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-17 23:09:51,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-17 23:09:51,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-17 23:09:51,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-17 23:09:51,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-17 23:09:51,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-17 23:09:51,981 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-17 23:09:51,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-17 23:09:51,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-17 23:09:51,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-17 23:09:51,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-17 23:09:51,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-17 23:09:51,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-17 23:09:51,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-17 23:09:51,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-17 23:09:51,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-17 23:09:51,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-17 23:09:51,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-17 23:09:51,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-17 23:09:51,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-17 23:09:51,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-17 23:09:51,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-17 23:09:51,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-17 23:09:51,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-17 23:09:51,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-17 23:09:51,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-17 23:09:51,990 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-17 23:09:51,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-17 23:09:52,007 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-17 23:09:52,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-17 23:09:52,008 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-17 23:09:52,008 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-17 23:09:52,008 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-17 23:09:52,008 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-17 23:09:52,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * Use SBE=true [2022-01-17 23:09:52,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-17 23:09:52,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-17 23:09:52,010 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-17 23:09:52,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-17 23:09:52,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-17 23:09:52,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-17 23:09:52,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-17 23:09:52,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-17 23:09:52,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 23:09:52,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-17 23:09:52,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-17 23:09:52,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-17 23:09:52,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-17 23:09:52,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-17 23:09:52,011 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-17 23:09:52,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-17 23:09:52,011 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 [2022-01-17 23:09:52,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-17 23:09:52,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-17 23:09:52,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-17 23:09:52,202 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-17 23:09:52,210 INFO L275 PluginConnector]: CDTParser initialized [2022-01-17 23:09:52,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2022-01-17 23:09:52,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73a5a288/5fb5758b7e2b41eea71cb999ea9bc408/FLAG2fb5e4d29 [2022-01-17 23:09:52,662 INFO L306 CDTParser]: Found 1 translation units. [2022-01-17 23:09:52,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2022-01-17 23:09:52,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73a5a288/5fb5758b7e2b41eea71cb999ea9bc408/FLAG2fb5e4d29 [2022-01-17 23:09:53,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73a5a288/5fb5758b7e2b41eea71cb999ea9bc408 [2022-01-17 23:09:53,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-17 23:09:53,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-17 23:09:53,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-17 23:09:53,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-17 23:09:53,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-17 23:09:53,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fc35e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53, skipping insertion in model container [2022-01-17 23:09:53,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-17 23:09:53,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-17 23:09:53,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i[944,957] [2022-01-17 23:09:53,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 23:09:53,258 INFO L203 MainTranslator]: Completed pre-run [2022-01-17 23:09:53,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i[944,957] [2022-01-17 23:09:53,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 23:09:53,319 INFO L208 MainTranslator]: Completed translation [2022-01-17 23:09:53,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53 WrapperNode [2022-01-17 23:09:53,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-17 23:09:53,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-17 23:09:53,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-17 23:09:53,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-17 23:09:53,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,387 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 283 [2022-01-17 23:09:53,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-17 23:09:53,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-17 23:09:53,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-17 23:09:53,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-17 23:09:53,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-17 23:09:53,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-17 23:09:53,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-17 23:09:53,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-17 23:09:53,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (1/1) ... [2022-01-17 23:09:53,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 23:09:53,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 23:09:53,432 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-01-17 23:09:53,449 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-01-17 23:09:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-17 23:09:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-17 23:09:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-17 23:09:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-17 23:09:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-17 23:09:53,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-17 23:09:53,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-17 23:09:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-17 23:09:53,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-17 23:09:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-17 23:09:53,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-17 23:09:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-17 23:09:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-17 23:09:53,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-17 23:09:53,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-17 23:09:53,472 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-17 23:09:53,607 INFO L234 CfgBuilder]: Building ICFG [2022-01-17 23:09:53,608 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-17 23:09:53,918 INFO L275 CfgBuilder]: Performing block encoding [2022-01-17 23:09:54,087 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-17 23:09:54,087 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-17 23:09:54,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 11:09:54 BoogieIcfgContainer [2022-01-17 23:09:54,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-17 23:09:54,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-17 23:09:54,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-17 23:09:54,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-17 23:09:54,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.01 11:09:53" (1/3) ... [2022-01-17 23:09:54,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4406df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 11:09:54, skipping insertion in model container [2022-01-17 23:09:54,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:09:53" (2/3) ... [2022-01-17 23:09:54,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4406df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 11:09:54, skipping insertion in model container [2022-01-17 23:09:54,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 11:09:54" (3/3) ... [2022-01-17 23:09:54,095 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2022-01-17 23:09:54,100 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-17 23:09:54,101 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-17 23:09:54,101 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-17 23:09:54,101 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-17 23:09:54,131 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,131 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,132 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,132 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,132 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,132 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,132 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,133 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,133 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,133 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,134 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,134 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,134 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,134 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,135 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,135 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,135 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,135 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,135 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,135 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,136 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,136 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,136 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,136 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,136 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,136 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,137 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,138 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,138 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,138 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,138 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,138 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,138 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,138 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,139 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,139 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,139 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,139 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,139 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,139 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,139 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,139 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,140 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,140 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,140 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,140 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,140 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,140 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,140 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,140 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,141 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,141 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,141 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,141 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,141 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,141 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,141 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,142 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,142 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,142 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,142 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,142 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,142 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,142 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,142 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,143 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,143 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,143 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,143 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,144 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,144 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,144 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,147 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,147 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,147 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,148 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,148 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,148 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,148 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,148 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,149 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,149 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,150 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,150 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,150 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,150 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,150 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,151 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,152 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,152 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,152 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,152 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:09:54,153 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-17 23:09:54,189 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-17 23:09:54,197 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=FINITE_AUTOMATA, 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-01-17 23:09:54,197 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-17 23:09:54,206 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 118 transitions, 251 flow [2022-01-17 23:09:54,608 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14374 states, 14371 states have (on average 3.5776911836337066) internal successors, (51415), 14373 states have internal predecessors, (51415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 14374 states, 14371 states have (on average 3.5776911836337066) internal successors, (51415), 14373 states have internal predecessors, (51415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-17 23:09:54,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:09:54,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:09:54,655 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:09:54,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:09:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2018288398, now seen corresponding path program 1 times [2022-01-17 23:09:54,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:09:54,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051083714] [2022-01-17 23:09:54,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:09:54,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:09:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:09:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:09:54,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:09:54,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051083714] [2022-01-17 23:09:54,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051083714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:09:54,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:09:54,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-17 23:09:54,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363979486] [2022-01-17 23:09:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:09:54,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-17 23:09:54,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:09:55,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-17 23:09:55,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-17 23:09:55,036 INFO L87 Difference]: Start difference. First operand has 14374 states, 14371 states have (on average 3.5776911836337066) internal successors, (51415), 14373 states have internal predecessors, (51415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:55,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:09:55,276 INFO L93 Difference]: Finished difference Result 12470 states and 43637 transitions. [2022-01-17 23:09:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-17 23:09:55,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-01-17 23:09:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:09:55,362 INFO L225 Difference]: With dead ends: 12470 [2022-01-17 23:09:55,363 INFO L226 Difference]: Without dead ends: 10566 [2022-01-17 23:09:55,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-17 23:09:55,367 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 40 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:09:55,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 167 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 23:09:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10566 states. [2022-01-17 23:09:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10566 to 10566. [2022-01-17 23:09:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10566 states, 10565 states have (on average 3.5266445811642213) internal successors, (37259), 10565 states have internal predecessors, (37259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10566 states to 10566 states and 37259 transitions. [2022-01-17 23:09:55,861 INFO L78 Accepts]: Start accepts. Automaton has 10566 states and 37259 transitions. Word has length 61 [2022-01-17 23:09:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:09:55,863 INFO L470 AbstractCegarLoop]: Abstraction has 10566 states and 37259 transitions. [2022-01-17 23:09:55,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 10566 states and 37259 transitions. [2022-01-17 23:09:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-17 23:09:55,880 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:09:55,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:09:55,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-17 23:09:55,881 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:09:55,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:09:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash -742004216, now seen corresponding path program 1 times [2022-01-17 23:09:55,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:09:55,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530070994] [2022-01-17 23:09:55,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:09:55,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:09:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:09:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:09:56,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:09:56,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530070994] [2022-01-17 23:09:56,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530070994] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:09:56,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:09:56,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-17 23:09:56,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757930754] [2022-01-17 23:09:56,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:09:56,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-17 23:09:56,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:09:56,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-17 23:09:56,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-17 23:09:56,249 INFO L87 Difference]: Start difference. First operand 10566 states and 37259 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:09:56,592 INFO L93 Difference]: Finished difference Result 13156 states and 46101 transitions. [2022-01-17 23:09:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-17 23:09:56,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-01-17 23:09:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:09:56,640 INFO L225 Difference]: With dead ends: 13156 [2022-01-17 23:09:56,640 INFO L226 Difference]: Without dead ends: 10356 [2022-01-17 23:09:56,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-01-17 23:09:56,641 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 342 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:09:56,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 819 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:09:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10356 states. [2022-01-17 23:09:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10356 to 10272. [2022-01-17 23:09:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10272 states, 10271 states have (on average 3.5171843053256744) internal successors, (36125), 10271 states have internal predecessors, (36125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10272 states to 10272 states and 36125 transitions. [2022-01-17 23:09:56,934 INFO L78 Accepts]: Start accepts. Automaton has 10272 states and 36125 transitions. Word has length 76 [2022-01-17 23:09:56,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:09:56,935 INFO L470 AbstractCegarLoop]: Abstraction has 10272 states and 36125 transitions. [2022-01-17 23:09:56,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 10272 states and 36125 transitions. [2022-01-17 23:09:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-17 23:09:56,949 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:09:56,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:09:56,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-17 23:09:56,950 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:09:56,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:09:56,950 INFO L85 PathProgramCache]: Analyzing trace with hash -4344250, now seen corresponding path program 1 times [2022-01-17 23:09:56,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:09:56,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584832871] [2022-01-17 23:09:56,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:09:56,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:09:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:09:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:09:57,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:09:57,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584832871] [2022-01-17 23:09:57,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584832871] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:09:57,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:09:57,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:09:57,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209604811] [2022-01-17 23:09:57,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:09:57,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:09:57,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:09:57,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:09:57,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:09:57,125 INFO L87 Difference]: Start difference. First operand 10272 states and 36125 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:09:57,334 INFO L93 Difference]: Finished difference Result 11588 states and 40431 transitions. [2022-01-17 23:09:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:09:57,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-01-17 23:09:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:09:57,368 INFO L225 Difference]: With dead ends: 11588 [2022-01-17 23:09:57,368 INFO L226 Difference]: Without dead ends: 8998 [2022-01-17 23:09:57,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-17 23:09:57,370 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 132 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:09:57,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 555 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:09:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8998 states. [2022-01-17 23:09:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8998 to 8998. [2022-01-17 23:09:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8998 states, 8997 states have (on average 3.4908302767589197) internal successors, (31407), 8997 states have internal predecessors, (31407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8998 states to 8998 states and 31407 transitions. [2022-01-17 23:09:57,650 INFO L78 Accepts]: Start accepts. Automaton has 8998 states and 31407 transitions. Word has length 78 [2022-01-17 23:09:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:09:57,650 INFO L470 AbstractCegarLoop]: Abstraction has 8998 states and 31407 transitions. [2022-01-17 23:09:57,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 8998 states and 31407 transitions. [2022-01-17 23:09:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-17 23:09:57,666 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:09:57,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:09:57,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-17 23:09:57,667 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:09:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:09:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1615511619, now seen corresponding path program 1 times [2022-01-17 23:09:57,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:09:57,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926182093] [2022-01-17 23:09:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:09:57,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:09:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:09:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:09:57,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:09:57,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926182093] [2022-01-17 23:09:57,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926182093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:09:57,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:09:57,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-17 23:09:57,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603169406] [2022-01-17 23:09:57,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:09:57,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-17 23:09:57,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:09:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-17 23:09:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-17 23:09:57,835 INFO L87 Difference]: Start difference. First operand 8998 states and 31407 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:58,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:09:58,155 INFO L93 Difference]: Finished difference Result 10384 states and 35969 transitions. [2022-01-17 23:09:58,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-17 23:09:58,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-01-17 23:09:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:09:58,189 INFO L225 Difference]: With dead ends: 10384 [2022-01-17 23:09:58,189 INFO L226 Difference]: Without dead ends: 8704 [2022-01-17 23:09:58,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-01-17 23:09:58,190 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 229 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:09:58,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 984 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-17 23:09:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8704 states. [2022-01-17 23:09:58,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8704 to 8704. [2022-01-17 23:09:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8704 states, 8703 states have (on average 3.4784557049293348) internal successors, (30273), 8703 states have internal predecessors, (30273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8704 states to 8704 states and 30273 transitions. [2022-01-17 23:09:58,427 INFO L78 Accepts]: Start accepts. Automaton has 8704 states and 30273 transitions. Word has length 80 [2022-01-17 23:09:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:09:58,428 INFO L470 AbstractCegarLoop]: Abstraction has 8704 states and 30273 transitions. [2022-01-17 23:09:58,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 8704 states and 30273 transitions. [2022-01-17 23:09:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-17 23:09:58,443 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:09:58,443 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:09:58,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-17 23:09:58,444 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:09:58,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:09:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1957084860, now seen corresponding path program 1 times [2022-01-17 23:09:58,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:09:58,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846753423] [2022-01-17 23:09:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:09:58,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:09:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:09:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:09:58,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:09:58,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846753423] [2022-01-17 23:09:58,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846753423] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:09:58,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:09:58,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:09:58,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280520449] [2022-01-17 23:09:58,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:09:58,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:09:58,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:09:58,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:09:58,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:09:58,519 INFO L87 Difference]: Start difference. First operand 8704 states and 30273 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:09:58,671 INFO L93 Difference]: Finished difference Result 10132 states and 34535 transitions. [2022-01-17 23:09:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:09:58,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-01-17 23:09:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:09:58,693 INFO L225 Difference]: With dead ends: 10132 [2022-01-17 23:09:58,693 INFO L226 Difference]: Without dead ends: 7332 [2022-01-17 23:09:58,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-17 23:09:58,694 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 187 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:09:58,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 425 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:09:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7332 states. [2022-01-17 23:09:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7332 to 7332. [2022-01-17 23:09:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7332 states, 7331 states have (on average 3.380848451780112) internal successors, (24785), 7331 states have internal predecessors, (24785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7332 states to 7332 states and 24785 transitions. [2022-01-17 23:09:58,928 INFO L78 Accepts]: Start accepts. Automaton has 7332 states and 24785 transitions. Word has length 82 [2022-01-17 23:09:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:09:58,928 INFO L470 AbstractCegarLoop]: Abstraction has 7332 states and 24785 transitions. [2022-01-17 23:09:58,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7332 states and 24785 transitions. [2022-01-17 23:09:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-17 23:09:58,949 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:09:58,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:09:58,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-17 23:09:58,950 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:09:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:09:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 598890853, now seen corresponding path program 1 times [2022-01-17 23:09:58,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:09:58,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330575468] [2022-01-17 23:09:58,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:09:58,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:09:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:09:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:09:59,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:09:59,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330575468] [2022-01-17 23:09:59,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330575468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:09:59,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:09:59,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-17 23:09:59,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515617119] [2022-01-17 23:09:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:09:59,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-17 23:09:59,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:09:59,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-17 23:09:59,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-17 23:09:59,086 INFO L87 Difference]: Start difference. First operand 7332 states and 24785 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:09:59,253 INFO L93 Difference]: Finished difference Result 6579 states and 21523 transitions. [2022-01-17 23:09:59,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-17 23:09:59,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-01-17 23:09:59,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:09:59,271 INFO L225 Difference]: With dead ends: 6579 [2022-01-17 23:09:59,271 INFO L226 Difference]: Without dead ends: 4479 [2022-01-17 23:09:59,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-01-17 23:09:59,273 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 320 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:09:59,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 499 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:09:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4479 states. [2022-01-17 23:09:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4479 to 4479. [2022-01-17 23:09:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4479 states, 4478 states have (on average 3.1987494417150515) internal successors, (14324), 4478 states have internal predecessors, (14324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4479 states to 4479 states and 14324 transitions. [2022-01-17 23:09:59,368 INFO L78 Accepts]: Start accepts. Automaton has 4479 states and 14324 transitions. Word has length 83 [2022-01-17 23:09:59,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:09:59,368 INFO L470 AbstractCegarLoop]: Abstraction has 4479 states and 14324 transitions. [2022-01-17 23:09:59,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 4479 states and 14324 transitions. [2022-01-17 23:09:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-17 23:09:59,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:09:59,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:09:59,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-17 23:09:59,377 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:09:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:09:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -225024857, now seen corresponding path program 1 times [2022-01-17 23:09:59,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:09:59,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951588882] [2022-01-17 23:09:59,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:09:59,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:09:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:09:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:09:59,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:09:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951588882] [2022-01-17 23:09:59,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951588882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:09:59,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:09:59,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-17 23:09:59,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270885131] [2022-01-17 23:09:59,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:09:59,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-17 23:09:59,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:09:59,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-17 23:09:59,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-17 23:09:59,479 INFO L87 Difference]: Start difference. First operand 4479 states and 14324 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:09:59,621 INFO L93 Difference]: Finished difference Result 6798 states and 21714 transitions. [2022-01-17 23:09:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-17 23:09:59,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-01-17 23:09:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:09:59,673 INFO L225 Difference]: With dead ends: 6798 [2022-01-17 23:09:59,673 INFO L226 Difference]: Without dead ends: 4794 [2022-01-17 23:09:59,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-17 23:09:59,674 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 113 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:09:59,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 816 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:09:59,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4794 states. [2022-01-17 23:09:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4794 to 4479. [2022-01-17 23:09:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4479 states, 4478 states have (on average 3.1558731576596695) internal successors, (14132), 4478 states have internal predecessors, (14132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4479 states to 4479 states and 14132 transitions. [2022-01-17 23:09:59,750 INFO L78 Accepts]: Start accepts. Automaton has 4479 states and 14132 transitions. Word has length 87 [2022-01-17 23:09:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:09:59,750 INFO L470 AbstractCegarLoop]: Abstraction has 4479 states and 14132 transitions. [2022-01-17 23:09:59,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 4479 states and 14132 transitions. [2022-01-17 23:09:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-17 23:09:59,758 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:09:59,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:09:59,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-17 23:09:59,758 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:09:59,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:09:59,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1714064617, now seen corresponding path program 2 times [2022-01-17 23:09:59,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:09:59,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970417696] [2022-01-17 23:09:59,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:09:59,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:09:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:09:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:09:59,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:09:59,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970417696] [2022-01-17 23:09:59,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970417696] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:09:59,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:09:59,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-17 23:09:59,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382469008] [2022-01-17 23:09:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:09:59,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-17 23:09:59,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:09:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-17 23:09:59,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-17 23:09:59,829 INFO L87 Difference]: Start difference. First operand 4479 states and 14132 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:09:59,962 INFO L93 Difference]: Finished difference Result 3426 states and 10577 transitions. [2022-01-17 23:09:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-17 23:09:59,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-01-17 23:09:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:09:59,968 INFO L225 Difference]: With dead ends: 3426 [2022-01-17 23:09:59,968 INFO L226 Difference]: Without dead ends: 1656 [2022-01-17 23:09:59,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-01-17 23:09:59,969 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 413 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:09:59,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 500 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:09:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-01-17 23:09:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2022-01-17 23:09:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 2.9993957703927494) internal successors, (4964), 1655 states have internal predecessors, (4964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4964 transitions. [2022-01-17 23:09:59,991 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 4964 transitions. Word has length 87 [2022-01-17 23:09:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:09:59,992 INFO L470 AbstractCegarLoop]: Abstraction has 1656 states and 4964 transitions. [2022-01-17 23:09:59,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:09:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 4964 transitions. [2022-01-17 23:09:59,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-17 23:09:59,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:09:59,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:09:59,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-17 23:09:59,995 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:09:59,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:09:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash -757093674, now seen corresponding path program 1 times [2022-01-17 23:09:59,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:09:59,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73363734] [2022-01-17 23:09:59,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:09:59,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:10:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:10:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:10:00,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:10:00,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73363734] [2022-01-17 23:10:00,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73363734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:10:00,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:10:00,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-17 23:10:00,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607625181] [2022-01-17 23:10:00,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:10:00,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-17 23:10:00,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:10:00,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-17 23:10:00,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-17 23:10:00,069 INFO L87 Difference]: Start difference. First operand 1656 states and 4964 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:10:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:10:00,158 INFO L93 Difference]: Finished difference Result 2367 states and 7115 transitions. [2022-01-17 23:10:00,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-17 23:10:00,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-01-17 23:10:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:10:00,160 INFO L225 Difference]: With dead ends: 2367 [2022-01-17 23:10:00,160 INFO L226 Difference]: Without dead ends: 1122 [2022-01-17 23:10:00,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-17 23:10:00,161 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 80 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:10:00,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 680 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 23:10:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-01-17 23:10:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2022-01-17 23:10:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1121 states have (on average 2.8974130240856377) internal successors, (3248), 1121 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:10:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 3248 transitions. [2022-01-17 23:10:00,176 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 3248 transitions. Word has length 92 [2022-01-17 23:10:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:10:00,176 INFO L470 AbstractCegarLoop]: Abstraction has 1122 states and 3248 transitions. [2022-01-17 23:10:00,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:10:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 3248 transitions. [2022-01-17 23:10:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-17 23:10:00,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:10:00,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:10:00,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-17 23:10:00,178 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:10:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:10:00,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1756286580, now seen corresponding path program 2 times [2022-01-17 23:10:00,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:10:00,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050962157] [2022-01-17 23:10:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:10:00,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:10:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:10:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:10:00,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:10:00,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050962157] [2022-01-17 23:10:00,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050962157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:10:00,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:10:00,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-17 23:10:00,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236159242] [2022-01-17 23:10:00,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:10:00,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-17 23:10:00,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:10:00,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-17 23:10:00,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-01-17 23:10:00,391 INFO L87 Difference]: Start difference. First operand 1122 states and 3248 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:10:00,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:10:00,635 INFO L93 Difference]: Finished difference Result 2310 states and 6788 transitions. [2022-01-17 23:10:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-17 23:10:00,635 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2022-01-17 23:10:00,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:10:00,639 INFO L225 Difference]: With dead ends: 2310 [2022-01-17 23:10:00,639 INFO L226 Difference]: Without dead ends: 1503 [2022-01-17 23:10:00,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-01-17 23:10:00,640 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 211 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:10:00,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 941 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:10:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-01-17 23:10:00,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 906. [2022-01-17 23:10:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 2.7933701657458565) internal successors, (2528), 905 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:10:00,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 2528 transitions. [2022-01-17 23:10:00,654 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 2528 transitions. Word has length 92 [2022-01-17 23:10:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:10:00,654 INFO L470 AbstractCegarLoop]: Abstraction has 906 states and 2528 transitions. [2022-01-17 23:10:00,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:10:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 2528 transitions. [2022-01-17 23:10:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-17 23:10:00,656 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:10:00,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:10:00,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-17 23:10:00,656 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:10:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:10:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash 838081684, now seen corresponding path program 3 times [2022-01-17 23:10:00,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:10:00,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965334347] [2022-01-17 23:10:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:10:00,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:10:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-17 23:10:00,685 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-17 23:10:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-17 23:10:00,736 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-17 23:10:00,736 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-17 23:10:00,737 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-17 23:10:00,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-17 23:10:00,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-17 23:10:00,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-17 23:10:00,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-17 23:10:00,738 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-17 23:10:00,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-17 23:10:00,740 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2022-01-17 23:10:00,744 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-17 23:10:00,744 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-17 23:10:00,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.01 11:10:00 BasicIcfg [2022-01-17 23:10:00,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-17 23:10:00,819 INFO L158 Benchmark]: Toolchain (without parser) took 7803.12ms. Allocated memory was 379.6MB in the beginning and 4.0GB in the end (delta: 3.6GB). Free memory was 322.9MB in the beginning and 3.6GB in the end (delta: -3.2GB). Peak memory consumption was 336.1MB. Max. memory is 16.0GB. [2022-01-17 23:10:00,820 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 379.6MB. Free memory was 341.3MB in the beginning and 341.2MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-17 23:10:00,820 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.34ms. Allocated memory was 379.6MB in the beginning and 578.8MB in the end (delta: 199.2MB). Free memory was 322.7MB in the beginning and 537.4MB in the end (delta: -214.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.0GB. [2022-01-17 23:10:00,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.85ms. Allocated memory is still 578.8MB. Free memory was 537.4MB in the beginning and 534.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-17 23:10:00,820 INFO L158 Benchmark]: Boogie Preprocessor took 20.75ms. Allocated memory is still 578.8MB. Free memory was 534.3MB in the beginning and 532.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-17 23:10:00,820 INFO L158 Benchmark]: RCFGBuilder took 679.85ms. Allocated memory is still 578.8MB. Free memory was 532.2MB in the beginning and 456.7MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.0GB. [2022-01-17 23:10:00,821 INFO L158 Benchmark]: TraceAbstraction took 6729.07ms. Allocated memory was 578.8MB in the beginning and 4.0GB in the end (delta: 3.4GB). Free memory was 455.6MB in the beginning and 3.6GB in the end (delta: -3.1GB). Peak memory consumption was 268.7MB. Max. memory is 16.0GB. [2022-01-17 23:10:00,821 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 379.6MB. Free memory was 341.3MB in the beginning and 341.2MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 302.34ms. Allocated memory was 379.6MB in the beginning and 578.8MB in the end (delta: 199.2MB). Free memory was 322.7MB in the beginning and 537.4MB in the end (delta: -214.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.85ms. Allocated memory is still 578.8MB. Free memory was 537.4MB in the beginning and 534.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.75ms. Allocated memory is still 578.8MB. Free memory was 534.3MB in the beginning and 532.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 679.85ms. Allocated memory is still 578.8MB. Free memory was 532.2MB in the beginning and 456.7MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.0GB. * TraceAbstraction took 6729.07ms. Allocated memory was 578.8MB in the beginning and 4.0GB in the end (delta: 3.4GB). Free memory was 455.6MB in the beginning and 3.6GB in the end (delta: -3.1GB). Peak memory consumption was 268.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L729] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L736] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L738] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1108; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1108, ((void *)0), P0, ((void *)0))=-2, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1109; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1109, ((void *)0), P1, ((void *)0))=-1, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1110; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1110, ((void *)0), P2, ((void *)0))=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 146 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2067 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2067 mSDsluCounter, 6386 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5399 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1007 IncrementalHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 1339 mSDtfsCounter, 1007 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14374occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 996 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 808 ConstructedInterpolants, 0 QuantifiedInterpolants, 3578 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-17 23:10:00,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...