/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/safe030_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 21:46:57,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 21:46:57,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 21:46:57,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 21:46:57,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 21:46:57,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 21:46:57,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 21:46:57,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 21:46:57,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 21:46:57,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 21:46:57,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 21:46:57,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 21:46:57,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 21:46:57,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 21:46:57,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 21:46:57,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 21:46:57,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 21:46:57,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 21:46:57,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 21:46:57,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 21:46:57,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 21:46:57,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 21:46:57,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 21:46:57,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 21:46:57,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 21:46:57,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 21:46:57,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 21:46:57,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 21:46:57,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 21:46:57,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 21:46:57,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 21:46:57,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 21:46:57,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 21:46:57,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 21:46:57,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 21:46:57,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 21:46:57,711 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 21:46:57,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 21:46:57,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 21:46:57,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 21:46:57,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 21:46:57,713 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-10 21:46:57,725 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 21:46:57,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 21:46:57,726 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 21:46:57,726 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 21:46:57,726 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 21:46:57,726 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 21:46:57,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 21:46:57,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 21:46:57,727 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 21:46:57,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 21:46:57,727 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 21:46:57,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 21:46:57,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 21:46:57,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 21:46:57,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 21:46:57,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 21:46:57,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 21:46:57,728 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 21:46:57,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 21:46:57,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 21:46:57,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 21:46:57,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 21:46:57,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 21:46:57,728 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 21:46:57,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 21:46:57,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:46:57,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 21:46:57,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 21:46:57,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 21:46:57,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 21:46:57,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 21:46:57,729 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 21:46:57,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 21:46:57,729 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-10 21:46:57,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 21:46:57,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 21:46:57,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 21:46:57,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 21:46:57,913 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 21:46:57,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-02-10 21:46:57,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60b25ccd/c3778a50d2e24862b09eddcd93acd3c5/FLAGed0b2e3f5 [2022-02-10 21:46:58,466 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 21:46:58,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-02-10 21:46:58,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60b25ccd/c3778a50d2e24862b09eddcd93acd3c5/FLAGed0b2e3f5 [2022-02-10 21:46:58,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60b25ccd/c3778a50d2e24862b09eddcd93acd3c5 [2022-02-10 21:46:58,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 21:46:58,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 21:46:58,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 21:46:58,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 21:46:58,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 21:46:58,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:46:58" (1/1) ... [2022-02-10 21:46:58,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c734dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:58, skipping insertion in model container [2022-02-10 21:46:58,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:46:58" (1/1) ... [2022-02-10 21:46:58,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 21:46:58,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 21:46:59,117 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-02-10 21:46:59,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:46:59,278 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 21:46:59,288 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-02-10 21:46:59,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:46:59,375 INFO L208 MainTranslator]: Completed translation [2022-02-10 21:46:59,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59 WrapperNode [2022-02-10 21:46:59,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 21:46:59,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 21:46:59,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 21:46:59,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 21:46:59,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (1/1) ... [2022-02-10 21:46:59,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (1/1) ... [2022-02-10 21:46:59,425 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2022-02-10 21:46:59,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 21:46:59,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 21:46:59,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 21:46:59,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 21:46:59,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (1/1) ... [2022-02-10 21:46:59,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (1/1) ... [2022-02-10 21:46:59,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (1/1) ... [2022-02-10 21:46:59,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (1/1) ... [2022-02-10 21:46:59,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (1/1) ... [2022-02-10 21:46:59,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (1/1) ... [2022-02-10 21:46:59,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (1/1) ... [2022-02-10 21:46:59,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 21:46:59,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 21:46:59,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 21:46:59,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 21:46:59,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (1/1) ... [2022-02-10 21:46:59,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:46:59,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:46:59,537 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-10 21:46:59,585 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-10 21:46:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 21:46:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 21:46:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 21:46:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 21:46:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 21:46:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-10 21:46:59,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-10 21:46:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-10 21:46:59,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-10 21:46:59,599 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-02-10 21:46:59,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-02-10 21:46:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 21:46:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 21:46:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 21:46:59,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 21:46:59,601 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 21:46:59,682 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 21:46:59,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 21:47:00,010 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 21:47:00,262 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 21:47:00,262 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-10 21:47:00,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:47:00 BoogieIcfgContainer [2022-02-10 21:47:00,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 21:47:00,265 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 21:47:00,265 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 21:47:00,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 21:47:00,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 09:46:58" (1/3) ... [2022-02-10 21:47:00,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff77d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:47:00, skipping insertion in model container [2022-02-10 21:47:00,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:46:59" (2/3) ... [2022-02-10 21:47:00,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff77d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:47:00, skipping insertion in model container [2022-02-10 21:47:00,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:47:00" (3/3) ... [2022-02-10 21:47:00,270 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-02-10 21:47:00,276 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 21:47:00,276 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 21:47:00,276 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-10 21:47:00,276 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 21:47:00,316 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,316 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,316 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,316 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,316 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,317 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,317 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,317 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,317 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,317 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,317 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,318 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,318 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,318 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,318 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,319 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,319 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,319 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,319 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,319 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,320 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,320 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,320 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,321 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,321 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,321 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,321 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,321 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,322 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,322 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,322 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,322 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,323 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,323 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,323 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,323 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,323 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,323 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,323 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,323 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,324 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,324 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,324 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,324 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,324 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,324 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,324 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,324 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,325 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,325 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,325 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,325 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,325 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,325 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,326 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,326 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,326 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,326 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,326 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,327 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,327 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,327 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,327 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,327 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,327 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,327 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,327 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,327 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,328 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,328 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,328 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,328 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,328 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,329 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,329 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,329 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,329 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,329 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,330 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,330 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,330 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,330 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,330 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,331 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,331 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,331 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,334 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,335 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,335 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,335 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,335 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,336 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,336 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,336 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,336 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,336 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,337 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,337 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,337 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,338 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,338 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,338 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,338 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,339 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,339 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,339 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,339 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,339 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,340 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,340 WARN L322 ript$VariableManager]: TermVariable P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,340 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,340 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,340 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,340 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,340 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,341 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,341 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,341 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:00,341 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 21:47:00,385 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 21:47:00,394 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-10 21:47:00,394 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-10 21:47:00,404 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 113 transitions, 241 flow [2022-02-10 21:47:00,841 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14048 states, 14045 states have (on average 3.5668921324314704) internal successors, (50097), 14047 states have internal predecessors, (50097), 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-10 21:47:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 14048 states, 14045 states have (on average 3.5668921324314704) internal successors, (50097), 14047 states have internal predecessors, (50097), 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-10 21:47:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-10 21:47:00,917 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:00,917 INFO L515 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-10 21:47:00,918 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:00,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:00,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1982469961, now seen corresponding path program 1 times [2022-02-10 21:47:00,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:00,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733148356] [2022-02-10 21:47:00,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:00,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:01,177 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-10 21:47:01,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:01,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733148356] [2022-02-10 21:47:01,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733148356] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:01,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:01,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 21:47:01,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824045026] [2022-02-10 21:47:01,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:01,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:47:01,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:01,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:47:01,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:47:01,240 INFO L87 Difference]: Start difference. First operand has 14048 states, 14045 states have (on average 3.5668921324314704) internal successors, (50097), 14047 states have internal predecessors, (50097), 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-10 21:47:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:01,591 INFO L93 Difference]: Finished difference Result 11809 states and 41122 transitions. [2022-02-10 21:47:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:47:01,594 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-10 21:47:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:01,743 INFO L225 Difference]: With dead ends: 11809 [2022-02-10 21:47:01,767 INFO L226 Difference]: Without dead ends: 9761 [2022-02-10 21:47:01,769 INFO L933 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-10 21:47:01,773 INFO L934 BasicCegarLoop]: 97 mSDtfsCounter, 54 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 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-10 21:47:01,774 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9761 states. [2022-02-10 21:47:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9761 to 9761. [2022-02-10 21:47:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9761 states, 9760 states have (on average 3.5116803278688526) internal successors, (34274), 9760 states have internal predecessors, (34274), 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-10 21:47:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9761 states to 9761 states and 34274 transitions. [2022-02-10 21:47:02,433 INFO L78 Accepts]: Start accepts. Automaton has 9761 states and 34274 transitions. Word has length 43 [2022-02-10 21:47:02,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:02,434 INFO L470 AbstractCegarLoop]: Abstraction has 9761 states and 34274 transitions. [2022-02-10 21:47:02,434 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-10 21:47:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9761 states and 34274 transitions. [2022-02-10 21:47:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-10 21:47:02,448 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:02,448 INFO L515 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-10 21:47:02,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 21:47:02,448 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-10 21:47:02,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2004174537, now seen corresponding path program 1 times [2022-02-10 21:47:02,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:02,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782167852] [2022-02-10 21:47:02,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:02,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:02,685 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-10 21:47:02,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:02,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782167852] [2022-02-10 21:47:02,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782167852] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:02,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:02,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:47:02,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844380445] [2022-02-10 21:47:02,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:02,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:47:02,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:02,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:47:02,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:47:02,688 INFO L87 Difference]: Start difference. First operand 9761 states and 34274 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-10 21:47:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:03,009 INFO L93 Difference]: Finished difference Result 11985 states and 41788 transitions. [2022-02-10 21:47:03,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:47:03,010 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-10 21:47:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:03,051 INFO L225 Difference]: With dead ends: 11985 [2022-02-10 21:47:03,051 INFO L226 Difference]: Without dead ends: 9425 [2022-02-10 21:47:03,052 INFO L933 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-10 21:47:03,053 INFO L934 BasicCegarLoop]: 133 mSDtfsCounter, 122 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:03,053 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 524 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9425 states. [2022-02-10 21:47:03,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9425 to 9425. [2022-02-10 21:47:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9425 states, 9424 states have (on average 3.4987266553480474) internal successors, (32972), 9424 states have internal predecessors, (32972), 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-10 21:47:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9425 states to 9425 states and 32972 transitions. [2022-02-10 21:47:03,382 INFO L78 Accepts]: Start accepts. Automaton has 9425 states and 32972 transitions. Word has length 72 [2022-02-10 21:47:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:03,385 INFO L470 AbstractCegarLoop]: Abstraction has 9425 states and 32972 transitions. [2022-02-10 21:47:03,385 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-10 21:47:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 9425 states and 32972 transitions. [2022-02-10 21:47:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-10 21:47:03,402 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:03,402 INFO L515 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-10 21:47:03,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 21:47:03,403 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-10 21:47:03,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1449134072, now seen corresponding path program 1 times [2022-02-10 21:47:03,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:03,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819385443] [2022-02-10 21:47:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:03,608 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-10 21:47:03,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:03,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819385443] [2022-02-10 21:47:03,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819385443] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:03,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:03,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:47:03,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759909503] [2022-02-10 21:47:03,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:03,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:47:03,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:03,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:47:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:47:03,610 INFO L87 Difference]: Start difference. First operand 9425 states and 32972 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-10 21:47:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:03,912 INFO L93 Difference]: Finished difference Result 11493 states and 39928 transitions. [2022-02-10 21:47:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:47:03,913 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-10 21:47:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:03,946 INFO L225 Difference]: With dead ends: 11493 [2022-02-10 21:47:03,947 INFO L226 Difference]: Without dead ends: 9173 [2022-02-10 21:47:03,947 INFO L933 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-10 21:47:03,948 INFO L934 BasicCegarLoop]: 133 mSDtfsCounter, 120 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:03,948 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 523 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9173 states. [2022-02-10 21:47:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9173 to 9173. [2022-02-10 21:47:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9173 states, 9172 states have (on average 3.4895333624073266) internal successors, (32006), 9172 states have internal predecessors, (32006), 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-10 21:47:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9173 states to 9173 states and 32006 transitions. [2022-02-10 21:47:04,250 INFO L78 Accepts]: Start accepts. Automaton has 9173 states and 32006 transitions. Word has length 74 [2022-02-10 21:47:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:04,251 INFO L470 AbstractCegarLoop]: Abstraction has 9173 states and 32006 transitions. [2022-02-10 21:47:04,251 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-10 21:47:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 9173 states and 32006 transitions. [2022-02-10 21:47:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-10 21:47:04,267 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:04,267 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:04,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 21:47:04,268 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-10 21:47:04,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:04,268 INFO L85 PathProgramCache]: Analyzing trace with hash -927636661, now seen corresponding path program 1 times [2022-02-10 21:47:04,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:04,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980635411] [2022-02-10 21:47:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:04,396 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-10 21:47:04,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:04,396 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980635411] [2022-02-10 21:47:04,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980635411] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:04,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:04,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:47:04,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70189544] [2022-02-10 21:47:04,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:04,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:47:04,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:04,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:47:04,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:47:04,399 INFO L87 Difference]: Start difference. First operand 9173 states and 32006 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:04,725 INFO L93 Difference]: Finished difference Result 15733 states and 54274 transitions. [2022-02-10 21:47:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:47:04,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-02-10 21:47:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:04,764 INFO L225 Difference]: With dead ends: 15733 [2022-02-10 21:47:04,764 INFO L226 Difference]: Without dead ends: 10293 [2022-02-10 21:47:04,765 INFO L933 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-10 21:47:04,766 INFO L934 BasicCegarLoop]: 152 mSDtfsCounter, 155 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:04,766 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 644 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:47:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10293 states. [2022-02-10 21:47:04,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10293 to 8613. [2022-02-10 21:47:05,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8613 states, 8612 states have (on average 3.416163492800743) internal successors, (29420), 8612 states have internal predecessors, (29420), 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-10 21:47:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 29420 transitions. [2022-02-10 21:47:05,029 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 29420 transitions. Word has length 75 [2022-02-10 21:47:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:05,029 INFO L470 AbstractCegarLoop]: Abstraction has 8613 states and 29420 transitions. [2022-02-10 21:47:05,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 29420 transitions. [2022-02-10 21:47:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-10 21:47:05,044 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:05,044 INFO L515 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-10 21:47:05,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 21:47:05,044 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-10 21:47:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1639422857, now seen corresponding path program 1 times [2022-02-10 21:47:05,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:05,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859798046] [2022-02-10 21:47:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:05,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:05,149 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-10 21:47:05,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:05,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859798046] [2022-02-10 21:47:05,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859798046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:05,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:05,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-10 21:47:05,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304632949] [2022-02-10 21:47:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:05,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-10 21:47:05,151 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-10 21:47:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-10 21:47:05,151 INFO L87 Difference]: Start difference. First operand 8613 states and 29420 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-10 21:47:05,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:05,380 INFO L93 Difference]: Finished difference Result 10353 states and 35268 transitions. [2022-02-10 21:47:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 21:47:05,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-10 21:47:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:05,414 INFO L225 Difference]: With dead ends: 10353 [2022-02-10 21:47:05,414 INFO L226 Difference]: Without dead ends: 8873 [2022-02-10 21:47:05,415 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-02-10 21:47:05,415 INFO L934 BasicCegarLoop]: 121 mSDtfsCounter, 228 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:05,416 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 558 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2022-02-10 21:47:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 8529. [2022-02-10 21:47:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8529 states, 8528 states have (on average 3.4120544090056284) internal successors, (29098), 8528 states have internal predecessors, (29098), 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-10 21:47:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8529 states to 8529 states and 29098 transitions. [2022-02-10 21:47:05,728 INFO L78 Accepts]: Start accepts. Automaton has 8529 states and 29098 transitions. Word has length 76 [2022-02-10 21:47:05,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:05,728 INFO L470 AbstractCegarLoop]: Abstraction has 8529 states and 29098 transitions. [2022-02-10 21:47:05,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-10 21:47:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 8529 states and 29098 transitions. [2022-02-10 21:47:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-10 21:47:05,743 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:05,743 INFO L515 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-10 21:47:05,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 21:47:05,744 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-10 21:47:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1128061742, now seen corresponding path program 1 times [2022-02-10 21:47:05,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:05,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564542506] [2022-02-10 21:47:05,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:05,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:05,829 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-10 21:47:05,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:05,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564542506] [2022-02-10 21:47:05,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564542506] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:05,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:05,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:47:05,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718792501] [2022-02-10 21:47:05,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:05,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:47:05,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:05,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:47:05,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:47:05,831 INFO L87 Difference]: Start difference. First operand 8529 states and 29098 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-10 21:47:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:06,175 INFO L93 Difference]: Finished difference Result 14319 states and 48155 transitions. [2022-02-10 21:47:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:47:06,180 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-10 21:47:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:06,248 INFO L225 Difference]: With dead ends: 14319 [2022-02-10 21:47:06,248 INFO L226 Difference]: Without dead ends: 9369 [2022-02-10 21:47:06,249 INFO L933 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-10 21:47:06,250 INFO L934 BasicCegarLoop]: 168 mSDtfsCounter, 111 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:06,251 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 687 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9369 states. [2022-02-10 21:47:06,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9369 to 8109. [2022-02-10 21:47:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8109 states, 8108 states have (on average 3.330291070547607) internal successors, (27002), 8108 states have internal predecessors, (27002), 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-10 21:47:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 27002 transitions. [2022-02-10 21:47:06,543 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 27002 transitions. Word has length 77 [2022-02-10 21:47:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:06,544 INFO L470 AbstractCegarLoop]: Abstraction has 8109 states and 27002 transitions. [2022-02-10 21:47:06,544 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-10 21:47:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 27002 transitions. [2022-02-10 21:47:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-10 21:47:06,559 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:06,559 INFO L515 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-10 21:47:06,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 21:47:06,559 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-10 21:47:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1462039095, now seen corresponding path program 1 times [2022-02-10 21:47:06,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:06,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030877478] [2022-02-10 21:47:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:06,775 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-10 21:47:06,776 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:06,776 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030877478] [2022-02-10 21:47:06,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030877478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:06,776 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:06,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 21:47:06,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269288348] [2022-02-10 21:47:06,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:06,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 21:47:06,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:06,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 21:47:06,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-10 21:47:06,777 INFO L87 Difference]: Start difference. First operand 8109 states and 27002 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:07,092 INFO L93 Difference]: Finished difference Result 9409 states and 31336 transitions. [2022-02-10 21:47:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-10 21:47:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-10 21:47:07,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:07,116 INFO L225 Difference]: With dead ends: 9409 [2022-02-10 21:47:07,116 INFO L226 Difference]: Without dead ends: 8169 [2022-02-10 21:47:07,117 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2022-02-10 21:47:07,117 INFO L934 BasicCegarLoop]: 144 mSDtfsCounter, 329 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:07,117 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 719 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:47:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8169 states. [2022-02-10 21:47:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8169 to 8169. [2022-02-10 21:47:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8169 states, 8168 states have (on average 3.331537708129285) internal successors, (27212), 8168 states have internal predecessors, (27212), 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-10 21:47:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8169 states to 8169 states and 27212 transitions. [2022-02-10 21:47:07,302 INFO L78 Accepts]: Start accepts. Automaton has 8169 states and 27212 transitions. Word has length 77 [2022-02-10 21:47:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:07,302 INFO L470 AbstractCegarLoop]: Abstraction has 8169 states and 27212 transitions. [2022-02-10 21:47:07,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 8169 states and 27212 transitions. [2022-02-10 21:47:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-10 21:47:07,316 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:07,317 INFO L515 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-10 21:47:07,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 21:47:07,317 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-10 21:47:07,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:07,318 INFO L85 PathProgramCache]: Analyzing trace with hash -442879897, now seen corresponding path program 1 times [2022-02-10 21:47:07,318 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:07,318 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675126481] [2022-02-10 21:47:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:07,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:07,501 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-10 21:47:07,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:07,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675126481] [2022-02-10 21:47:07,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675126481] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:07,501 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:07,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 21:47:07,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30076670] [2022-02-10 21:47:07,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:07,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 21:47:07,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:07,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 21:47:07,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-10 21:47:07,502 INFO L87 Difference]: Start difference. First operand 8169 states and 27212 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-10 21:47:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:07,916 INFO L93 Difference]: Finished difference Result 9351 states and 31108 transitions. [2022-02-10 21:47:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-10 21:47:07,917 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-10 21:47:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:07,940 INFO L225 Difference]: With dead ends: 9351 [2022-02-10 21:47:07,940 INFO L226 Difference]: Without dead ends: 8271 [2022-02-10 21:47:07,940 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2022-02-10 21:47:07,942 INFO L934 BasicCegarLoop]: 145 mSDtfsCounter, 311 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:07,942 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 883 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8271 states. [2022-02-10 21:47:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8271 to 8271. [2022-02-10 21:47:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8271 states, 8270 states have (on average 3.3296251511487305) internal successors, (27536), 8270 states have internal predecessors, (27536), 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-10 21:47:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8271 states to 8271 states and 27536 transitions. [2022-02-10 21:47:08,102 INFO L78 Accepts]: Start accepts. Automaton has 8271 states and 27536 transitions. Word has length 78 [2022-02-10 21:47:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:08,103 INFO L470 AbstractCegarLoop]: Abstraction has 8271 states and 27536 transitions. [2022-02-10 21:47:08,103 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-10 21:47:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8271 states and 27536 transitions. [2022-02-10 21:47:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-10 21:47:08,116 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:08,116 INFO L515 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-10 21:47:08,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 21:47:08,117 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-10 21:47:08,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:08,117 INFO L85 PathProgramCache]: Analyzing trace with hash -687218293, now seen corresponding path program 2 times [2022-02-10 21:47:08,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:08,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734917790] [2022-02-10 21:47:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:08,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:08,308 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-10 21:47:08,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:08,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734917790] [2022-02-10 21:47:08,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734917790] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:08,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:08,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-10 21:47:08,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679430056] [2022-02-10 21:47:08,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:08,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 21:47:08,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:08,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 21:47:08,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:47:08,310 INFO L87 Difference]: Start difference. First operand 8271 states and 27536 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 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-10 21:47:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:08,697 INFO L93 Difference]: Finished difference Result 9523 states and 31538 transitions. [2022-02-10 21:47:08,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 21:47:08,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 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-10 21:47:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:08,735 INFO L225 Difference]: With dead ends: 9523 [2022-02-10 21:47:08,735 INFO L226 Difference]: Without dead ends: 8403 [2022-02-10 21:47:08,735 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-10 21:47:08,736 INFO L934 BasicCegarLoop]: 127 mSDtfsCounter, 315 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:08,736 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 820 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:47:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8403 states. [2022-02-10 21:47:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8403 to 8403. [2022-02-10 21:47:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8403 states, 8402 states have (on average 3.311592477981433) internal successors, (27824), 8402 states have internal predecessors, (27824), 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-10 21:47:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8403 states to 8403 states and 27824 transitions. [2022-02-10 21:47:09,031 INFO L78 Accepts]: Start accepts. Automaton has 8403 states and 27824 transitions. Word has length 78 [2022-02-10 21:47:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:09,031 INFO L470 AbstractCegarLoop]: Abstraction has 8403 states and 27824 transitions. [2022-02-10 21:47:09,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 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-10 21:47:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 8403 states and 27824 transitions. [2022-02-10 21:47:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-10 21:47:09,045 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:09,046 INFO L515 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-10 21:47:09,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 21:47:09,046 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-10 21:47:09,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:09,046 INFO L85 PathProgramCache]: Analyzing trace with hash -586362102, now seen corresponding path program 1 times [2022-02-10 21:47:09,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:09,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838033219] [2022-02-10 21:47:09,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:09,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:09,253 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-10 21:47:09,254 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:09,254 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838033219] [2022-02-10 21:47:09,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838033219] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:09,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:09,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-10 21:47:09,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33313927] [2022-02-10 21:47:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:09,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-10 21:47:09,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:09,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-10 21:47:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-10 21:47:09,255 INFO L87 Difference]: Start difference. First operand 8403 states and 27824 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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-10 21:47:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:09,677 INFO L93 Difference]: Finished difference Result 9531 states and 31514 transitions. [2022-02-10 21:47:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 21:47:09,678 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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-10 21:47:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:09,699 INFO L225 Difference]: With dead ends: 9531 [2022-02-10 21:47:09,700 INFO L226 Difference]: Without dead ends: 8411 [2022-02-10 21:47:09,700 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-02-10 21:47:09,701 INFO L934 BasicCegarLoop]: 133 mSDtfsCounter, 251 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:09,702 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 912 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:47:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8411 states. [2022-02-10 21:47:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8411 to 7923. [2022-02-10 21:47:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7923 states, 7922 states have (on average 3.2931078010603385) internal successors, (26088), 7922 states have internal predecessors, (26088), 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-10 21:47:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7923 states to 7923 states and 26088 transitions. [2022-02-10 21:47:09,888 INFO L78 Accepts]: Start accepts. Automaton has 7923 states and 26088 transitions. Word has length 78 [2022-02-10 21:47:09,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:09,889 INFO L470 AbstractCegarLoop]: Abstraction has 7923 states and 26088 transitions. [2022-02-10 21:47:09,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 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-10 21:47:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7923 states and 26088 transitions. [2022-02-10 21:47:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-10 21:47:09,903 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:09,903 INFO L515 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-10 21:47:09,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 21:47:09,904 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-10 21:47:09,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1278260705, now seen corresponding path program 1 times [2022-02-10 21:47:09,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:09,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817558056] [2022-02-10 21:47:09,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:10,064 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-10 21:47:10,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:10,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817558056] [2022-02-10 21:47:10,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817558056] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:10,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:10,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 21:47:10,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827171460] [2022-02-10 21:47:10,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:10,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 21:47:10,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:10,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 21:47:10,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-10 21:47:10,066 INFO L87 Difference]: Start difference. First operand 7923 states and 26088 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 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-10 21:47:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:10,424 INFO L93 Difference]: Finished difference Result 9010 states and 29655 transitions. [2022-02-10 21:47:10,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 21:47:10,425 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 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-10 21:47:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:10,445 INFO L225 Difference]: With dead ends: 9010 [2022-02-10 21:47:10,446 INFO L226 Difference]: Without dead ends: 8070 [2022-02-10 21:47:10,446 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-02-10 21:47:10,447 INFO L934 BasicCegarLoop]: 154 mSDtfsCounter, 199 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:10,447 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 845 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:47:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8070 states. [2022-02-10 21:47:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8070 to 7993. [2022-02-10 21:47:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7993 states, 7992 states have (on average 3.291916916916917) internal successors, (26309), 7992 states have internal predecessors, (26309), 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-10 21:47:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7993 states to 7993 states and 26309 transitions. [2022-02-10 21:47:10,621 INFO L78 Accepts]: Start accepts. Automaton has 7993 states and 26309 transitions. Word has length 79 [2022-02-10 21:47:10,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:10,622 INFO L470 AbstractCegarLoop]: Abstraction has 7993 states and 26309 transitions. [2022-02-10 21:47:10,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 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-10 21:47:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7993 states and 26309 transitions. [2022-02-10 21:47:10,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-10 21:47:10,636 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:10,636 INFO L515 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-10 21:47:10,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-10 21:47:10,636 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-10 21:47:10,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash -950403193, now seen corresponding path program 2 times [2022-02-10 21:47:10,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:10,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171825282] [2022-02-10 21:47:10,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:10,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:10,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:10,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171825282] [2022-02-10 21:47:10,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171825282] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:10,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:10,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-10 21:47:10,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492896787] [2022-02-10 21:47:10,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:10,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-10 21:47:10,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:10,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-10 21:47:10,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-10 21:47:10,776 INFO L87 Difference]: Start difference. First operand 7993 states and 26309 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 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-10 21:47:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:11,128 INFO L93 Difference]: Finished difference Result 9701 states and 32011 transitions. [2022-02-10 21:47:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 21:47:11,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 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-10 21:47:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:11,152 INFO L225 Difference]: With dead ends: 9701 [2022-02-10 21:47:11,152 INFO L226 Difference]: Without dead ends: 8761 [2022-02-10 21:47:11,152 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-02-10 21:47:11,153 INFO L934 BasicCegarLoop]: 160 mSDtfsCounter, 237 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:11,153 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 989 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:47:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8761 states. [2022-02-10 21:47:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8761 to 7985. [2022-02-10 21:47:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7985 states, 7984 states have (on average 3.2924599198396796) internal successors, (26287), 7984 states have internal predecessors, (26287), 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-10 21:47:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7985 states to 7985 states and 26287 transitions. [2022-02-10 21:47:11,345 INFO L78 Accepts]: Start accepts. Automaton has 7985 states and 26287 transitions. Word has length 79 [2022-02-10 21:47:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:11,345 INFO L470 AbstractCegarLoop]: Abstraction has 7985 states and 26287 transitions. [2022-02-10 21:47:11,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 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-10 21:47:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 7985 states and 26287 transitions. [2022-02-10 21:47:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-10 21:47:11,359 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:11,359 INFO L515 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-10 21:47:11,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-10 21:47:11,359 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-10 21:47:11,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash -487061409, now seen corresponding path program 3 times [2022-02-10 21:47:11,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:11,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635311544] [2022-02-10 21:47:11,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:11,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:11,504 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-10 21:47:11,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:11,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635311544] [2022-02-10 21:47:11,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635311544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:11,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:11,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 21:47:11,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074105094] [2022-02-10 21:47:11,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:11,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 21:47:11,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:11,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 21:47:11,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-10 21:47:11,506 INFO L87 Difference]: Start difference. First operand 7985 states and 26287 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-10 21:47:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:11,711 INFO L93 Difference]: Finished difference Result 9549 states and 31480 transitions. [2022-02-10 21:47:11,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 21:47:11,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-10 21:47:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:11,734 INFO L225 Difference]: With dead ends: 9549 [2022-02-10 21:47:11,734 INFO L226 Difference]: Without dead ends: 8649 [2022-02-10 21:47:11,734 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-02-10 21:47:11,735 INFO L934 BasicCegarLoop]: 141 mSDtfsCounter, 299 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:11,735 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 710 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8649 states. [2022-02-10 21:47:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8649 to 7961. [2022-02-10 21:47:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7961 states, 7960 states have (on average 3.2891959798994974) internal successors, (26182), 7960 states have internal predecessors, (26182), 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-10 21:47:11,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 26182 transitions. [2022-02-10 21:47:11,892 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 26182 transitions. Word has length 79 [2022-02-10 21:47:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:11,893 INFO L470 AbstractCegarLoop]: Abstraction has 7961 states and 26182 transitions. [2022-02-10 21:47:11,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-10 21:47:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 26182 transitions. [2022-02-10 21:47:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-02-10 21:47:11,906 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:11,906 INFO L515 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-10 21:47:11,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-10 21:47:11,906 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-10 21:47:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:11,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1443574458, now seen corresponding path program 1 times [2022-02-10 21:47:11,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:11,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49409740] [2022-02-10 21:47:11,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:11,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:11,965 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-10 21:47:11,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:11,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49409740] [2022-02-10 21:47:11,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49409740] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:11,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:11,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:47:11,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514615276] [2022-02-10 21:47:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:11,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:47:11,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:11,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:47:11,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:47:11,966 INFO L87 Difference]: Start difference. First operand 7961 states and 26182 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-10 21:47:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:12,124 INFO L93 Difference]: Finished difference Result 9454 states and 30478 transitions. [2022-02-10 21:47:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:47:12,125 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-10 21:47:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:12,140 INFO L225 Difference]: With dead ends: 9454 [2022-02-10 21:47:12,141 INFO L226 Difference]: Without dead ends: 6774 [2022-02-10 21:47:12,141 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:47:12,141 INFO L934 BasicCegarLoop]: 106 mSDtfsCounter, 180 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 389 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-10 21:47:12,141 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 389 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6774 states. [2022-02-10 21:47:12,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6774 to 6774. [2022-02-10 21:47:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6774 states, 6773 states have (on average 3.2058172154141444) internal successors, (21713), 6773 states have internal predecessors, (21713), 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-10 21:47:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6774 states to 6774 states and 21713 transitions. [2022-02-10 21:47:12,387 INFO L78 Accepts]: Start accepts. Automaton has 6774 states and 21713 transitions. Word has length 80 [2022-02-10 21:47:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:12,389 INFO L470 AbstractCegarLoop]: Abstraction has 6774 states and 21713 transitions. [2022-02-10 21:47:12,389 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-10 21:47:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6774 states and 21713 transitions. [2022-02-10 21:47:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-10 21:47:12,399 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:12,399 INFO L515 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-10 21:47:12,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-10 21:47:12,399 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-10 21:47:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash -485716372, now seen corresponding path program 1 times [2022-02-10 21:47:12,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:12,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665808416] [2022-02-10 21:47:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:12,535 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-10 21:47:12,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:12,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665808416] [2022-02-10 21:47:12,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665808416] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:12,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:12,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:47:12,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126767001] [2022-02-10 21:47:12,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:12,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:47:12,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:12,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:47:12,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:47:12,536 INFO L87 Difference]: Start difference. First operand 6774 states and 21713 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-10 21:47:12,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:12,740 INFO L93 Difference]: Finished difference Result 6267 states and 19491 transitions. [2022-02-10 21:47:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:47:12,740 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-10 21:47:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:12,749 INFO L225 Difference]: With dead ends: 6267 [2022-02-10 21:47:12,750 INFO L226 Difference]: Without dead ends: 4188 [2022-02-10 21:47:12,750 INFO L933 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-10 21:47:12,750 INFO L934 BasicCegarLoop]: 106 mSDtfsCounter, 291 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:12,750 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 433 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2022-02-10 21:47:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 4088. [2022-02-10 21:47:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4087 states have (on average 3.059946170785417) internal successors, (12506), 4087 states have internal predecessors, (12506), 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-10 21:47:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 12506 transitions. [2022-02-10 21:47:12,816 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 12506 transitions. Word has length 81 [2022-02-10 21:47:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:12,817 INFO L470 AbstractCegarLoop]: Abstraction has 4088 states and 12506 transitions. [2022-02-10 21:47:12,817 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-10 21:47:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 12506 transitions. [2022-02-10 21:47:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-10 21:47:12,822 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:12,822 INFO L515 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] [2022-02-10 21:47:12,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-10 21:47:12,823 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-10 21:47:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash 406881301, now seen corresponding path program 1 times [2022-02-10 21:47:12,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:12,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406170164] [2022-02-10 21:47:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:12,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:13,103 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-10 21:47:13,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:13,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406170164] [2022-02-10 21:47:13,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406170164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:13,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:13,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-10 21:47:13,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340855748] [2022-02-10 21:47:13,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:13,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-10 21:47:13,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:13,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-10 21:47:13,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-10 21:47:13,104 INFO L87 Difference]: Start difference. First operand 4088 states and 12506 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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-10 21:47:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:13,402 INFO L93 Difference]: Finished difference Result 8809 states and 27013 transitions. [2022-02-10 21:47:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:47:13,403 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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 84 [2022-02-10 21:47:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:13,421 INFO L225 Difference]: With dead ends: 8809 [2022-02-10 21:47:13,422 INFO L226 Difference]: Without dead ends: 7087 [2022-02-10 21:47:13,423 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-02-10 21:47:13,429 INFO L934 BasicCegarLoop]: 196 mSDtfsCounter, 351 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:13,431 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 1416 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:47:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7087 states. [2022-02-10 21:47:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7087 to 4524. [2022-02-10 21:47:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4523 states have (on average 3.025204510280787) internal successors, (13683), 4523 states have internal predecessors, (13683), 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-10 21:47:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 13683 transitions. [2022-02-10 21:47:13,554 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 13683 transitions. Word has length 84 [2022-02-10 21:47:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:13,555 INFO L470 AbstractCegarLoop]: Abstraction has 4524 states and 13683 transitions. [2022-02-10 21:47:13,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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-10 21:47:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 13683 transitions. [2022-02-10 21:47:13,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-10 21:47:13,564 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:13,564 INFO L515 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] [2022-02-10 21:47:13,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-10 21:47:13,564 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-10 21:47:13,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:13,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1122429394, now seen corresponding path program 1 times [2022-02-10 21:47:13,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:13,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975235696] [2022-02-10 21:47:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:13,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:13,659 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-10 21:47:13,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:13,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975235696] [2022-02-10 21:47:13,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975235696] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:13,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:13,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-10 21:47:13,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60389791] [2022-02-10 21:47:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:13,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-10 21:47:13,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:13,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-10 21:47:13,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-10 21:47:13,661 INFO L87 Difference]: Start difference. First operand 4524 states and 13683 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-10 21:47:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:13,825 INFO L93 Difference]: Finished difference Result 3597 states and 10602 transitions. [2022-02-10 21:47:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 21:47:13,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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 84 [2022-02-10 21:47:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:13,829 INFO L225 Difference]: With dead ends: 3597 [2022-02-10 21:47:13,829 INFO L226 Difference]: Without dead ends: 1302 [2022-02-10 21:47:13,829 INFO L933 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-10 21:47:13,829 INFO L934 BasicCegarLoop]: 102 mSDtfsCounter, 322 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:13,829 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 422 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2022-02-10 21:47:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1302. [2022-02-10 21:47:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1301 states have (on average 2.852421214450423) internal successors, (3711), 1301 states have internal predecessors, (3711), 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-10 21:47:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 3711 transitions. [2022-02-10 21:47:13,847 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 3711 transitions. Word has length 84 [2022-02-10 21:47:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:13,847 INFO L470 AbstractCegarLoop]: Abstraction has 1302 states and 3711 transitions. [2022-02-10 21:47:13,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-10 21:47:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 3711 transitions. [2022-02-10 21:47:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-10 21:47:13,849 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:13,849 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:13,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-10 21:47:13,850 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash -681696233, now seen corresponding path program 1 times [2022-02-10 21:47:13,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:13,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955126051] [2022-02-10 21:47:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:13,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:47:13,881 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 21:47:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:47:13,945 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 21:47:13,945 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-10 21:47:13,946 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-10 21:47:13,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-10 21:47:13,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-02-10 21:47:13,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-02-10 21:47:13,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-02-10 21:47:13,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-10 21:47:13,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-10 21:47:13,949 INFO L733 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:13,952 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 21:47:13,953 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 21:47:14,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 09:47:14 BasicIcfg [2022-02-10 21:47:14,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 21:47:14,027 INFO L158 Benchmark]: Toolchain (without parser) took 15085.58ms. Allocated memory was 215.0MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 190.1MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 837.7MB. Max. memory is 8.0GB. [2022-02-10 21:47:14,027 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 21:47:14,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.35ms. Allocated memory is still 215.0MB. Free memory was 189.8MB in the beginning and 175.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. [2022-02-10 21:47:14,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.52ms. Allocated memory is still 215.0MB. Free memory was 175.6MB in the beginning and 172.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-10 21:47:14,028 INFO L158 Benchmark]: Boogie Preprocessor took 39.37ms. Allocated memory is still 215.0MB. Free memory was 172.5MB in the beginning and 170.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 21:47:14,028 INFO L158 Benchmark]: RCFGBuilder took 798.31ms. Allocated memory was 215.0MB in the beginning and 305.1MB in the end (delta: 90.2MB). Free memory was 170.4MB in the beginning and 246.9MB in the end (delta: -76.5MB). Peak memory consumption was 55.5MB. Max. memory is 8.0GB. [2022-02-10 21:47:14,028 INFO L158 Benchmark]: TraceAbstraction took 13761.73ms. Allocated memory was 305.1MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 246.4MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 804.4MB. Max. memory is 8.0GB. [2022-02-10 21:47:14,029 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 433.35ms. Allocated memory is still 215.0MB. Free memory was 189.8MB in the beginning and 175.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.52ms. Allocated memory is still 215.0MB. Free memory was 175.6MB in the beginning and 172.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.37ms. Allocated memory is still 215.0MB. Free memory was 172.5MB in the beginning and 170.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 798.31ms. Allocated memory was 215.0MB in the beginning and 305.1MB in the end (delta: 90.2MB). Free memory was 170.4MB in the beginning and 246.9MB in the end (delta: -76.5MB). Peak memory consumption was 55.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13761.73ms. Allocated memory was 305.1MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 246.4MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 804.4MB. 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] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L717] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L718] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L719] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L720] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L721] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L722] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L723] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L724] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L725] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L726] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L727] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 pthread_t t2489; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, 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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 817]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3875 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3875 mSDsluCounter, 11642 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9951 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2321 IncrementalHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 2318 mSDtfsCounter, 2321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14048occurred in iteration=0, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 7976 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1381 NumberOfCodeBlocks, 1381 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1277 ConstructedInterpolants, 0 QuantifiedInterpolants, 7050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-10 21:47:14,054 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...