/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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-17 23:15:25,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-17 23:15:25,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-17 23:15:25,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-17 23:15:25,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-17 23:15:25,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-17 23:15:25,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-17 23:15:25,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-17 23:15:25,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-17 23:15:25,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-17 23:15:25,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-17 23:15:25,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-17 23:15:25,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-17 23:15:25,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-17 23:15:25,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-17 23:15:25,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-17 23:15:25,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-17 23:15:25,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-17 23:15:25,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-17 23:15:25,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-17 23:15:25,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-17 23:15:25,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-17 23:15:25,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-17 23:15:25,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-17 23:15:25,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-17 23:15:25,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-17 23:15:25,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-17 23:15:25,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-17 23:15:25,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-17 23:15:25,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-17 23:15:25,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-17 23:15:25,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-17 23:15:25,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-17 23:15:25,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-17 23:15:25,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-17 23:15:25,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-17 23:15:25,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-17 23:15:25,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-17 23:15:25,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-17 23:15:25,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-17 23:15:25,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-17 23:15:25,976 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:15:25,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-17 23:15:25,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-17 23:15:26,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-17 23:15:26,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-17 23:15:26,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-17 23:15:26,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-17 23:15:26,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-17 23:15:26,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-17 23:15:26,001 INFO L138 SettingsManager]: * Use SBE=true [2022-01-17 23:15:26,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-17 23:15:26,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-17 23:15:26,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-17 23:15:26,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-17 23:15:26,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-17 23:15:26,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-17 23:15:26,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-17 23:15:26,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-17 23:15:26,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-17 23:15:26,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-17 23:15:26,003 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-17 23:15:26,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-17 23:15:26,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-17 23:15:26,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-17 23:15:26,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-17 23:15:26,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-17 23:15:26,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 23:15:26,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-17 23:15:26,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-17 23:15:26,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-17 23:15:26,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-17 23:15:26,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-17 23:15:26,005 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-17 23:15:26,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-17 23:15:26,005 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:15:26,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-17 23:15:26,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-17 23:15:26,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-17 23:15:26,226 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-17 23:15:26,227 INFO L275 PluginConnector]: CDTParser initialized [2022-01-17 23:15:26,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-17 23:15:26,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566a075f6/6f6d4c34817d44e694d112188e85c845/FLAG3c626307a [2022-01-17 23:15:26,683 INFO L306 CDTParser]: Found 1 translation units. [2022-01-17 23:15:26,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-17 23:15:26,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566a075f6/6f6d4c34817d44e694d112188e85c845/FLAG3c626307a [2022-01-17 23:15:26,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566a075f6/6f6d4c34817d44e694d112188e85c845 [2022-01-17 23:15:26,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-17 23:15:26,713 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-17 23:15:26,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-17 23:15:26,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-17 23:15:26,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-17 23:15:26,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 11:15:26" (1/1) ... [2022-01-17 23:15:26,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6041b90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:26, skipping insertion in model container [2022-01-17 23:15:26,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 11:15:26" (1/1) ... [2022-01-17 23:15:26,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-17 23:15:26,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-17 23:15:26,960 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-01-17 23:15:27,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 23:15:27,115 INFO L203 MainTranslator]: Completed pre-run [2022-01-17 23:15:27,123 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-01-17 23:15:27,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 23:15:27,206 INFO L208 MainTranslator]: Completed translation [2022-01-17 23:15:27,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:27 WrapperNode [2022-01-17 23:15:27,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-17 23:15:27,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-17 23:15:27,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-17 23:15:27,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-17 23:15:27,213 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:15:27" (1/1) ... [2022-01-17 23:15:27,227 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:15:27" (1/1) ... [2022-01-17 23:15:27,258 INFO L137 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-01-17 23:15:27,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-17 23:15:27,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-17 23:15:27,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-17 23:15:27,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-17 23:15:27,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:27" (1/1) ... [2022-01-17 23:15:27,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:27" (1/1) ... [2022-01-17 23:15:27,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:27" (1/1) ... [2022-01-17 23:15:27,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:27" (1/1) ... [2022-01-17 23:15:27,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:27" (1/1) ... [2022-01-17 23:15:27,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:27" (1/1) ... [2022-01-17 23:15:27,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:27" (1/1) ... [2022-01-17 23:15:27,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-17 23:15:27,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-17 23:15:27,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-17 23:15:27,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-17 23:15:27,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:27" (1/1) ... [2022-01-17 23:15:27,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 23:15:27,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 23:15:27,315 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:15:27,336 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:15:27,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-17 23:15:27,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-17 23:15:27,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-17 23:15:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-17 23:15:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-17 23:15:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-17 23:15:27,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-17 23:15:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-17 23:15:27,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-17 23:15:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-17 23:15:27,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-17 23:15:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-17 23:15:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-17 23:15:27,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-17 23:15:27,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-17 23:15:27,360 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:15:27,448 INFO L234 CfgBuilder]: Building ICFG [2022-01-17 23:15:27,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-17 23:15:27,867 INFO L275 CfgBuilder]: Performing block encoding [2022-01-17 23:15:28,075 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-17 23:15:28,075 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-17 23:15:28,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 11:15:28 BoogieIcfgContainer [2022-01-17 23:15:28,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-17 23:15:28,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-17 23:15:28,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-17 23:15:28,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-17 23:15:28,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.01 11:15:26" (1/3) ... [2022-01-17 23:15:28,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e403076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 11:15:28, skipping insertion in model container [2022-01-17 23:15:28,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:15:27" (2/3) ... [2022-01-17 23:15:28,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e403076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 11:15:28, skipping insertion in model container [2022-01-17 23:15:28,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 11:15:28" (3/3) ... [2022-01-17 23:15:28,083 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-01-17 23:15:28,086 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-17 23:15:28,086 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-17 23:15:28,086 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-17 23:15:28,086 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-17 23:15:28,114 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,114 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,114 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,114 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,114 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,114 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,115 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,115 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,115 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,115 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,115 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,115 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,115 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,115 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,116 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,116 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,116 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,116 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,116 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,116 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,116 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,116 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,116 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,117 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,117 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,117 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,117 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,117 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,117 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,117 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,118 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,118 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,118 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,118 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,118 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,118 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,118 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,118 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,118 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,118 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,119 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,119 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,119 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,119 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,119 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,119 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,119 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,119 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,119 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,120 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,120 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,120 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,120 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,120 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,120 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,120 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,120 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,121 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,123 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,123 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,123 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,123 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,123 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,123 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,123 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,124 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,124 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,125 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,125 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,125 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,126 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,126 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,126 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,126 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,126 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,126 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,126 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,127 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,128 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,128 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,128 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,128 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,128 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,128 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,128 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,128 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,128 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,128 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:15:28,129 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-17 23:15:28,153 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-17 23:15:28,157 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:15:28,157 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-17 23:15:28,163 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 120 places, 112 transitions, 239 flow [2022-01-17 23:15:28,490 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12305 states, 12302 states have (on average 3.5471468053974964) internal successors, (43637), 12304 states have internal predecessors, (43637), 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:15:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 12305 states, 12302 states have (on average 3.5471468053974964) internal successors, (43637), 12304 states have internal predecessors, (43637), 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:15:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-17 23:15:28,539 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:28,539 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] [2022-01-17 23:15:28,540 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1234575711, now seen corresponding path program 1 times [2022-01-17 23:15:28,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:28,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145187483] [2022-01-17 23:15:28,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:28,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:28,786 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:15:28,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:28,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145187483] [2022-01-17 23:15:28,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145187483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:28,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:28,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-17 23:15:28,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536448265] [2022-01-17 23:15:28,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:28,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-17 23:15:28,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-17 23:15:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-17 23:15:28,839 INFO L87 Difference]: Start difference. First operand has 12305 states, 12302 states have (on average 3.5471468053974964) internal successors, (43637), 12304 states have internal predecessors, (43637), 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 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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:15:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:29,057 INFO L93 Difference]: Finished difference Result 10345 states and 35817 transitions. [2022-01-17 23:15:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-17 23:15:29,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2022-01-17 23:15:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:29,120 INFO L225 Difference]: With dead ends: 10345 [2022-01-17 23:15:29,120 INFO L226 Difference]: Without dead ends: 8553 [2022-01-17 23:15:29,121 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:15:29,124 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 53 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:29,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 166 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 23:15:29,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8553 states. [2022-01-17 23:15:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8553 to 8553. [2022-01-17 23:15:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8553 states, 8552 states have (on average 3.4912301216089805) internal successors, (29857), 8552 states have internal predecessors, (29857), 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:15:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8553 states to 8553 states and 29857 transitions. [2022-01-17 23:15:29,508 INFO L78 Accepts]: Start accepts. Automaton has 8553 states and 29857 transitions. Word has length 43 [2022-01-17 23:15:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:29,509 INFO L470 AbstractCegarLoop]: Abstraction has 8553 states and 29857 transitions. [2022-01-17 23:15:29,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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:15:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 8553 states and 29857 transitions. [2022-01-17 23:15:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-17 23:15:29,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:29,527 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] [2022-01-17 23:15:29,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-17 23:15:29,528 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:29,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1218056957, now seen corresponding path program 1 times [2022-01-17 23:15:29,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:29,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523138727] [2022-01-17 23:15:29,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:29,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:29,774 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:15:29,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:29,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523138727] [2022-01-17 23:15:29,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523138727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:29,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:29,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:15:29,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789238810] [2022-01-17 23:15:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:29,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:15:29,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:15:29,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:15:29,777 INFO L87 Difference]: Start difference. First operand 8553 states and 29857 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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:15:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:30,080 INFO L93 Difference]: Finished difference Result 10457 states and 36235 transitions. [2022-01-17 23:15:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:15:30,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 72 [2022-01-17 23:15:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:30,141 INFO L225 Difference]: With dead ends: 10457 [2022-01-17 23:15:30,141 INFO L226 Difference]: Without dead ends: 8217 [2022-01-17 23:15:30,145 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:15:30,145 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 119 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:30,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 501 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2022-01-17 23:15:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 8217. [2022-01-17 23:15:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8217 states, 8216 states have (on average 3.4755355404089583) internal successors, (28555), 8216 states have internal predecessors, (28555), 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:15:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 28555 transitions. [2022-01-17 23:15:30,407 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 28555 transitions. Word has length 72 [2022-01-17 23:15:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:30,409 INFO L470 AbstractCegarLoop]: Abstraction has 8217 states and 28555 transitions. [2022-01-17 23:15:30,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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:15:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 28555 transitions. [2022-01-17 23:15:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-17 23:15:30,425 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:30,425 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] [2022-01-17 23:15:30,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-17 23:15:30,426 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash 246641794, now seen corresponding path program 1 times [2022-01-17 23:15:30,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:30,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453449769] [2022-01-17 23:15:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:30,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-17 23:15:30,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:30,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453449769] [2022-01-17 23:15:30,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453449769] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:30,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:30,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:15:30,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678542918] [2022-01-17 23:15:30,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:30,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:15:30,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:30,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:15:30,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:15:30,583 INFO L87 Difference]: Start difference. First operand 8217 states and 28555 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:15:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:30,866 INFO L93 Difference]: Finished difference Result 9517 states and 32815 transitions. [2022-01-17 23:15:30,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:15:30,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 74 [2022-01-17 23:15:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:30,890 INFO L225 Difference]: With dead ends: 9517 [2022-01-17 23:15:30,890 INFO L226 Difference]: Without dead ends: 7517 [2022-01-17 23:15:30,890 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:15:30,891 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 124 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:30,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 500 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:30,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7517 states. [2022-01-17 23:15:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7517 to 7517. [2022-01-17 23:15:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7517 states, 7516 states have (on average 3.454630122405535) internal successors, (25965), 7516 states have internal predecessors, (25965), 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:15:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7517 states to 7517 states and 25965 transitions. [2022-01-17 23:15:31,058 INFO L78 Accepts]: Start accepts. Automaton has 7517 states and 25965 transitions. Word has length 74 [2022-01-17 23:15:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:31,058 INFO L470 AbstractCegarLoop]: Abstraction has 7517 states and 25965 transitions. [2022-01-17 23:15:31,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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:15:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 7517 states and 25965 transitions. [2022-01-17 23:15:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-17 23:15:31,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:31,071 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:15:31,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-17 23:15:31,072 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:31,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash -723901759, now seen corresponding path program 1 times [2022-01-17 23:15:31,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:31,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188808500] [2022-01-17 23:15:31,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:31,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:31,220 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:15:31,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:31,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188808500] [2022-01-17 23:15:31,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188808500] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:31,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:31,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-17 23:15:31,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862842623] [2022-01-17 23:15:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:31,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-17 23:15:31,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:31,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-17 23:15:31,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-17 23:15:31,222 INFO L87 Difference]: Start difference. First operand 7517 states and 25965 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:15:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:31,417 INFO L93 Difference]: Finished difference Result 12317 states and 42625 transitions. [2022-01-17 23:15:31,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-17 23:15:31,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:15:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:31,440 INFO L225 Difference]: With dead ends: 12317 [2022-01-17 23:15:31,440 INFO L226 Difference]: Without dead ends: 7121 [2022-01-17 23:15:31,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-17 23:15:31,441 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 166 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:31,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 526 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7121 states. [2022-01-17 23:15:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7121 to 7121. [2022-01-17 23:15:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7121 states, 7120 states have (on average 3.4293539325842697) internal successors, (24417), 7120 states have internal predecessors, (24417), 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:15:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 24417 transitions. [2022-01-17 23:15:31,607 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 24417 transitions. Word has length 76 [2022-01-17 23:15:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:31,607 INFO L470 AbstractCegarLoop]: Abstraction has 7121 states and 24417 transitions. [2022-01-17 23:15:31,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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:15:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 24417 transitions. [2022-01-17 23:15:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-17 23:15:31,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:31,619 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:15:31,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-17 23:15:31,619 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:31,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:31,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2041735983, now seen corresponding path program 2 times [2022-01-17 23:15:31,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:31,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937524340] [2022-01-17 23:15:31,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:31,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:31,820 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:15:31,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:31,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937524340] [2022-01-17 23:15:31,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937524340] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:31,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:31,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-17 23:15:31,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951734753] [2022-01-17 23:15:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:31,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-17 23:15:31,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:31,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-17 23:15:31,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-17 23:15:31,822 INFO L87 Difference]: Start difference. First operand 7121 states and 24417 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:15:32,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:32,067 INFO L93 Difference]: Finished difference Result 8323 states and 28383 transitions. [2022-01-17 23:15:32,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-17 23:15:32,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:15:32,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:32,098 INFO L225 Difference]: With dead ends: 8323 [2022-01-17 23:15:32,098 INFO L226 Difference]: Without dead ends: 7123 [2022-01-17 23:15:32,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-01-17 23:15:32,103 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 236 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:32,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 608 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7123 states. [2022-01-17 23:15:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7123 to 7107. [2022-01-17 23:15:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7107 states, 7106 states have (on average 3.4282296650717705) internal successors, (24361), 7106 states have internal predecessors, (24361), 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:15:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7107 states to 7107 states and 24361 transitions. [2022-01-17 23:15:32,299 INFO L78 Accepts]: Start accepts. Automaton has 7107 states and 24361 transitions. Word has length 76 [2022-01-17 23:15:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:32,300 INFO L470 AbstractCegarLoop]: Abstraction has 7107 states and 24361 transitions. [2022-01-17 23:15:32,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:15:32,300 INFO L276 IsEmpty]: Start isEmpty. Operand 7107 states and 24361 transitions. [2022-01-17 23:15:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-17 23:15:32,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:32,315 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] [2022-01-17 23:15:32,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-17 23:15:32,316 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash -553585628, now seen corresponding path program 1 times [2022-01-17 23:15:32,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:32,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348064661] [2022-01-17 23:15:32,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:32,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:32,428 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:15:32,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:32,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348064661] [2022-01-17 23:15:32,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348064661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:32,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:32,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:15:32,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806977586] [2022-01-17 23:15:32,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:32,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:15:32,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:32,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:15:32,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:15:32,430 INFO L87 Difference]: Start difference. First operand 7107 states and 24361 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:15:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:32,633 INFO L93 Difference]: Finished difference Result 11912 states and 40280 transitions. [2022-01-17 23:15:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:15:32,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 77 [2022-01-17 23:15:32,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:32,750 INFO L225 Difference]: With dead ends: 11912 [2022-01-17 23:15:32,750 INFO L226 Difference]: Without dead ends: 7737 [2022-01-17 23:15:32,751 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:15:32,752 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 106 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:32,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 658 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:32,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2022-01-17 23:15:32,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 6687. [2022-01-17 23:15:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6687 states, 6686 states have (on average 3.34430152557583) internal successors, (22360), 6686 states have internal predecessors, (22360), 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:15:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 22360 transitions. [2022-01-17 23:15:32,892 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 22360 transitions. Word has length 77 [2022-01-17 23:15:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:32,892 INFO L470 AbstractCegarLoop]: Abstraction has 6687 states and 22360 transitions. [2022-01-17 23:15:32,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:15:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 22360 transitions. [2022-01-17 23:15:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-17 23:15:32,905 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:32,906 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] [2022-01-17 23:15:32,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-17 23:15:32,906 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:32,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2125676128, now seen corresponding path program 1 times [2022-01-17 23:15:32,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:32,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233955163] [2022-01-17 23:15:32,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:32,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:33,091 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:15:33,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:33,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233955163] [2022-01-17 23:15:33,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233955163] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:33,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:33,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-17 23:15:33,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423222440] [2022-01-17 23:15:33,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:33,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-17 23:15:33,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:33,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-17 23:15:33,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-17 23:15:33,092 INFO L87 Difference]: Start difference. First operand 6687 states and 22360 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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:15:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:33,389 INFO L93 Difference]: Finished difference Result 8412 states and 27860 transitions. [2022-01-17 23:15:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-17 23:15:33,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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 77 [2022-01-17 23:15:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:33,407 INFO L225 Difference]: With dead ends: 8412 [2022-01-17 23:15:33,407 INFO L226 Difference]: Without dead ends: 6644 [2022-01-17 23:15:33,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2022-01-17 23:15:33,408 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 264 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:33,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 770 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6644 states. [2022-01-17 23:15:33,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6644 to 6364. [2022-01-17 23:15:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6364 states, 6363 states have (on average 3.2915291529152917) internal successors, (20944), 6363 states have internal predecessors, (20944), 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:15:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 20944 transitions. [2022-01-17 23:15:33,624 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 20944 transitions. Word has length 77 [2022-01-17 23:15:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:33,624 INFO L470 AbstractCegarLoop]: Abstraction has 6364 states and 20944 transitions. [2022-01-17 23:15:33,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 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:15:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 20944 transitions. [2022-01-17 23:15:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-17 23:15:33,636 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:33,636 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] [2022-01-17 23:15:33,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-17 23:15:33,636 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:33,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash -788070540, now seen corresponding path program 1 times [2022-01-17 23:15:33,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:33,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459822876] [2022-01-17 23:15:33,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:33,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:33,772 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:15:33,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:33,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459822876] [2022-01-17 23:15:33,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459822876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:33,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:33,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-17 23:15:33,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703733834] [2022-01-17 23:15:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:33,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-17 23:15:33,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:33,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-17 23:15:33,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-17 23:15:33,773 INFO L87 Difference]: Start difference. First operand 6364 states and 20944 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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:15:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:33,988 INFO L93 Difference]: Finished difference Result 7164 states and 23365 transitions. [2022-01-17 23:15:33,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-17 23:15:33,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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 77 [2022-01-17 23:15:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:34,004 INFO L225 Difference]: With dead ends: 7164 [2022-01-17 23:15:34,005 INFO L226 Difference]: Without dead ends: 6204 [2022-01-17 23:15:34,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-01-17 23:15:34,005 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 207 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:34,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 703 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6204 states. [2022-01-17 23:15:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6204 to 6028. [2022-01-17 23:15:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6028 states, 6027 states have (on average 3.2818981251037) internal successors, (19780), 6027 states have internal predecessors, (19780), 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:15:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6028 states to 6028 states and 19780 transitions. [2022-01-17 23:15:34,123 INFO L78 Accepts]: Start accepts. Automaton has 6028 states and 19780 transitions. Word has length 77 [2022-01-17 23:15:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:34,123 INFO L470 AbstractCegarLoop]: Abstraction has 6028 states and 19780 transitions. [2022-01-17 23:15:34,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 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:15:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6028 states and 19780 transitions. [2022-01-17 23:15:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-17 23:15:34,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:34,134 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:15:34,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-17 23:15:34,134 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:34,135 INFO L85 PathProgramCache]: Analyzing trace with hash 229835473, now seen corresponding path program 1 times [2022-01-17 23:15:34,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:34,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855407091] [2022-01-17 23:15:34,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:34,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:34,257 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:15:34,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:34,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855407091] [2022-01-17 23:15:34,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855407091] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:34,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:34,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-17 23:15:34,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624684330] [2022-01-17 23:15:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:34,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-17 23:15:34,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:34,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-17 23:15:34,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-17 23:15:34,259 INFO L87 Difference]: Start difference. First operand 6028 states and 19780 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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:15:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:34,451 INFO L93 Difference]: Finished difference Result 7114 states and 23212 transitions. [2022-01-17 23:15:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-17 23:15:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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:15:34,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:34,465 INFO L225 Difference]: With dead ends: 7114 [2022-01-17 23:15:34,465 INFO L226 Difference]: Without dead ends: 6174 [2022-01-17 23:15:34,465 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:15:34,466 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 263 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:34,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 801 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2022-01-17 23:15:34,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 6174. [2022-01-17 23:15:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6174 states, 6173 states have (on average 3.260003239915762) internal successors, (20124), 6173 states have internal predecessors, (20124), 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:15:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 20124 transitions. [2022-01-17 23:15:34,605 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 20124 transitions. Word has length 78 [2022-01-17 23:15:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:34,605 INFO L470 AbstractCegarLoop]: Abstraction has 6174 states and 20124 transitions. [2022-01-17 23:15:34,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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:15:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 20124 transitions. [2022-01-17 23:15:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-17 23:15:34,615 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:34,615 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] [2022-01-17 23:15:34,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-17 23:15:34,616 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1791335166, now seen corresponding path program 1 times [2022-01-17 23:15:34,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:34,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083733885] [2022-01-17 23:15:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:34,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:34,703 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:15:34,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:34,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083733885] [2022-01-17 23:15:34,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083733885] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:34,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:34,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-17 23:15:34,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311430007] [2022-01-17 23:15:34,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:34,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-17 23:15:34,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:34,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-17 23:15:34,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-17 23:15:34,705 INFO L87 Difference]: Start difference. First operand 6174 states and 20124 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:15:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:34,886 INFO L93 Difference]: Finished difference Result 7774 states and 25391 transitions. [2022-01-17 23:15:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-17 23:15:34,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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 79 [2022-01-17 23:15:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:34,903 INFO L225 Difference]: With dead ends: 7774 [2022-01-17 23:15:34,903 INFO L226 Difference]: Without dead ends: 6884 [2022-01-17 23:15:34,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-01-17 23:15:34,904 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 181 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:34,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 599 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6884 states. [2022-01-17 23:15:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6884 to 6501. [2022-01-17 23:15:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6501 states, 6500 states have (on average 3.273846153846154) internal successors, (21280), 6500 states have internal predecessors, (21280), 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:15:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 21280 transitions. [2022-01-17 23:15:35,020 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 21280 transitions. Word has length 79 [2022-01-17 23:15:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:35,020 INFO L470 AbstractCegarLoop]: Abstraction has 6501 states and 21280 transitions. [2022-01-17 23:15:35,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:15:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 21280 transitions. [2022-01-17 23:15:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-17 23:15:35,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:35,031 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] [2022-01-17 23:15:35,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-17 23:15:35,031 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1122411502, now seen corresponding path program 1 times [2022-01-17 23:15:35,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:35,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994777505] [2022-01-17 23:15:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:35,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:35,199 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:15:35,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:35,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994777505] [2022-01-17 23:15:35,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994777505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:35,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:35,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-17 23:15:35,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394028588] [2022-01-17 23:15:35,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:35,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-17 23:15:35,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:35,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-17 23:15:35,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-17 23:15:35,201 INFO L87 Difference]: Start difference. First operand 6501 states and 21280 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 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:15:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:35,430 INFO L93 Difference]: Finished difference Result 7165 states and 23394 transitions. [2022-01-17 23:15:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-17 23:15:35,431 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 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 79 [2022-01-17 23:15:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:35,446 INFO L225 Difference]: With dead ends: 7165 [2022-01-17 23:15:35,447 INFO L226 Difference]: Without dead ends: 6445 [2022-01-17 23:15:35,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-17 23:15:35,447 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 339 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:35,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 841 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2022-01-17 23:15:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 6285. [2022-01-17 23:15:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6285 states, 6284 states have (on average 3.289306174411203) internal successors, (20670), 6284 states have internal predecessors, (20670), 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:15:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 20670 transitions. [2022-01-17 23:15:35,621 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 20670 transitions. Word has length 79 [2022-01-17 23:15:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:35,622 INFO L470 AbstractCegarLoop]: Abstraction has 6285 states and 20670 transitions. [2022-01-17 23:15:35,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 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:15:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 20670 transitions. [2022-01-17 23:15:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-17 23:15:35,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:35,632 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:15:35,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-17 23:15:35,633 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:35,633 INFO L85 PathProgramCache]: Analyzing trace with hash 696457764, now seen corresponding path program 1 times [2022-01-17 23:15:35,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:35,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026318113] [2022-01-17 23:15:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:35,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:35,718 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:15:35,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:35,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026318113] [2022-01-17 23:15:35,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026318113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:35,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:35,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-17 23:15:35,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077987240] [2022-01-17 23:15:35,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:35,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-17 23:15:35,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:35,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-17 23:15:35,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-17 23:15:35,719 INFO L87 Difference]: Start difference. First operand 6285 states and 20670 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 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:15:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:35,894 INFO L93 Difference]: Finished difference Result 9759 states and 32289 transitions. [2022-01-17 23:15:35,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-17 23:15:35,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 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:15:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:35,908 INFO L225 Difference]: With dead ends: 9759 [2022-01-17 23:15:35,908 INFO L226 Difference]: Without dead ends: 6377 [2022-01-17 23:15:35,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-17 23:15:35,909 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 105 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:35,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 835 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6377 states. [2022-01-17 23:15:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6377 to 5537. [2022-01-17 23:15:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5537 states, 5536 states have (on average 3.2333815028901736) internal successors, (17900), 5536 states have internal predecessors, (17900), 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:15:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5537 states to 5537 states and 17900 transitions. [2022-01-17 23:15:36,029 INFO L78 Accepts]: Start accepts. Automaton has 5537 states and 17900 transitions. Word has length 80 [2022-01-17 23:15:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:36,030 INFO L470 AbstractCegarLoop]: Abstraction has 5537 states and 17900 transitions. [2022-01-17 23:15:36,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 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:15:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5537 states and 17900 transitions. [2022-01-17 23:15:36,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-17 23:15:36,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:36,039 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:15:36,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-17 23:15:36,039 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash -832871790, now seen corresponding path program 2 times [2022-01-17 23:15:36,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:36,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835900727] [2022-01-17 23:15:36,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:36,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:36,104 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:15:36,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:36,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835900727] [2022-01-17 23:15:36,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835900727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:36,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:36,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:15:36,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330463686] [2022-01-17 23:15:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:36,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:15:36,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:36,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:15:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:15:36,105 INFO L87 Difference]: Start difference. First operand 5537 states and 17900 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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:15:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:36,255 INFO L93 Difference]: Finished difference Result 6629 states and 21077 transitions. [2022-01-17 23:15:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:15:36,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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:15:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:36,265 INFO L225 Difference]: With dead ends: 6629 [2022-01-17 23:15:36,265 INFO L226 Difference]: Without dead ends: 4869 [2022-01-17 23:15:36,265 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:15:36,266 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 164 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:36,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 374 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2022-01-17 23:15:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4869. [2022-01-17 23:15:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 3.170912078882498) internal successors, (15436), 4868 states have internal predecessors, (15436), 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:15:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 15436 transitions. [2022-01-17 23:15:36,364 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 15436 transitions. Word has length 80 [2022-01-17 23:15:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:36,365 INFO L470 AbstractCegarLoop]: Abstraction has 4869 states and 15436 transitions. [2022-01-17 23:15:36,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 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:15:36,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 15436 transitions. [2022-01-17 23:15:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-17 23:15:36,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:36,372 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] [2022-01-17 23:15:36,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-17 23:15:36,373 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:36,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2104059982, now seen corresponding path program 1 times [2022-01-17 23:15:36,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:36,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712528988] [2022-01-17 23:15:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:36,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:36,445 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:15:36,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:36,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712528988] [2022-01-17 23:15:36,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712528988] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:36,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:36,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-17 23:15:36,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871104172] [2022-01-17 23:15:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:36,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-17 23:15:36,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:36,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-17 23:15:36,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-17 23:15:36,447 INFO L87 Difference]: Start difference. First operand 4869 states and 15436 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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:15:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:36,618 INFO L93 Difference]: Finished difference Result 4641 states and 14309 transitions. [2022-01-17 23:15:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-17 23:15:36,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 81 [2022-01-17 23:15:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:36,625 INFO L225 Difference]: With dead ends: 4641 [2022-01-17 23:15:36,625 INFO L226 Difference]: Without dead ends: 3246 [2022-01-17 23:15:36,625 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:15:36,625 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 258 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:36,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 422 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-01-17 23:15:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3198. [2022-01-17 23:15:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3198 states, 3197 states have (on average 3.035658429777917) internal successors, (9705), 3197 states have internal predecessors, (9705), 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:15:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 9705 transitions. [2022-01-17 23:15:36,682 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 9705 transitions. Word has length 81 [2022-01-17 23:15:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:36,682 INFO L470 AbstractCegarLoop]: Abstraction has 3198 states and 9705 transitions. [2022-01-17 23:15:36,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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:15:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 9705 transitions. [2022-01-17 23:15:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-17 23:15:36,687 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:36,687 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:15:36,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-17 23:15:36,687 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:36,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash 726712963, now seen corresponding path program 1 times [2022-01-17 23:15:36,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:36,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451447152] [2022-01-17 23:15:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:36,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:36,767 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:15:36,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:36,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451447152] [2022-01-17 23:15:36,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451447152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:36,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:36,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-17 23:15:36,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115218422] [2022-01-17 23:15:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:36,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-17 23:15:36,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-17 23:15:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-17 23:15:36,769 INFO L87 Difference]: Start difference. First operand 3198 states and 9705 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:15:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:36,919 INFO L93 Difference]: Finished difference Result 2532 states and 7440 transitions. [2022-01-17 23:15:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-17 23:15:36,919 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:15:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:36,922 INFO L225 Difference]: With dead ends: 2532 [2022-01-17 23:15:36,923 INFO L226 Difference]: Without dead ends: 1533 [2022-01-17 23:15:36,923 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:15:36,923 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 280 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:36,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 400 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2022-01-17 23:15:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1485. [2022-01-17 23:15:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1484 states have (on average 2.881401617250674) internal successors, (4276), 1484 states have internal predecessors, (4276), 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:15:36,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 4276 transitions. [2022-01-17 23:15:36,947 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 4276 transitions. Word has length 83 [2022-01-17 23:15:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:36,948 INFO L470 AbstractCegarLoop]: Abstraction has 1485 states and 4276 transitions. [2022-01-17 23:15:36,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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:15:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 4276 transitions. [2022-01-17 23:15:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-17 23:15:36,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:36,950 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] [2022-01-17 23:15:36,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-17 23:15:36,950 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:36,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash 175298075, now seen corresponding path program 1 times [2022-01-17 23:15:36,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:36,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678637806] [2022-01-17 23:15:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:36,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:15:37,270 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:15:37,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:15:37,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678637806] [2022-01-17 23:15:37,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678637806] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:15:37,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:15:37,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-17 23:15:37,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525588030] [2022-01-17 23:15:37,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:15:37,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-17 23:15:37,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:15:37,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-17 23:15:37,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-01-17 23:15:37,271 INFO L87 Difference]: Start difference. First operand 1485 states and 4276 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 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:15:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:15:37,496 INFO L93 Difference]: Finished difference Result 2136 states and 6234 transitions. [2022-01-17 23:15:37,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-17 23:15:37,496 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 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 86 [2022-01-17 23:15:37,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:15:37,498 INFO L225 Difference]: With dead ends: 2136 [2022-01-17 23:15:37,498 INFO L226 Difference]: Without dead ends: 1033 [2022-01-17 23:15:37,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-01-17 23:15:37,499 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 186 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:15:37,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 1514 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:15:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-01-17 23:15:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2022-01-17 23:15:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 2.794573643410853) internal successors, (2884), 1032 states have internal predecessors, (2884), 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:15:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 2884 transitions. [2022-01-17 23:15:37,513 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 2884 transitions. Word has length 86 [2022-01-17 23:15:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:15:37,513 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 2884 transitions. [2022-01-17 23:15:37,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 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:15:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 2884 transitions. [2022-01-17 23:15:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-17 23:15:37,515 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:15:37,515 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] [2022-01-17 23:15:37,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-17 23:15:37,515 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:15:37,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:15:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash 778281435, now seen corresponding path program 2 times [2022-01-17 23:15:37,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:15:37,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503919457] [2022-01-17 23:15:37,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:15:37,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:15:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-17 23:15:37,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-17 23:15:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-17 23:15:37,607 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-17 23:15:37,607 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-17 23:15:37,608 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-17 23:15:37,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-17 23:15:37,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-17 23:15:37,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-17 23:15:37,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-17 23:15:37,609 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-17 23:15:37,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-17 23:15:37,611 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:15:37,615 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-17 23:15:37,615 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-17 23:15:37,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.01 11:15:37 BasicIcfg [2022-01-17 23:15:37,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-17 23:15:37,703 INFO L158 Benchmark]: Toolchain (without parser) took 10990.52ms. Allocated memory was 392.2MB in the beginning and 3.2GB in the end (delta: 2.8GB). Free memory was 337.1MB in the beginning and 2.3GB in the end (delta: -1.9GB). Peak memory consumption was 826.5MB. Max. memory is 16.0GB. [2022-01-17 23:15:37,703 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 392.2MB. Free memory is still 354.7MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-17 23:15:37,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.17ms. Allocated memory was 392.2MB in the beginning and 471.9MB in the end (delta: 79.7MB). Free memory was 336.8MB in the beginning and 432.3MB in the end (delta: -95.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.0GB. [2022-01-17 23:15:37,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.27ms. Allocated memory is still 471.9MB. Free memory was 432.3MB in the beginning and 429.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-17 23:15:37,704 INFO L158 Benchmark]: Boogie Preprocessor took 20.85ms. Allocated memory is still 471.9MB. Free memory was 429.2MB in the beginning and 426.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-17 23:15:37,704 INFO L158 Benchmark]: RCFGBuilder took 796.16ms. Allocated memory is still 471.9MB. Free memory was 426.1MB in the beginning and 346.4MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. [2022-01-17 23:15:37,704 INFO L158 Benchmark]: TraceAbstraction took 9624.91ms. Allocated memory was 471.9MB in the beginning and 3.2GB in the end (delta: 2.7GB). Free memory was 346.4MB in the beginning and 2.3GB in the end (delta: -1.9GB). Peak memory consumption was 755.4MB. Max. memory is 16.0GB. [2022-01-17 23:15:37,705 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.10ms. Allocated memory is still 392.2MB. Free memory is still 354.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 492.17ms. Allocated memory was 392.2MB in the beginning and 471.9MB in the end (delta: 79.7MB). Free memory was 336.8MB in the beginning and 432.3MB in the end (delta: -95.5MB). Peak memory consumption was 9.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.27ms. Allocated memory is still 471.9MB. Free memory was 432.3MB in the beginning and 429.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.85ms. Allocated memory is still 471.9MB. Free memory was 429.2MB in the beginning and 426.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 796.16ms. Allocated memory is still 471.9MB. Free memory was 426.1MB in the beginning and 346.4MB in the end (delta: 79.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. * TraceAbstraction took 9624.91ms. Allocated memory was 471.9MB in the beginning and 3.2GB in the end (delta: 2.7GB). Free memory was 346.4MB in the beginning and 2.3GB in the end (delta: -1.9GB). Peak memory consumption was 755.4MB. 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={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] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-2, t2177={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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6: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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=-1, t2177={5:0}, t2178={6: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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3: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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=0, t2177={5:0}, t2178={6:0}, t2179={3: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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 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) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] 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) [L791] 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) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 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 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 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 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] 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) [L824] 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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 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 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L835] 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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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)) [L841] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 816]: 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: 818]: 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: 814]: 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, 138 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3051 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3051 mSDsluCounter, 10218 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8873 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2019 IncrementalHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 2041 mSDtfsCounter, 2019 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12305occurred in iteration=0, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 3001 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1202 ConstructedInterpolants, 0 QuantifiedInterpolants, 6941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:15:37,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...