/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/safe004_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bc79526 [2022-01-17 23:14:14,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-17 23:14:14,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-17 23:14:14,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-17 23:14:14,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-17 23:14:14,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-17 23:14:14,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-17 23:14:14,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-17 23:14:14,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-17 23:14:14,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-17 23:14:14,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-17 23:14:14,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-17 23:14:14,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-17 23:14:14,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-17 23:14:14,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-17 23:14:14,950 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-17 23:14:14,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-17 23:14:14,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-17 23:14:14,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-17 23:14:14,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-17 23:14:14,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-17 23:14:14,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-17 23:14:14,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-17 23:14:14,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-17 23:14:14,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-17 23:14:14,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-17 23:14:14,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-17 23:14:14,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-17 23:14:14,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-17 23:14:14,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-17 23:14:14,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-17 23:14:14,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-17 23:14:14,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-17 23:14:14,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-17 23:14:14,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-17 23:14:14,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-17 23:14:14,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-17 23:14:14,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-17 23:14:14,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-17 23:14:14,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-17 23:14:14,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-17 23:14:14,975 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:14:15,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-17 23:14:15,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-17 23:14:15,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-17 23:14:15,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-17 23:14:15,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-17 23:14:15,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-17 23:14:15,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-17 23:14:15,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-17 23:14:15,007 INFO L138 SettingsManager]: * Use SBE=true [2022-01-17 23:14:15,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-17 23:14:15,008 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-17 23:14:15,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-17 23:14:15,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-17 23:14:15,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-17 23:14:15,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-17 23:14:15,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-17 23:14:15,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-17 23:14:15,009 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-17 23:14:15,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-17 23:14:15,009 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-17 23:14:15,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-17 23:14:15,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-17 23:14:15,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-17 23:14:15,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-17 23:14:15,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-17 23:14:15,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 23:14:15,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-17 23:14:15,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-17 23:14:15,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-17 23:14:15,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-17 23:14:15,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-17 23:14:15,011 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-17 23:14:15,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-17 23:14:15,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-17 23:14:15,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-17 23:14:15,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-17 23:14:15,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-17 23:14:15,252 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-17 23:14:15,252 INFO L275 PluginConnector]: CDTParser initialized [2022-01-17 23:14:15,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-01-17 23:14:15,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab7ca557/9f5dcf6eb126455d9479db702170fa64/FLAG4f2d7e452 [2022-01-17 23:14:15,770 INFO L306 CDTParser]: Found 1 translation units. [2022-01-17 23:14:15,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-01-17 23:14:15,786 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab7ca557/9f5dcf6eb126455d9479db702170fa64/FLAG4f2d7e452 [2022-01-17 23:14:15,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dab7ca557/9f5dcf6eb126455d9479db702170fa64 [2022-01-17 23:14:15,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-17 23:14:15,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-17 23:14:15,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-17 23:14:15,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-17 23:14:15,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-17 23:14:15,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 11:14:15" (1/1) ... [2022-01-17 23:14:15,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3672d839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:15, skipping insertion in model container [2022-01-17 23:14:15,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.01 11:14:15" (1/1) ... [2022-01-17 23:14:15,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-17 23:14:15,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-17 23:14:16,022 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-01-17 23:14:16,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 23:14:16,220 INFO L203 MainTranslator]: Completed pre-run [2022-01-17 23:14:16,232 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/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-01-17 23:14:16,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-17 23:14:16,313 INFO L208 MainTranslator]: Completed translation [2022-01-17 23:14:16,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:16 WrapperNode [2022-01-17 23:14:16,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-17 23:14:16,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-17 23:14:16,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-17 23:14:16,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-17 23:14:16,322 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:14:16" (1/1) ... [2022-01-17 23:14:16,338 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:14:16" (1/1) ... [2022-01-17 23:14:16,384 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274 [2022-01-17 23:14:16,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-17 23:14:16,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-17 23:14:16,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-17 23:14:16,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-17 23:14:16,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:16" (1/1) ... [2022-01-17 23:14:16,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:16" (1/1) ... [2022-01-17 23:14:16,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:16" (1/1) ... [2022-01-17 23:14:16,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:16" (1/1) ... [2022-01-17 23:14:16,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:16" (1/1) ... [2022-01-17 23:14:16,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:16" (1/1) ... [2022-01-17 23:14:16,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:16" (1/1) ... [2022-01-17 23:14:16,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-17 23:14:16,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-17 23:14:16,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-17 23:14:16,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-17 23:14:16,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:16" (1/1) ... [2022-01-17 23:14:16,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-17 23:14:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-17 23:14:16,508 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:14:16,533 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:14:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-17 23:14:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-17 23:14:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-17 23:14:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-17 23:14:16,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-17 23:14:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-17 23:14:16,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-17 23:14:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-17 23:14:16,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-17 23:14:16,554 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-17 23:14:16,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-17 23:14:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-17 23:14:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-17 23:14:16,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-17 23:14:16,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-17 23:14:16,557 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:14:16,733 INFO L234 CfgBuilder]: Building ICFG [2022-01-17 23:14:16,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-17 23:14:17,105 INFO L275 CfgBuilder]: Performing block encoding [2022-01-17 23:14:17,406 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-17 23:14:17,406 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-17 23:14:17,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 11:14:17 BoogieIcfgContainer [2022-01-17 23:14:17,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-17 23:14:17,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-17 23:14:17,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-17 23:14:17,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-17 23:14:17,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.01 11:14:15" (1/3) ... [2022-01-17 23:14:17,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cf41f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 11:14:17, skipping insertion in model container [2022-01-17 23:14:17,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.01 11:14:16" (2/3) ... [2022-01-17 23:14:17,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cf41f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.01 11:14:17, skipping insertion in model container [2022-01-17 23:14:17,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.01 11:14:17" (3/3) ... [2022-01-17 23:14:17,416 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2022-01-17 23:14:17,420 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-17 23:14:17,420 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-17 23:14:17,420 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-17 23:14:17,421 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-17 23:14:17,467 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,468 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,468 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,468 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,468 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,468 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,469 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,469 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,469 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,469 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,470 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,470 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,470 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,470 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,470 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,471 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,471 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,471 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,472 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,472 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,472 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,472 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,473 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,474 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,474 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,474 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,475 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,475 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,475 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,475 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,476 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,476 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,476 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,476 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,476 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,476 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,477 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,477 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,477 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,477 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,477 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,477 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,478 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,478 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,478 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,478 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,479 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,479 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,479 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,479 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,480 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,480 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,480 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,480 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,480 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,480 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,481 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,481 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,481 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,481 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,482 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,482 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,482 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,483 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,483 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,483 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,483 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,483 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,483 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,484 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,485 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,485 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,485 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,486 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,486 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,486 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,486 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,487 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,487 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,487 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,488 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,494 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,495 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,496 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,498 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,502 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,502 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,502 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,502 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,502 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,502 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,503 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,503 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,504 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,504 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,504 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,504 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,504 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,504 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,504 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,505 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,506 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,506 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,506 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,506 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,506 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,507 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,507 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,507 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,507 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,507 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,507 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,507 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-17 23:14:17,508 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-17 23:14:17,559 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-17 23:14:17,567 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:14:17,568 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-17 23:14:17,578 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 114 transitions, 243 flow [2022-01-17 23:14:18,048 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14042 states, 14039 states have (on average 3.567490562005841) internal successors, (50084), 14041 states have internal predecessors, (50084), 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:14:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 14042 states, 14039 states have (on average 3.567490562005841) internal successors, (50084), 14041 states have internal predecessors, (50084), 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:14:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-17 23:14:18,101 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:18,101 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] [2022-01-17 23:14:18,102 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:18,115 INFO L85 PathProgramCache]: Analyzing trace with hash -388777824, now seen corresponding path program 1 times [2022-01-17 23:14:18,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:18,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887523235] [2022-01-17 23:14:18,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:18,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:18,432 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:14:18,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:18,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887523235] [2022-01-17 23:14:18,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887523235] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:18,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:18,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-17 23:14:18,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259762876] [2022-01-17 23:14:18,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:18,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-17 23:14:18,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:18,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-17 23:14:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-17 23:14:18,514 INFO L87 Difference]: Start difference. First operand has 14042 states, 14039 states have (on average 3.567490562005841) internal successors, (50084), 14041 states have internal predecessors, (50084), 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 25.5) internal successors, (51), 3 states have internal predecessors, (51), 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:14:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:18,864 INFO L93 Difference]: Finished difference Result 11810 states and 41123 transitions. [2022-01-17 23:14:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-17 23:14:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2022-01-17 23:14:18,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:18,960 INFO L225 Difference]: With dead ends: 11810 [2022-01-17 23:14:18,961 INFO L226 Difference]: Without dead ends: 9762 [2022-01-17 23:14:18,962 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:14:18,967 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 47 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:18,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 163 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-17 23:14:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9762 states. [2022-01-17 23:14:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9762 to 9762. [2022-01-17 23:14:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9762 states, 9761 states have (on average 3.5114230099375066) internal successors, (34275), 9761 states have internal predecessors, (34275), 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:14:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9762 states to 9762 states and 34275 transitions. [2022-01-17 23:14:19,572 INFO L78 Accepts]: Start accepts. Automaton has 9762 states and 34275 transitions. Word has length 51 [2022-01-17 23:14:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:19,573 INFO L470 AbstractCegarLoop]: Abstraction has 9762 states and 34275 transitions. [2022-01-17 23:14:19,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 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:14:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 9762 states and 34275 transitions. [2022-01-17 23:14:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-17 23:14:19,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:19,597 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] [2022-01-17 23:14:19,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-17 23:14:19,598 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1563106335, now seen corresponding path program 1 times [2022-01-17 23:14:19,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:19,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556671753] [2022-01-17 23:14:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:19,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:19,881 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:14:19,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:19,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556671753] [2022-01-17 23:14:19,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556671753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:19,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:19,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:14:19,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026355666] [2022-01-17 23:14:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:19,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:14:19,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:19,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:14:19,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:14:19,884 INFO L87 Difference]: Start difference. First operand 9762 states and 34275 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:14:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:20,395 INFO L93 Difference]: Finished difference Result 11986 states and 41789 transitions. [2022-01-17 23:14:20,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:14:20,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 73 [2022-01-17 23:14:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:20,465 INFO L225 Difference]: With dead ends: 11986 [2022-01-17 23:14:20,465 INFO L226 Difference]: Without dead ends: 9426 [2022-01-17 23:14:20,466 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:14:20,467 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 122 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:20,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 523 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-17 23:14:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9426 states. [2022-01-17 23:14:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9426 to 9426. [2022-01-17 23:14:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9426 states, 9425 states have (on average 3.4984615384615383) internal successors, (32973), 9425 states have internal predecessors, (32973), 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:14:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9426 states to 9426 states and 32973 transitions. [2022-01-17 23:14:20,816 INFO L78 Accepts]: Start accepts. Automaton has 9426 states and 32973 transitions. Word has length 73 [2022-01-17 23:14:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:20,817 INFO L470 AbstractCegarLoop]: Abstraction has 9426 states and 32973 transitions. [2022-01-17 23:14:20,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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:14:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 9426 states and 32973 transitions. [2022-01-17 23:14:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-17 23:14:20,835 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:20,835 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] [2022-01-17 23:14:20,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-17 23:14:20,839 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:20,840 INFO L85 PathProgramCache]: Analyzing trace with hash 774671902, now seen corresponding path program 1 times [2022-01-17 23:14:20,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:20,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858819075] [2022-01-17 23:14:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:20,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:21,031 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:14:21,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:21,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858819075] [2022-01-17 23:14:21,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858819075] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:21,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:21,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:14:21,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754368578] [2022-01-17 23:14:21,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:21,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:14:21,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:21,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:14:21,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:14:21,034 INFO L87 Difference]: Start difference. First operand 9426 states and 32973 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:14:21,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:21,378 INFO L93 Difference]: Finished difference Result 10934 states and 37951 transitions. [2022-01-17 23:14:21,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:14:21,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 75 [2022-01-17 23:14:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:21,415 INFO L225 Difference]: With dead ends: 10934 [2022-01-17 23:14:21,415 INFO L226 Difference]: Without dead ends: 8614 [2022-01-17 23:14:21,416 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:14:21,421 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 131 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 518 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:14:21,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 518 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:14:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8614 states. [2022-01-17 23:14:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8614 to 8614. [2022-01-17 23:14:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8614 states, 8613 states have (on average 3.4771856495994427) internal successors, (29949), 8613 states have internal predecessors, (29949), 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:14:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8614 states to 8614 states and 29949 transitions. [2022-01-17 23:14:21,793 INFO L78 Accepts]: Start accepts. Automaton has 8614 states and 29949 transitions. Word has length 75 [2022-01-17 23:14:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:21,797 INFO L470 AbstractCegarLoop]: Abstraction has 8614 states and 29949 transitions. [2022-01-17 23:14:21,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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:14:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 8614 states and 29949 transitions. [2022-01-17 23:14:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-17 23:14:21,816 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:21,816 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:14:21,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-17 23:14:21,817 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:21,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:21,818 INFO L85 PathProgramCache]: Analyzing trace with hash 537386719, now seen corresponding path program 1 times [2022-01-17 23:14:21,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:21,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021177901] [2022-01-17 23:14:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:21,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:22,102 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:14:22,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:22,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021177901] [2022-01-17 23:14:22,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021177901] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:22,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:22,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-17 23:14:22,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592676250] [2022-01-17 23:14:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:22,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-17 23:14:22,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:22,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-17 23:14:22,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-17 23:14:22,105 INFO L87 Difference]: Start difference. First operand 8614 states and 29949 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 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:14:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:22,465 INFO L93 Difference]: Finished difference Result 10270 states and 35467 transitions. [2022-01-17 23:14:22,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-17 23:14:22,466 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 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:14:22,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:22,503 INFO L225 Difference]: With dead ends: 10270 [2022-01-17 23:14:22,503 INFO L226 Difference]: Without dead ends: 8530 [2022-01-17 23:14:22,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-01-17 23:14:22,504 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 373 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:22,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 614 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-17 23:14:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8530 states. [2022-01-17 23:14:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8530 to 8530. [2022-01-17 23:14:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8530 states, 8529 states have (on average 3.4720365810763276) internal successors, (29613), 8529 states have internal predecessors, (29613), 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:14:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8530 states to 8530 states and 29613 transitions. [2022-01-17 23:14:22,837 INFO L78 Accepts]: Start accepts. Automaton has 8530 states and 29613 transitions. Word has length 77 [2022-01-17 23:14:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:22,838 INFO L470 AbstractCegarLoop]: Abstraction has 8530 states and 29613 transitions. [2022-01-17 23:14:22,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 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:14:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8530 states and 29613 transitions. [2022-01-17 23:14:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-17 23:14:22,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:22,858 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:14:22,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-17 23:14:22,859 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:22,859 INFO L85 PathProgramCache]: Analyzing trace with hash 232111056, now seen corresponding path program 1 times [2022-01-17 23:14:22,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:22,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747368803] [2022-01-17 23:14:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:22,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:22,988 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:14:22,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:22,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747368803] [2022-01-17 23:14:22,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747368803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:22,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:22,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:14:22,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144399013] [2022-01-17 23:14:22,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:22,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:14:22,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:22,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:14:22,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:14:22,991 INFO L87 Difference]: Start difference. First operand 8530 states and 29613 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:14:23,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:23,304 INFO L93 Difference]: Finished difference Result 9726 states and 33509 transitions. [2022-01-17 23:14:23,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:14:23,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-01-17 23:14:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:23,352 INFO L225 Difference]: With dead ends: 9726 [2022-01-17 23:14:23,353 INFO L226 Difference]: Without dead ends: 8166 [2022-01-17 23:14:23,353 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:14:23,355 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 123 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 503 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:14:23,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 503 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:14:23,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2022-01-17 23:14:23,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 8166. [2022-01-17 23:14:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8166 states, 8165 states have (on average 3.462216778934476) internal successors, (28269), 8165 states have internal predecessors, (28269), 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:14:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8166 states to 8166 states and 28269 transitions. [2022-01-17 23:14:23,607 INFO L78 Accepts]: Start accepts. Automaton has 8166 states and 28269 transitions. Word has length 78 [2022-01-17 23:14:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:23,608 INFO L470 AbstractCegarLoop]: Abstraction has 8166 states and 28269 transitions. [2022-01-17 23:14:23,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:14:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 8166 states and 28269 transitions. [2022-01-17 23:14:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-17 23:14:23,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:23,630 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:14:23,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-17 23:14:23,631 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:23,631 INFO L85 PathProgramCache]: Analyzing trace with hash 436624964, now seen corresponding path program 1 times [2022-01-17 23:14:23,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:23,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358367569] [2022-01-17 23:14:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:23,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:23,739 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:14:23,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:23,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358367569] [2022-01-17 23:14:23,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358367569] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:23,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:23,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-17 23:14:23,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104528606] [2022-01-17 23:14:23,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:23,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-17 23:14:23,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:23,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-17 23:14:23,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-17 23:14:23,742 INFO L87 Difference]: Start difference. First operand 8166 states and 28269 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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:14:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:24,214 INFO L93 Difference]: Finished difference Result 18274 states and 62643 transitions. [2022-01-17 23:14:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-17 23:14:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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:14:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:24,260 INFO L225 Difference]: With dead ends: 18274 [2022-01-17 23:14:24,261 INFO L226 Difference]: Without dead ends: 10859 [2022-01-17 23:14:24,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-01-17 23:14:24,261 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 160 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:24,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 868 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-17 23:14:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10859 states. [2022-01-17 23:14:24,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10859 to 8166. [2022-01-17 23:14:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8166 states, 8165 states have (on average 3.413472137170851) internal successors, (27871), 8165 states have internal predecessors, (27871), 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:14:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8166 states to 8166 states and 27871 transitions. [2022-01-17 23:14:24,548 INFO L78 Accepts]: Start accepts. Automaton has 8166 states and 27871 transitions. Word has length 79 [2022-01-17 23:14:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:24,548 INFO L470 AbstractCegarLoop]: Abstraction has 8166 states and 27871 transitions. [2022-01-17 23:14:24,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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:14:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8166 states and 27871 transitions. [2022-01-17 23:14:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-17 23:14:24,626 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:24,627 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:14:24,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-17 23:14:24,627 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1728430572, now seen corresponding path program 1 times [2022-01-17 23:14:24,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:24,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998111958] [2022-01-17 23:14:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:24,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:24,784 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:14:24,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:24,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998111958] [2022-01-17 23:14:24,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998111958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:24,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:24,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-17 23:14:24,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504821674] [2022-01-17 23:14:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:24,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-17 23:14:24,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:24,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-17 23:14:24,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-17 23:14:24,786 INFO L87 Difference]: Start difference. First operand 8166 states and 27871 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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:14:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:24,999 INFO L93 Difference]: Finished difference Result 11815 states and 40166 transitions. [2022-01-17 23:14:24,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-17 23:14:25,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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:14:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:25,024 INFO L225 Difference]: With dead ends: 11815 [2022-01-17 23:14:25,025 INFO L226 Difference]: Without dead ends: 6171 [2022-01-17 23:14:25,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-01-17 23:14:25,026 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 166 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:25,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 549 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:14:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2022-01-17 23:14:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 6171. [2022-01-17 23:14:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6171 states, 6170 states have (on average 3.340518638573744) internal successors, (20611), 6170 states have internal predecessors, (20611), 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:14:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6171 states to 6171 states and 20611 transitions. [2022-01-17 23:14:25,179 INFO L78 Accepts]: Start accepts. Automaton has 6171 states and 20611 transitions. Word has length 79 [2022-01-17 23:14:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:25,179 INFO L470 AbstractCegarLoop]: Abstraction has 6171 states and 20611 transitions. [2022-01-17 23:14:25,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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:14:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6171 states and 20611 transitions. [2022-01-17 23:14:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-17 23:14:25,192 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:25,192 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:14:25,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-17 23:14:25,192 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:25,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1527453391, now seen corresponding path program 1 times [2022-01-17 23:14:25,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:25,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541059798] [2022-01-17 23:14:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:25,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:25,296 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:14:25,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:25,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541059798] [2022-01-17 23:14:25,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541059798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:25,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:25,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:14:25,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307914057] [2022-01-17 23:14:25,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:25,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:14:25,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:25,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:14:25,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:14:25,298 INFO L87 Difference]: Start difference. First operand 6171 states and 20611 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:14:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:25,525 INFO L93 Difference]: Finished difference Result 9190 states and 30653 transitions. [2022-01-17 23:14:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:14:25,527 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:14:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:25,543 INFO L225 Difference]: With dead ends: 9190 [2022-01-17 23:14:25,543 INFO L226 Difference]: Without dead ends: 3873 [2022-01-17 23:14:25,543 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:14:25,544 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 110 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:25,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 598 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:14:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3873 states. [2022-01-17 23:14:25,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3873 to 3873. [2022-01-17 23:14:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3873 states, 3872 states have (on average 3.3042355371900825) internal successors, (12794), 3872 states have internal predecessors, (12794), 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:14:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 12794 transitions. [2022-01-17 23:14:25,657 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 12794 transitions. Word has length 80 [2022-01-17 23:14:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:25,658 INFO L470 AbstractCegarLoop]: Abstraction has 3873 states and 12794 transitions. [2022-01-17 23:14:25,658 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:14:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 12794 transitions. [2022-01-17 23:14:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-17 23:14:25,666 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:25,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:14:25,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-17 23:14:25,667 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1700829820, now seen corresponding path program 1 times [2022-01-17 23:14:25,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:25,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604137358] [2022-01-17 23:14:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:25,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:25,776 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:14:25,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:25,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604137358] [2022-01-17 23:14:25,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604137358] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:25,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:25,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-17 23:14:25,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015775073] [2022-01-17 23:14:25,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:25,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-17 23:14:25,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:25,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-17 23:14:25,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-17 23:14:25,779 INFO L87 Difference]: Start difference. First operand 3873 states and 12794 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:14:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:25,930 INFO L93 Difference]: Finished difference Result 4654 states and 15174 transitions. [2022-01-17 23:14:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:14:25,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-01-17 23:14:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:25,944 INFO L225 Difference]: With dead ends: 4654 [2022-01-17 23:14:25,944 INFO L226 Difference]: Without dead ends: 3444 [2022-01-17 23:14:25,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-17 23:14:25,947 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 160 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:25,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 380 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:14:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2022-01-17 23:14:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3444. [2022-01-17 23:14:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3444 states, 3443 states have (on average 3.2593668312518154) internal successors, (11222), 3443 states have internal predecessors, (11222), 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:14:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 11222 transitions. [2022-01-17 23:14:26,038 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 11222 transitions. Word has length 82 [2022-01-17 23:14:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:26,038 INFO L470 AbstractCegarLoop]: Abstraction has 3444 states and 11222 transitions. [2022-01-17 23:14:26,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:14:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 11222 transitions. [2022-01-17 23:14:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-17 23:14:26,045 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:26,046 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:14:26,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-17 23:14:26,046 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:26,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2121210669, now seen corresponding path program 1 times [2022-01-17 23:14:26,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:26,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97821316] [2022-01-17 23:14:26,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:26,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:26,174 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:14:26,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:26,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97821316] [2022-01-17 23:14:26,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97821316] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:26,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:26,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-17 23:14:26,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413907267] [2022-01-17 23:14:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:26,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-17 23:14:26,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:26,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-17 23:14:26,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-17 23:14:26,176 INFO L87 Difference]: Start difference. First operand 3444 states and 11222 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:14:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:26,345 INFO L93 Difference]: Finished difference Result 3378 states and 10674 transitions. [2022-01-17 23:14:26,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-17 23:14:26,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-01-17 23:14:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:26,355 INFO L225 Difference]: With dead ends: 3378 [2022-01-17 23:14:26,355 INFO L226 Difference]: Without dead ends: 2388 [2022-01-17 23:14:26,355 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:14:26,356 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 244 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:26,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 418 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:14:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2022-01-17 23:14:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2022-01-17 23:14:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 2387 states have (on average 3.109342270632593) internal successors, (7422), 2387 states have internal predecessors, (7422), 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:14:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 7422 transitions. [2022-01-17 23:14:26,405 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 7422 transitions. Word has length 83 [2022-01-17 23:14:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:26,405 INFO L470 AbstractCegarLoop]: Abstraction has 2388 states and 7422 transitions. [2022-01-17 23:14:26,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-17 23:14:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 7422 transitions. [2022-01-17 23:14:26,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-17 23:14:26,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:26,411 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] [2022-01-17 23:14:26,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-17 23:14:26,411 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:26,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:26,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2006673292, now seen corresponding path program 1 times [2022-01-17 23:14:26,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:26,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711456649] [2022-01-17 23:14:26,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:26,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:26,528 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:14:26,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:26,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711456649] [2022-01-17 23:14:26,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711456649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:26,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:26,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-17 23:14:26,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60540787] [2022-01-17 23:14:26,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:26,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-17 23:14:26,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:26,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-17 23:14:26,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-17 23:14:26,530 INFO L87 Difference]: Start difference. First operand 2388 states and 7422 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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:14:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:26,697 INFO L93 Difference]: Finished difference Result 1839 states and 5520 transitions. [2022-01-17 23:14:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-17 23:14:26,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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 85 [2022-01-17 23:14:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:26,701 INFO L225 Difference]: With dead ends: 1839 [2022-01-17 23:14:26,701 INFO L226 Difference]: Without dead ends: 1299 [2022-01-17 23:14:26,702 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:14:26,702 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 251 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:26,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 435 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:14:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2022-01-17 23:14:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1299. [2022-01-17 23:14:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1298 states have (on average 2.921417565485362) internal successors, (3792), 1298 states have internal predecessors, (3792), 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:14:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 3792 transitions. [2022-01-17 23:14:26,727 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 3792 transitions. Word has length 85 [2022-01-17 23:14:26,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:26,728 INFO L470 AbstractCegarLoop]: Abstraction has 1299 states and 3792 transitions. [2022-01-17 23:14:26,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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:14:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 3792 transitions. [2022-01-17 23:14:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-17 23:14:26,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:26,731 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:14:26,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-17 23:14:26,732 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:26,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash 750456210, now seen corresponding path program 1 times [2022-01-17 23:14:26,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:26,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395652446] [2022-01-17 23:14:26,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:26,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:26,991 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:14:26,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:26,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395652446] [2022-01-17 23:14:26,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395652446] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:26,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:26,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-17 23:14:26,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755769132] [2022-01-17 23:14:26,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:26,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-17 23:14:26,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:26,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-17 23:14:26,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-17 23:14:26,993 INFO L87 Difference]: Start difference. First operand 1299 states and 3792 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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:14:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:27,181 INFO L93 Difference]: Finished difference Result 2010 states and 5943 transitions. [2022-01-17 23:14:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-17 23:14:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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 88 [2022-01-17 23:14:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:27,187 INFO L225 Difference]: With dead ends: 2010 [2022-01-17 23:14:27,187 INFO L226 Difference]: Without dead ends: 1275 [2022-01-17 23:14:27,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-01-17 23:14:27,188 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 245 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:27,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 657 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:14:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2022-01-17 23:14:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1155. [2022-01-17 23:14:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 2.82842287694974) internal successors, (3264), 1154 states have internal predecessors, (3264), 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:14:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 3264 transitions. [2022-01-17 23:14:27,212 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 3264 transitions. Word has length 88 [2022-01-17 23:14:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:27,212 INFO L470 AbstractCegarLoop]: Abstraction has 1155 states and 3264 transitions. [2022-01-17 23:14:27,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 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:14:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 3264 transitions. [2022-01-17 23:14:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-17 23:14:27,215 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:27,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:14:27,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-17 23:14:27,216 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:27,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash -582411406, now seen corresponding path program 2 times [2022-01-17 23:14:27,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:27,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144253882] [2022-01-17 23:14:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:27,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-17 23:14:27,578 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:14:27,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-17 23:14:27,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144253882] [2022-01-17 23:14:27,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144253882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-17 23:14:27,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-17 23:14:27,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-17 23:14:27,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863076846] [2022-01-17 23:14:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-17 23:14:27,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-17 23:14:27,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-17 23:14:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-17 23:14:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-01-17 23:14:27,580 INFO L87 Difference]: Start difference. First operand 1155 states and 3264 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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:14:27,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-17 23:14:27,824 INFO L93 Difference]: Finished difference Result 1806 states and 5222 transitions. [2022-01-17 23:14:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-17 23:14:27,825 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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 88 [2022-01-17 23:14:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-17 23:14:27,828 INFO L225 Difference]: With dead ends: 1806 [2022-01-17 23:14:27,828 INFO L226 Difference]: Without dead ends: 991 [2022-01-17 23:14:27,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-01-17 23:14:27,830 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 242 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-17 23:14:27,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 992 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-17 23:14:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2022-01-17 23:14:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2022-01-17 23:14:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 2.8282828282828283) internal successors, (2800), 990 states have internal predecessors, (2800), 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:14:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2800 transitions. [2022-01-17 23:14:27,849 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2800 transitions. Word has length 88 [2022-01-17 23:14:27,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-17 23:14:27,849 INFO L470 AbstractCegarLoop]: Abstraction has 991 states and 2800 transitions. [2022-01-17 23:14:27,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 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:14:27,849 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2800 transitions. [2022-01-17 23:14:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-17 23:14:27,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-17 23:14:27,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:14:27,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-17 23:14:27,852 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-17 23:14:27,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-17 23:14:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1476411374, now seen corresponding path program 3 times [2022-01-17 23:14:27,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-17 23:14:27,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238887848] [2022-01-17 23:14:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-17 23:14:27,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-17 23:14:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-17 23:14:27,901 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-17 23:14:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-17 23:14:28,024 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-17 23:14:28,024 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-17 23:14:28,025 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-17 23:14:28,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-17 23:14:28,027 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-17 23:14:28,029 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-17 23:14:28,030 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-17 23:14:28,030 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-17 23:14:28,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-17 23:14:28,033 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-17 23:14:28,038 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-17 23:14:28,038 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-17 23:14:28,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.01 11:14:28 BasicIcfg [2022-01-17 23:14:28,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-17 23:14:28,172 INFO L158 Benchmark]: Toolchain (without parser) took 12370.63ms. Allocated memory was 356.5MB in the beginning and 3.7GB in the end (delta: 3.3GB). Free memory was 300.2MB in the beginning and 2.6GB in the end (delta: -2.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2022-01-17 23:14:28,173 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 356.5MB. Free memory is still 318.1MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-17 23:14:28,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.86ms. Allocated memory was 356.5MB in the beginning and 524.3MB in the end (delta: 167.8MB). Free memory was 300.1MB in the beginning and 482.4MB in the end (delta: -182.3MB). Peak memory consumption was 7.5MB. Max. memory is 16.0GB. [2022-01-17 23:14:28,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.20ms. Allocated memory is still 524.3MB. Free memory was 482.4MB in the beginning and 479.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-17 23:14:28,174 INFO L158 Benchmark]: Boogie Preprocessor took 59.82ms. Allocated memory is still 524.3MB. Free memory was 479.7MB in the beginning and 477.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-17 23:14:28,174 INFO L158 Benchmark]: RCFGBuilder took 962.17ms. Allocated memory is still 524.3MB. Free memory was 477.6MB in the beginning and 399.5MB in the end (delta: 78.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.0GB. [2022-01-17 23:14:28,175 INFO L158 Benchmark]: TraceAbstraction took 10762.51ms. Allocated memory was 524.3MB in the beginning and 3.7GB in the end (delta: 3.2GB). Free memory was 398.7MB in the beginning and 2.6GB in the end (delta: -2.2GB). Peak memory consumption was 971.7MB. Max. memory is 16.0GB. [2022-01-17 23:14:28,176 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 356.5MB. Free memory is still 318.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 511.86ms. Allocated memory was 356.5MB in the beginning and 524.3MB in the end (delta: 167.8MB). Free memory was 300.1MB in the beginning and 482.4MB in the end (delta: -182.3MB). Peak memory consumption was 7.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.20ms. Allocated memory is still 524.3MB. Free memory was 482.4MB in the beginning and 479.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 59.82ms. Allocated memory is still 524.3MB. Free memory was 479.7MB in the beginning and 477.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 962.17ms. Allocated memory is still 524.3MB. Free memory was 477.6MB in the beginning and 399.5MB in the end (delta: 78.1MB). Peak memory consumption was 77.6MB. Max. memory is 16.0GB. * TraceAbstraction took 10762.51ms. Allocated memory was 524.3MB in the beginning and 3.7GB in the end (delta: 3.2GB). Free memory was 398.7MB in the beginning and 2.6GB in the end (delta: -2.2GB). Peak memory consumption was 971.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1876; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-2, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1877; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=-1, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 pthread_t t1878; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: 819]: 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: 823]: 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: 821]: 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, 141 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2374 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2374 mSDsluCounter, 7218 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6208 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1454 IncrementalHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 1618 mSDtfsCounter, 1454 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14042occurred in iteration=0, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2813 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1106 NumberOfCodeBlocks, 1106 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1005 ConstructedInterpolants, 0 QuantifiedInterpolants, 4666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:14:28,223 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...