/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-08 23:58:03,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-08 23:58:03,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-08 23:58:03,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-08 23:58:03,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-08 23:58:03,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-08 23:58:03,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-08 23:58:03,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-08 23:58:03,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-08 23:58:03,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-08 23:58:03,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-08 23:58:03,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-08 23:58:03,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-08 23:58:03,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-08 23:58:03,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-08 23:58:03,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-08 23:58:03,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-08 23:58:03,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-08 23:58:03,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-08 23:58:03,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-08 23:58:03,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-08 23:58:03,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-08 23:58:03,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-08 23:58:03,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-08 23:58:03,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-08 23:58:03,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-08 23:58:03,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-08 23:58:03,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-08 23:58:03,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-08 23:58:03,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-08 23:58:03,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-08 23:58:03,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-08 23:58:03,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-08 23:58:03,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-08 23:58:03,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-08 23:58:03,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-08 23:58:03,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-08 23:58:03,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-08 23:58:03,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-08 23:58:03,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-08 23:58:03,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-08 23:58:03,857 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-02-08 23:58:03,882 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-08 23:58:03,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-08 23:58:03,882 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-08 23:58:03,882 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-08 23:58:03,883 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-08 23:58:03,883 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-08 23:58:03,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-08 23:58:03,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-08 23:58:03,884 INFO L138 SettingsManager]: * Use SBE=true [2022-02-08 23:58:03,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-08 23:58:03,884 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-08 23:58:03,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-08 23:58:03,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-08 23:58:03,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-08 23:58:03,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-08 23:58:03,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-08 23:58:03,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-08 23:58:03,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-08 23:58:03,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-08 23:58:03,885 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-08 23:58:03,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-08 23:58:03,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-08 23:58:03,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-08 23:58:03,885 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-08 23:58:03,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-08 23:58:03,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-08 23:58:03,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-08 23:58:03,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-08 23:58:03,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-08 23:58:03,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-08 23:58:03,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-08 23:58:03,886 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-08 23:58:03,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-08 23:58:03,886 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-02-08 23:58:04,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-08 23:58:04,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-08 23:58:04,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-08 23:58:04,080 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-08 23:58:04,080 INFO L275 PluginConnector]: CDTParser initialized [2022-02-08 23:58:04,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-02-08 23:58:04,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1280c95e/b028ce80c3274b8ba7deabae478f8027/FLAG3e4c84bbe [2022-02-08 23:58:04,569 INFO L306 CDTParser]: Found 1 translation units. [2022-02-08 23:58:04,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-02-08 23:58:04,602 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1280c95e/b028ce80c3274b8ba7deabae478f8027/FLAG3e4c84bbe [2022-02-08 23:58:05,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1280c95e/b028ce80c3274b8ba7deabae478f8027 [2022-02-08 23:58:05,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-08 23:58:05,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-08 23:58:05,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-08 23:58:05,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-08 23:58:05,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-08 23:58:05,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cecdb9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05, skipping insertion in model container [2022-02-08 23:58:05,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-08 23:58:05,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-08 23:58:05,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-02-08 23:58:05,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-08 23:58:05,669 INFO L203 MainTranslator]: Completed pre-run [2022-02-08 23:58:05,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-02-08 23:58:05,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-08 23:58:05,821 INFO L208 MainTranslator]: Completed translation [2022-02-08 23:58:05,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05 WrapperNode [2022-02-08 23:58:05,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-08 23:58:05,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-08 23:58:05,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-08 23:58:05,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-08 23:58:05,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,891 INFO L137 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-02-08 23:58:05,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-08 23:58:05,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-08 23:58:05,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-08 23:58:05,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-08 23:58:05,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-08 23:58:05,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-08 23:58:05,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-08 23:58:05,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-08 23:58:05,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (1/1) ... [2022-02-08 23:58:05,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-08 23:58:05,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-08 23:58:05,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-08 23:58:05,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-08 23:58:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-08 23:58:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-08 23:58:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-08 23:58:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-08 23:58:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-08 23:58:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-08 23:58:06,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-08 23:58:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-08 23:58:06,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-08 23:58:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-02-08 23:58:06,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-02-08 23:58:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-08 23:58:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-08 23:58:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-08 23:58:06,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-08 23:58:06,007 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-08 23:58:06,155 INFO L234 CfgBuilder]: Building ICFG [2022-02-08 23:58:06,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-08 23:58:06,581 INFO L275 CfgBuilder]: Performing block encoding [2022-02-08 23:58:06,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-08 23:58:06,825 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-08 23:58:06,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.02 11:58:06 BoogieIcfgContainer [2022-02-08 23:58:06,827 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-08 23:58:06,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-08 23:58:06,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-08 23:58:06,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-08 23:58:06,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 11:58:05" (1/3) ... [2022-02-08 23:58:06,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec79f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:58:06, skipping insertion in model container [2022-02-08 23:58:06,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 11:58:05" (2/3) ... [2022-02-08 23:58:06,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec79f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 11:58:06, skipping insertion in model container [2022-02-08 23:58:06,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.02 11:58:06" (3/3) ... [2022-02-08 23:58:06,832 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-02-08 23:58:06,835 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-08 23:58:06,835 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-08 23:58:06,835 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-08 23:58:06,835 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-08 23:58:06,863 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,863 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,863 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,863 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,863 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,864 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,864 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,864 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,864 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,864 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,864 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,865 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,865 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,865 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,865 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,865 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,865 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,866 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,866 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,866 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,866 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,866 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,866 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,866 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,867 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,867 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,867 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,867 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,867 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,867 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,868 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,868 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,868 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,868 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,868 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,869 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,869 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,869 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,869 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,869 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,870 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,871 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,872 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,872 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,872 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,872 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,872 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,872 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,872 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,872 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,872 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,873 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,874 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,875 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,877 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,877 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,877 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,877 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,877 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,878 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,878 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,878 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,878 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,878 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,878 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,879 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,880 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,880 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,880 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,881 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-08 23:58:06,881 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-08 23:58:06,906 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-08 23:58:06,910 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, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-08 23:58:06,911 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-08 23:58:06,917 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 120 places, 112 transitions, 239 flow [2022-02-08 23:58:07,327 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12305 states, 12302 states have (on average 3.5471468053974964) internal successors, (43637), 12304 states have internal predecessors, (43637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 12305 states, 12302 states have (on average 3.5471468053974964) internal successors, (43637), 12304 states have internal predecessors, (43637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-08 23:58:07,364 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:07,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:58:07,365 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1234575711, now seen corresponding path program 1 times [2022-02-08 23:58:07,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:07,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99360587] [2022-02-08 23:58:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:07,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:07,601 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:07,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99360587] [2022-02-08 23:58:07,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99360587] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:07,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:07,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-08 23:58:07,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571486637] [2022-02-08 23:58:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:07,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-08 23:58:07,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:07,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-08 23:58:07,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-08 23:58:07,657 INFO L87 Difference]: Start difference. First operand has 12305 states, 12302 states have (on average 3.5471468053974964) internal successors, (43637), 12304 states have internal predecessors, (43637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:07,850 INFO L93 Difference]: Finished difference Result 10345 states and 35817 transitions. [2022-02-08 23:58:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-08 23:58:07,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-08 23:58:07,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:07,989 INFO L225 Difference]: With dead ends: 10345 [2022-02-08 23:58:07,989 INFO L226 Difference]: Without dead ends: 8553 [2022-02-08 23:58:07,991 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-02-08 23:58:07,995 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 53 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:07,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 166 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:08,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8553 states. [2022-02-08 23:58:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8553 to 8553. [2022-02-08 23:58:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8553 states, 8552 states have (on average 3.4912301216089805) internal successors, (29857), 8552 states have internal predecessors, (29857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8553 states to 8553 states and 29857 transitions. [2022-02-08 23:58:08,403 INFO L78 Accepts]: Start accepts. Automaton has 8553 states and 29857 transitions. Word has length 43 [2022-02-08 23:58:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:08,404 INFO L470 AbstractCegarLoop]: Abstraction has 8553 states and 29857 transitions. [2022-02-08 23:58:08,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 8553 states and 29857 transitions. [2022-02-08 23:58:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-08 23:58:08,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:08,419 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:58:08,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-08 23:58:08,420 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:08,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1218056957, now seen corresponding path program 1 times [2022-02-08 23:58:08,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:08,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928576378] [2022-02-08 23:58:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:08,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:08,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:08,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928576378] [2022-02-08 23:58:08,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928576378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:08,707 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:08,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:58:08,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827929243] [2022-02-08 23:58:08,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:08,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:58:08,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:08,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:58:08,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:58:08,710 INFO L87 Difference]: Start difference. First operand 8553 states and 29857 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:09,142 INFO L93 Difference]: Finished difference Result 10457 states and 36235 transitions. [2022-02-08 23:58:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:58:09,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-02-08 23:58:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:09,195 INFO L225 Difference]: With dead ends: 10457 [2022-02-08 23:58:09,195 INFO L226 Difference]: Without dead ends: 8217 [2022-02-08 23:58:09,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:58:09,197 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 119 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:09,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 501 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2022-02-08 23:58:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 8217. [2022-02-08 23:58:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8217 states, 8216 states have (on average 3.4755355404089583) internal successors, (28555), 8216 states have internal predecessors, (28555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8217 states to 8217 states and 28555 transitions. [2022-02-08 23:58:09,515 INFO L78 Accepts]: Start accepts. Automaton has 8217 states and 28555 transitions. Word has length 72 [2022-02-08 23:58:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:09,516 INFO L470 AbstractCegarLoop]: Abstraction has 8217 states and 28555 transitions. [2022-02-08 23:58:09,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 8217 states and 28555 transitions. [2022-02-08 23:58:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-08 23:58:09,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:09,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:58:09,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-08 23:58:09,534 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:09,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash 246641794, now seen corresponding path program 1 times [2022-02-08 23:58:09,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:09,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873964782] [2022-02-08 23:58:09,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:09,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:09,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:09,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873964782] [2022-02-08 23:58:09,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873964782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:09,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:09,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:58:09,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774732373] [2022-02-08 23:58:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:09,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:58:09,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:58:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:58:09,650 INFO L87 Difference]: Start difference. First operand 8217 states and 28555 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:09,963 INFO L93 Difference]: Finished difference Result 9517 states and 32815 transitions. [2022-02-08 23:58:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:58:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-02-08 23:58:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:10,011 INFO L225 Difference]: With dead ends: 9517 [2022-02-08 23:58:10,012 INFO L226 Difference]: Without dead ends: 7517 [2022-02-08 23:58:10,012 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-02-08 23:58:10,013 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 124 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:10,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 500 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:58:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7517 states. [2022-02-08 23:58:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7517 to 7517. [2022-02-08 23:58:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7517 states, 7516 states have (on average 3.454630122405535) internal successors, (25965), 7516 states have internal predecessors, (25965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7517 states to 7517 states and 25965 transitions. [2022-02-08 23:58:10,343 INFO L78 Accepts]: Start accepts. Automaton has 7517 states and 25965 transitions. Word has length 74 [2022-02-08 23:58:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:10,344 INFO L470 AbstractCegarLoop]: Abstraction has 7517 states and 25965 transitions. [2022-02-08 23:58:10,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 7517 states and 25965 transitions. [2022-02-08 23:58:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-08 23:58:10,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:10,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:58:10,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-08 23:58:10,358 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash -723901759, now seen corresponding path program 1 times [2022-02-08 23:58:10,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:10,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684238881] [2022-02-08 23:58:10,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:10,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:10,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:10,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684238881] [2022-02-08 23:58:10,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684238881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:10,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:10,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-08 23:58:10,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685878465] [2022-02-08 23:58:10,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:10,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-08 23:58:10,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:10,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-08 23:58:10,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-08 23:58:10,460 INFO L87 Difference]: Start difference. First operand 7517 states and 25965 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:10,655 INFO L93 Difference]: Finished difference Result 12317 states and 42625 transitions. [2022-02-08 23:58:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-08 23:58:10,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-08 23:58:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:10,685 INFO L225 Difference]: With dead ends: 12317 [2022-02-08 23:58:10,685 INFO L226 Difference]: Without dead ends: 7121 [2022-02-08 23:58:10,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:58:10,686 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 166 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:10,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 526 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7121 states. [2022-02-08 23:58:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7121 to 7121. [2022-02-08 23:58:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7121 states, 7120 states have (on average 3.4293539325842697) internal successors, (24417), 7120 states have internal predecessors, (24417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7121 states to 7121 states and 24417 transitions. [2022-02-08 23:58:10,961 INFO L78 Accepts]: Start accepts. Automaton has 7121 states and 24417 transitions. Word has length 76 [2022-02-08 23:58:10,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:10,962 INFO L470 AbstractCegarLoop]: Abstraction has 7121 states and 24417 transitions. [2022-02-08 23:58:10,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:10,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7121 states and 24417 transitions. [2022-02-08 23:58:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-08 23:58:10,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:10,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:58:10,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-08 23:58:10,975 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:10,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2041735983, now seen corresponding path program 2 times [2022-02-08 23:58:10,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:10,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713918523] [2022-02-08 23:58:10,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:10,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:11,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-02-08 23:58:11,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:11,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713918523] [2022-02-08 23:58:11,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713918523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:11,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:11,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-08 23:58:11,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318365964] [2022-02-08 23:58:11,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:11,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-08 23:58:11,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-08 23:58:11,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-08 23:58:11,176 INFO L87 Difference]: Start difference. First operand 7121 states and 24417 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:11,441 INFO L93 Difference]: Finished difference Result 8323 states and 28383 transitions. [2022-02-08 23:58:11,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-08 23:58:11,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-08 23:58:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:11,469 INFO L225 Difference]: With dead ends: 8323 [2022-02-08 23:58:11,469 INFO L226 Difference]: Without dead ends: 7123 [2022-02-08 23:58:11,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-02-08 23:58:11,470 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 236 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:11,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 608 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:11,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7123 states. [2022-02-08 23:58:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7123 to 7107. [2022-02-08 23:58:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7107 states, 7106 states have (on average 3.4282296650717705) internal successors, (24361), 7106 states have internal predecessors, (24361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7107 states to 7107 states and 24361 transitions. [2022-02-08 23:58:11,641 INFO L78 Accepts]: Start accepts. Automaton has 7107 states and 24361 transitions. Word has length 76 [2022-02-08 23:58:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:11,641 INFO L470 AbstractCegarLoop]: Abstraction has 7107 states and 24361 transitions. [2022-02-08 23:58:11,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 7107 states and 24361 transitions. [2022-02-08 23:58:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-08 23:58:11,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:11,713 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-02-08 23:58:11,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-08 23:58:11,714 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:11,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash -553585628, now seen corresponding path program 1 times [2022-02-08 23:58:11,714 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:11,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989795656] [2022-02-08 23:58:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:11,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:11,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:11,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989795656] [2022-02-08 23:58:11,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989795656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:11,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:11,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:58:11,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166326912] [2022-02-08 23:58:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:11,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:58:11,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:58:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:58:11,794 INFO L87 Difference]: Start difference. First operand 7107 states and 24361 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:12,017 INFO L93 Difference]: Finished difference Result 11912 states and 40280 transitions. [2022-02-08 23:58:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:58:12,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-08 23:58:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:12,045 INFO L225 Difference]: With dead ends: 11912 [2022-02-08 23:58:12,046 INFO L226 Difference]: Without dead ends: 7737 [2022-02-08 23:58:12,046 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-02-08 23:58:12,047 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 106 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:12,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 658 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2022-02-08 23:58:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 6687. [2022-02-08 23:58:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6687 states, 6686 states have (on average 3.34430152557583) internal successors, (22360), 6686 states have internal predecessors, (22360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 22360 transitions. [2022-02-08 23:58:12,281 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 22360 transitions. Word has length 77 [2022-02-08 23:58:12,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:12,282 INFO L470 AbstractCegarLoop]: Abstraction has 6687 states and 22360 transitions. [2022-02-08 23:58:12,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 22360 transitions. [2022-02-08 23:58:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-08 23:58:12,296 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:12,296 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-02-08 23:58:12,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-08 23:58:12,296 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:12,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2125676128, now seen corresponding path program 1 times [2022-02-08 23:58:12,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:12,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519580870] [2022-02-08 23:58:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:12,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:12,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:12,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519580870] [2022-02-08 23:58:12,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519580870] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:12,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:12,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-08 23:58:12,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032531002] [2022-02-08 23:58:12,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:12,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-08 23:58:12,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:12,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-08 23:58:12,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-08 23:58:12,600 INFO L87 Difference]: Start difference. First operand 6687 states and 22360 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:12,994 INFO L93 Difference]: Finished difference Result 8412 states and 27860 transitions. [2022-02-08 23:58:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-08 23:58:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-08 23:58:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:13,015 INFO L225 Difference]: With dead ends: 8412 [2022-02-08 23:58:13,015 INFO L226 Difference]: Without dead ends: 6644 [2022-02-08 23:58:13,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2022-02-08 23:58:13,016 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 264 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:13,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 770 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:58:13,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6644 states. [2022-02-08 23:58:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6644 to 6364. [2022-02-08 23:58:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6364 states, 6363 states have (on average 3.2915291529152917) internal successors, (20944), 6363 states have internal predecessors, (20944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 20944 transitions. [2022-02-08 23:58:13,167 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 20944 transitions. Word has length 77 [2022-02-08 23:58:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:13,167 INFO L470 AbstractCegarLoop]: Abstraction has 6364 states and 20944 transitions. [2022-02-08 23:58:13,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 20944 transitions. [2022-02-08 23:58:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-08 23:58:13,177 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:13,177 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-02-08 23:58:13,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-08 23:58:13,177 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:13,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash -788070540, now seen corresponding path program 1 times [2022-02-08 23:58:13,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:13,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880624958] [2022-02-08 23:58:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:13,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:13,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:13,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880624958] [2022-02-08 23:58:13,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880624958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:13,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:13,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-08 23:58:13,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792128960] [2022-02-08 23:58:13,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:13,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-08 23:58:13,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:13,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-08 23:58:13,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-08 23:58:13,302 INFO L87 Difference]: Start difference. First operand 6364 states and 20944 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:13,543 INFO L93 Difference]: Finished difference Result 7164 states and 23365 transitions. [2022-02-08 23:58:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-08 23:58:13,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-08 23:58:13,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:13,590 INFO L225 Difference]: With dead ends: 7164 [2022-02-08 23:58:13,590 INFO L226 Difference]: Without dead ends: 6204 [2022-02-08 23:58:13,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-02-08 23:58:13,592 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 207 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:13,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 703 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6204 states. [2022-02-08 23:58:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6204 to 6028. [2022-02-08 23:58:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6028 states, 6027 states have (on average 3.2818981251037) internal successors, (19780), 6027 states have internal predecessors, (19780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6028 states to 6028 states and 19780 transitions. [2022-02-08 23:58:13,747 INFO L78 Accepts]: Start accepts. Automaton has 6028 states and 19780 transitions. Word has length 77 [2022-02-08 23:58:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:13,747 INFO L470 AbstractCegarLoop]: Abstraction has 6028 states and 19780 transitions. [2022-02-08 23:58:13,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6028 states and 19780 transitions. [2022-02-08 23:58:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-08 23:58:13,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:13,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:58:13,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-08 23:58:13,759 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash 229835473, now seen corresponding path program 1 times [2022-02-08 23:58:13,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:13,759 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292906440] [2022-02-08 23:58:13,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:13,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:13,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:13,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292906440] [2022-02-08 23:58:13,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292906440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:13,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:13,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-08 23:58:13,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108469097] [2022-02-08 23:58:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:13,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-08 23:58:13,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-08 23:58:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-08 23:58:13,917 INFO L87 Difference]: Start difference. First operand 6028 states and 19780 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:14,206 INFO L93 Difference]: Finished difference Result 7114 states and 23212 transitions. [2022-02-08 23:58:14,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-08 23:58:14,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-02-08 23:58:14,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:14,222 INFO L225 Difference]: With dead ends: 7114 [2022-02-08 23:58:14,223 INFO L226 Difference]: Without dead ends: 6174 [2022-02-08 23:58:14,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-02-08 23:58:14,223 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 263 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:14,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 801 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:58:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6174 states. [2022-02-08 23:58:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6174 to 6174. [2022-02-08 23:58:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6174 states, 6173 states have (on average 3.260003239915762) internal successors, (20124), 6173 states have internal predecessors, (20124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 20124 transitions. [2022-02-08 23:58:14,343 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 20124 transitions. Word has length 78 [2022-02-08 23:58:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:14,344 INFO L470 AbstractCegarLoop]: Abstraction has 6174 states and 20124 transitions. [2022-02-08 23:58:14,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 20124 transitions. [2022-02-08 23:58:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-08 23:58:14,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:14,354 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-02-08 23:58:14,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-08 23:58:14,354 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1791335166, now seen corresponding path program 1 times [2022-02-08 23:58:14,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:14,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391565091] [2022-02-08 23:58:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:14,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:14,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:14,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391565091] [2022-02-08 23:58:14,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391565091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:14,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:14,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-08 23:58:14,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123903992] [2022-02-08 23:58:14,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:14,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-08 23:58:14,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:14,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-08 23:58:14,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-08 23:58:14,486 INFO L87 Difference]: Start difference. First operand 6174 states and 20124 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:14,808 INFO L93 Difference]: Finished difference Result 7774 states and 25391 transitions. [2022-02-08 23:58:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-08 23:58:14,809 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-02-08 23:58:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:14,845 INFO L225 Difference]: With dead ends: 7774 [2022-02-08 23:58:14,845 INFO L226 Difference]: Without dead ends: 6884 [2022-02-08 23:58:14,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-02-08 23:58:14,846 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 181 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:14,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 599 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:58:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6884 states. [2022-02-08 23:58:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6884 to 6501. [2022-02-08 23:58:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6501 states, 6500 states have (on average 3.273846153846154) internal successors, (21280), 6500 states have internal predecessors, (21280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 21280 transitions. [2022-02-08 23:58:15,206 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 21280 transitions. Word has length 79 [2022-02-08 23:58:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:15,206 INFO L470 AbstractCegarLoop]: Abstraction has 6501 states and 21280 transitions. [2022-02-08 23:58:15,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 21280 transitions. [2022-02-08 23:58:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-08 23:58:15,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:15,219 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-02-08 23:58:15,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-08 23:58:15,219 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1122411502, now seen corresponding path program 1 times [2022-02-08 23:58:15,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:15,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793743081] [2022-02-08 23:58:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:15,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:15,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:15,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793743081] [2022-02-08 23:58:15,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793743081] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:15,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:15,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-08 23:58:15,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422080533] [2022-02-08 23:58:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:15,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-08 23:58:15,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:15,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-08 23:58:15,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-08 23:58:15,553 INFO L87 Difference]: Start difference. First operand 6501 states and 21280 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:15,838 INFO L93 Difference]: Finished difference Result 7165 states and 23394 transitions. [2022-02-08 23:58:15,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-08 23:58:15,839 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2022-02-08 23:58:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:15,860 INFO L225 Difference]: With dead ends: 7165 [2022-02-08 23:58:15,860 INFO L226 Difference]: Without dead ends: 6445 [2022-02-08 23:58:15,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-08 23:58:15,861 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 339 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:15,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 841 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2022-02-08 23:58:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 6285. [2022-02-08 23:58:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6285 states, 6284 states have (on average 3.289306174411203) internal successors, (20670), 6284 states have internal predecessors, (20670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 20670 transitions. [2022-02-08 23:58:16,033 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 20670 transitions. Word has length 79 [2022-02-08 23:58:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:16,033 INFO L470 AbstractCegarLoop]: Abstraction has 6285 states and 20670 transitions. [2022-02-08 23:58:16,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 20670 transitions. [2022-02-08 23:58:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-08 23:58:16,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:16,047 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-02-08 23:58:16,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-08 23:58:16,047 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:16,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash 696457764, now seen corresponding path program 1 times [2022-02-08 23:58:16,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:16,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797782287] [2022-02-08 23:58:16,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:16,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:16,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:16,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797782287] [2022-02-08 23:58:16,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797782287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:16,142 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:16,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-08 23:58:16,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777050836] [2022-02-08 23:58:16,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:16,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-08 23:58:16,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:16,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-08 23:58:16,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-08 23:58:16,143 INFO L87 Difference]: Start difference. First operand 6285 states and 20670 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:16,371 INFO L93 Difference]: Finished difference Result 9759 states and 32289 transitions. [2022-02-08 23:58:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-08 23:58:16,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-02-08 23:58:16,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:16,388 INFO L225 Difference]: With dead ends: 9759 [2022-02-08 23:58:16,388 INFO L226 Difference]: Without dead ends: 6377 [2022-02-08 23:58:16,388 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-02-08 23:58:16,389 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 105 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:16,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 835 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6377 states. [2022-02-08 23:58:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6377 to 5537. [2022-02-08 23:58:16,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5537 states, 5536 states have (on average 3.2333815028901736) internal successors, (17900), 5536 states have internal predecessors, (17900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5537 states to 5537 states and 17900 transitions. [2022-02-08 23:58:16,523 INFO L78 Accepts]: Start accepts. Automaton has 5537 states and 17900 transitions. Word has length 80 [2022-02-08 23:58:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:16,524 INFO L470 AbstractCegarLoop]: Abstraction has 5537 states and 17900 transitions. [2022-02-08 23:58:16,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5537 states and 17900 transitions. [2022-02-08 23:58:16,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-08 23:58:16,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:16,534 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-02-08 23:58:16,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-08 23:58:16,534 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash -832871790, now seen corresponding path program 2 times [2022-02-08 23:58:16,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:16,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082271877] [2022-02-08 23:58:16,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:16,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:16,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:16,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082271877] [2022-02-08 23:58:16,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082271877] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:16,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:16,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-08 23:58:16,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509925315] [2022-02-08 23:58:16,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:16,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-08 23:58:16,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:16,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-08 23:58:16,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-08 23:58:16,641 INFO L87 Difference]: Start difference. First operand 5537 states and 17900 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:16,838 INFO L93 Difference]: Finished difference Result 6629 states and 21077 transitions. [2022-02-08 23:58:16,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-08 23:58:16,839 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-02-08 23:58:16,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:16,853 INFO L225 Difference]: With dead ends: 6629 [2022-02-08 23:58:16,853 INFO L226 Difference]: Without dead ends: 4869 [2022-02-08 23:58:16,854 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-02-08 23:58:16,855 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 164 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:16,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 374 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2022-02-08 23:58:16,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4869. [2022-02-08 23:58:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 3.170912078882498) internal successors, (15436), 4868 states have internal predecessors, (15436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 15436 transitions. [2022-02-08 23:58:16,965 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 15436 transitions. Word has length 80 [2022-02-08 23:58:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:16,966 INFO L470 AbstractCegarLoop]: Abstraction has 4869 states and 15436 transitions. [2022-02-08 23:58:16,966 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-02-08 23:58:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 15436 transitions. [2022-02-08 23:58:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-08 23:58:16,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:16,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:58:16,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-08 23:58:16,978 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:16,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2104059982, now seen corresponding path program 1 times [2022-02-08 23:58:16,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:16,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822640154] [2022-02-08 23:58:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:16,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:17,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:17,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822640154] [2022-02-08 23:58:17,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822640154] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:17,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:17,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-08 23:58:17,071 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719989255] [2022-02-08 23:58:17,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:17,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-08 23:58:17,071 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:17,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-08 23:58:17,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-08 23:58:17,072 INFO L87 Difference]: Start difference. First operand 4869 states and 15436 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:17,267 INFO L93 Difference]: Finished difference Result 4641 states and 14309 transitions. [2022-02-08 23:58:17,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-08 23:58:17,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-02-08 23:58:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:17,276 INFO L225 Difference]: With dead ends: 4641 [2022-02-08 23:58:17,276 INFO L226 Difference]: Without dead ends: 3246 [2022-02-08 23:58:17,276 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-02-08 23:58:17,277 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 258 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:17,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 422 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:17,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-02-08 23:58:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3198. [2022-02-08 23:58:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3198 states, 3197 states have (on average 3.035658429777917) internal successors, (9705), 3197 states have internal predecessors, (9705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 9705 transitions. [2022-02-08 23:58:17,442 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 9705 transitions. Word has length 81 [2022-02-08 23:58:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:17,442 INFO L470 AbstractCegarLoop]: Abstraction has 3198 states and 9705 transitions. [2022-02-08 23:58:17,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 9705 transitions. [2022-02-08 23:58:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-08 23:58:17,447 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:17,447 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-02-08 23:58:17,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-08 23:58:17,448 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash 726712963, now seen corresponding path program 1 times [2022-02-08 23:58:17,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:17,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372061694] [2022-02-08 23:58:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:17,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:17,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:17,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372061694] [2022-02-08 23:58:17,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372061694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:17,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:17,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-08 23:58:17,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079871177] [2022-02-08 23:58:17,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:17,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-08 23:58:17,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:17,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-08 23:58:17,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-08 23:58:17,560 INFO L87 Difference]: Start difference. First operand 3198 states and 9705 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:17,720 INFO L93 Difference]: Finished difference Result 2532 states and 7440 transitions. [2022-02-08 23:58:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-08 23:58:17,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-02-08 23:58:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:17,724 INFO L225 Difference]: With dead ends: 2532 [2022-02-08 23:58:17,724 INFO L226 Difference]: Without dead ends: 1533 [2022-02-08 23:58:17,725 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-02-08 23:58:17,726 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 280 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:17,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 400 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-08 23:58:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2022-02-08 23:58:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1485. [2022-02-08 23:58:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1484 states have (on average 2.881401617250674) internal successors, (4276), 1484 states have internal predecessors, (4276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 4276 transitions. [2022-02-08 23:58:17,748 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 4276 transitions. Word has length 83 [2022-02-08 23:58:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:17,749 INFO L470 AbstractCegarLoop]: Abstraction has 1485 states and 4276 transitions. [2022-02-08 23:58:17,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 4276 transitions. [2022-02-08 23:58:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-08 23:58:17,751 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:17,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:58:17,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-08 23:58:17,751 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:17,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:17,752 INFO L85 PathProgramCache]: Analyzing trace with hash 175298075, now seen corresponding path program 1 times [2022-02-08 23:58:17,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:17,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453879227] [2022-02-08 23:58:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:17,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-08 23:58:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-08 23:58:18,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-08 23:58:18,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453879227] [2022-02-08 23:58:18,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453879227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-08 23:58:18,111 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-08 23:58:18,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-08 23:58:18,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967392566] [2022-02-08 23:58:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-08 23:58:18,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-08 23:58:18,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-08 23:58:18,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-08 23:58:18,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-08 23:58:18,113 INFO L87 Difference]: Start difference. First operand 1485 states and 4276 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-08 23:58:18,377 INFO L93 Difference]: Finished difference Result 2136 states and 6234 transitions. [2022-02-08 23:58:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-08 23:58:18,378 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-02-08 23:58:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-08 23:58:18,380 INFO L225 Difference]: With dead ends: 2136 [2022-02-08 23:58:18,380 INFO L226 Difference]: Without dead ends: 1033 [2022-02-08 23:58:18,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-02-08 23:58:18,380 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 186 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-08 23:58:18,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 1514 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-08 23:58:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-02-08 23:58:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1033. [2022-02-08 23:58:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 2.794573643410853) internal successors, (2884), 1032 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 2884 transitions. [2022-02-08 23:58:18,393 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 2884 transitions. Word has length 86 [2022-02-08 23:58:18,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-08 23:58:18,393 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 2884 transitions. [2022-02-08 23:58:18,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-08 23:58:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 2884 transitions. [2022-02-08 23:58:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-08 23:58:18,395 INFO L506 BasicCegarLoop]: Found error trace [2022-02-08 23:58:18,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:58:18,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-08 23:58:18,395 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-08 23:58:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-08 23:58:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash 778281435, now seen corresponding path program 2 times [2022-02-08 23:58:18,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-08 23:58:18,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630243378] [2022-02-08 23:58:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-08 23:58:18,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-08 23:58:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-08 23:58:18,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-08 23:58:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-08 23:58:18,495 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-08 23:58:18,496 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-08 23:58:18,496 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-08 23:58:18,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-08 23:58:18,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-02-08 23:58:18,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-02-08 23:58:18,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-02-08 23:58:18,498 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-08 23:58:18,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-08 23:58:18,500 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-08 23:58:18,503 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-08 23:58:18,503 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-08 23:58:18,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 11:58:18 BasicIcfg [2022-02-08 23:58:18,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-08 23:58:18,605 INFO L158 Benchmark]: Toolchain (without parser) took 13488.54ms. Allocated memory was 191.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 168.9MB in the beginning and 1.0GB in the end (delta: -845.4MB). Peak memory consumption was 566.8MB. Max. memory is 8.0GB. [2022-02-08 23:58:18,606 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 157.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-08 23:58:18,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.85ms. Allocated memory is still 191.9MB. Free memory was 168.9MB in the beginning and 154.0MB in the end (delta: 14.9MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2022-02-08 23:58:18,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.14ms. Allocated memory is still 191.9MB. Free memory was 154.0MB in the beginning and 151.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-08 23:58:18,606 INFO L158 Benchmark]: Boogie Preprocessor took 48.11ms. Allocated memory is still 191.9MB. Free memory was 151.0MB in the beginning and 148.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-08 23:58:18,606 INFO L158 Benchmark]: RCFGBuilder took 885.92ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 148.9MB in the beginning and 174.6MB in the end (delta: -25.6MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2022-02-08 23:58:18,606 INFO L158 Benchmark]: TraceAbstraction took 11777.17ms. Allocated memory was 230.7MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 174.0MB in the beginning and 1.0GB in the end (delta: -840.3MB). Peak memory consumption was 532.8MB. Max. memory is 8.0GB. [2022-02-08 23:58:18,612 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.12ms. Allocated memory is still 191.9MB. Free memory is still 157.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 703.85ms. Allocated memory is still 191.9MB. Free memory was 168.9MB in the beginning and 154.0MB in the end (delta: 14.9MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.14ms. Allocated memory is still 191.9MB. Free memory was 154.0MB in the beginning and 151.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.11ms. Allocated memory is still 191.9MB. Free memory was 151.0MB in the beginning and 148.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 885.92ms. Allocated memory was 191.9MB in the beginning and 230.7MB in the end (delta: 38.8MB). Free memory was 148.9MB in the beginning and 174.6MB in the end (delta: -25.6MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. * TraceAbstraction took 11777.17ms. Allocated memory was 230.7MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 174.0MB in the beginning and 1.0GB in the end (delta: -840.3MB). Peak memory consumption was 532.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-2, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=-1, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3051 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3051 mSDsluCounter, 10218 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8873 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2019 IncrementalHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 2041 mSDtfsCounter, 2019 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12305occurred in iteration=0, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 3001 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1304 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1202 ConstructedInterpolants, 0 QuantifiedInterpolants, 6941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-08 23:58:18,672 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...