/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/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 13:48:37,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 13:48:37,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 13:48:37,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 13:48:37,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 13:48:37,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 13:48:37,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 13:48:37,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 13:48:37,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 13:48:37,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 13:48:37,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 13:48:37,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 13:48:37,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 13:48:37,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 13:48:37,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 13:48:37,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 13:48:37,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 13:48:37,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 13:48:37,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 13:48:37,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 13:48:37,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 13:48:37,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 13:48:37,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 13:48:37,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 13:48:37,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 13:48:37,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 13:48:37,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 13:48:37,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 13:48:37,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 13:48:37,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 13:48:37,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 13:48:37,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 13:48:37,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 13:48:37,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 13:48:37,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 13:48:37,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 13:48:37,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 13:48:37,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 13:48:37,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 13:48:37,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 13:48:37,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 13:48:37,511 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 [2021-08-06 13:48:37,537 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 13:48:37,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 13:48:37,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-06 13:48:37,538 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-06 13:48:37,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 13:48:37,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 13:48:37,539 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 13:48:37,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 13:48:37,539 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 13:48:37,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 13:48:37,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 13:48:37,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 13:48:37,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 13:48:37,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 13:48:37,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 13:48:37,540 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 13:48:37,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 13:48:37,540 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 13:48:37,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 13:48:37,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 13:48:37,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 13:48:37,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 13:48:37,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 13:48:37,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:48:37,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 13:48:37,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 13:48:37,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 13:48:37,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 13:48:37,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 13:48:37,541 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 13:48:37,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 13:48:37,541 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 [2021-08-06 13:48:37,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 13:48:37,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 13:48:37,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 13:48:37,840 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 13:48:37,840 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 13:48:37,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2021-08-06 13:48:37,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22174f7db/e4bbb9b478e14773a240e9db61744d51/FLAGcb529b5ec [2021-08-06 13:48:38,332 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 13:48:38,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2021-08-06 13:48:38,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22174f7db/e4bbb9b478e14773a240e9db61744d51/FLAGcb529b5ec [2021-08-06 13:48:38,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22174f7db/e4bbb9b478e14773a240e9db61744d51 [2021-08-06 13:48:38,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 13:48:38,365 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 13:48:38,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 13:48:38,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 13:48:38,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 13:48:38,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4888bbc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38, skipping insertion in model container [2021-08-06 13:48:38,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 13:48:38,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 13:48:38,568 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i[952,965] [2021-08-06 13:48:38,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:48:38,751 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 13:48:38,764 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i[952,965] [2021-08-06 13:48:38,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:48:38,836 INFO L208 MainTranslator]: Completed translation [2021-08-06 13:48:38,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38 WrapperNode [2021-08-06 13:48:38,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 13:48:38,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 13:48:38,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 13:48:38,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 13:48:38,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 13:48:38,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 13:48:38,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 13:48:38,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 13:48:38,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 13:48:38,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 13:48:38,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 13:48:38,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 13:48:38,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (1/1) ... [2021-08-06 13:48:38,907 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:48:38,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 13:48:38,941 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) [2021-08-06 13:48:38,943 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 [2021-08-06 13:48:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 13:48:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-06 13:48:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 13:48:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 13:48:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-06 13:48:38,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-06 13:48:38,969 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-06 13:48:38,969 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-06 13:48:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-06 13:48:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-06 13:48:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 13:48:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-06 13:48:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 13:48:38,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 13:48:38,971 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-06 13:48:40,166 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 13:48:40,167 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-06 13:48:40,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:48:40 BoogieIcfgContainer [2021-08-06 13:48:40,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 13:48:40,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 13:48:40,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 13:48:40,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 13:48:40,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 01:48:38" (1/3) ... [2021-08-06 13:48:40,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@933ddbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:48:40, skipping insertion in model container [2021-08-06 13:48:40,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:48:38" (2/3) ... [2021-08-06 13:48:40,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@933ddbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:48:40, skipping insertion in model container [2021-08-06 13:48:40,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:48:40" (3/3) ... [2021-08-06 13:48:40,173 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2021-08-06 13:48:40,176 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 13:48:40,177 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 13:48:40,177 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-06 13:48:40,177 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 13:48:40,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,202 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,204 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,204 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,207 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,207 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,207 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,212 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,212 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,213 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,216 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,216 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:48:40,217 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-06 13:48:40,244 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 13:48:40,248 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, mConcurrency=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 [2021-08-06 13:48:40,248 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-06 13:48:40,255 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-08-06 13:48:40,600 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9822 states, 9820 states have (on average 3.5730142566191447) internal successors, (35087), 9821 states have internal predecessors, (35087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 9822 states, 9820 states have (on average 3.5730142566191447) internal successors, (35087), 9821 states have internal predecessors, (35087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-06 13:48:40,703 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:40,704 INFO L512 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] [2021-08-06 13:48:40,705 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:40,708 INFO L82 PathProgramCache]: Analyzing trace with hash 136358668, now seen corresponding path program 1 times [2021-08-06 13:48:40,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:40,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353752562] [2021-08-06 13:48:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:40,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:41,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:41,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353752562] [2021-08-06 13:48:41,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353752562] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:41,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:41,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:48:41,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604432269] [2021-08-06 13:48:41,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:48:41,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:48:41,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:48:41,351 INFO L87 Difference]: Start difference. First operand has 9822 states, 9820 states have (on average 3.5730142566191447) internal successors, (35087), 9821 states have internal predecessors, (35087), 0 states have call successors, (0), 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 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:41,605 INFO L93 Difference]: Finished difference Result 11262 states and 39211 transitions. [2021-08-06 13:48:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:48:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-08-06 13:48:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:41,669 INFO L225 Difference]: With dead ends: 11262 [2021-08-06 13:48:41,669 INFO L226 Difference]: Without dead ends: 8382 [2021-08-06 13:48:41,670 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:48:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8382 states. [2021-08-06 13:48:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8382 to 8382. [2021-08-06 13:48:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8382 states, 8380 states have (on average 3.480071599045346) internal successors, (29163), 8381 states have internal predecessors, (29163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8382 states to 8382 states and 29163 transitions. [2021-08-06 13:48:42,095 INFO L78 Accepts]: Start accepts. Automaton has 8382 states and 29163 transitions. Word has length 67 [2021-08-06 13:48:42,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:42,097 INFO L470 AbstractCegarLoop]: Abstraction has 8382 states and 29163 transitions. [2021-08-06 13:48:42,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8382 states and 29163 transitions. [2021-08-06 13:48:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-06 13:48:42,112 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:42,112 INFO L512 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] [2021-08-06 13:48:42,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 13:48:42,112 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash 801415437, now seen corresponding path program 1 times [2021-08-06 13:48:42,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:42,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114443601] [2021-08-06 13:48:42,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:42,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:42,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:42,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114443601] [2021-08-06 13:48:42,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114443601] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:42,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:42,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:48:42,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507296198] [2021-08-06 13:48:42,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:48:42,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:42,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:48:42,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:48:42,303 INFO L87 Difference]: Start difference. First operand 8382 states and 29163 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:42,523 INFO L93 Difference]: Finished difference Result 9822 states and 33891 transitions. [2021-08-06 13:48:42,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:48:42,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-08-06 13:48:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:42,575 INFO L225 Difference]: With dead ends: 9822 [2021-08-06 13:48:42,575 INFO L226 Difference]: Without dead ends: 8094 [2021-08-06 13:48:42,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 74.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:48:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8094 states. [2021-08-06 13:48:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8094 to 8094. [2021-08-06 13:48:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8094 states, 8092 states have (on average 3.467498764211567) internal successors, (28059), 8093 states have internal predecessors, (28059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8094 states to 8094 states and 28059 transitions. [2021-08-06 13:48:42,859 INFO L78 Accepts]: Start accepts. Automaton has 8094 states and 28059 transitions. Word has length 69 [2021-08-06 13:48:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:42,861 INFO L470 AbstractCegarLoop]: Abstraction has 8094 states and 28059 transitions. [2021-08-06 13:48:42,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 8094 states and 28059 transitions. [2021-08-06 13:48:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-06 13:48:42,874 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:42,874 INFO L512 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] [2021-08-06 13:48:42,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 13:48:42,874 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:42,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1637918156, now seen corresponding path program 1 times [2021-08-06 13:48:42,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:42,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784108597] [2021-08-06 13:48:42,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:42,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:43,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:43,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784108597] [2021-08-06 13:48:43,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784108597] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:43,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:43,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:48:43,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132598106] [2021-08-06 13:48:43,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:48:43,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:43,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:48:43,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:48:43,051 INFO L87 Difference]: Start difference. First operand 8094 states and 28059 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:43,328 INFO L93 Difference]: Finished difference Result 11376 states and 39314 transitions. [2021-08-06 13:48:43,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:48:43,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-08-06 13:48:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:43,349 INFO L225 Difference]: With dead ends: 11376 [2021-08-06 13:48:43,349 INFO L226 Difference]: Without dead ends: 5952 [2021-08-06 13:48:43,350 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 100.4ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:48:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2021-08-06 13:48:43,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 5952. [2021-08-06 13:48:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5952 states, 5950 states have (on average 3.367563025210084) internal successors, (20037), 5951 states have internal predecessors, (20037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5952 states to 5952 states and 20037 transitions. [2021-08-06 13:48:43,553 INFO L78 Accepts]: Start accepts. Automaton has 5952 states and 20037 transitions. Word has length 71 [2021-08-06 13:48:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:43,553 INFO L470 AbstractCegarLoop]: Abstraction has 5952 states and 20037 transitions. [2021-08-06 13:48:43,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 5952 states and 20037 transitions. [2021-08-06 13:48:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-06 13:48:43,562 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:43,563 INFO L512 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] [2021-08-06 13:48:43,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 13:48:43,563 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:43,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash -218189217, now seen corresponding path program 1 times [2021-08-06 13:48:43,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:43,564 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86471611] [2021-08-06 13:48:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:43,564 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:43,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:43,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86471611] [2021-08-06 13:48:43,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86471611] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:43,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:43,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 13:48:43,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114746166] [2021-08-06 13:48:43,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 13:48:43,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 13:48:43,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:48:43,823 INFO L87 Difference]: Start difference. First operand 5952 states and 20037 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 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) [2021-08-06 13:48:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:44,231 INFO L93 Difference]: Finished difference Result 7410 states and 24698 transitions. [2021-08-06 13:48:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-06 13:48:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 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 [2021-08-06 13:48:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:44,252 INFO L225 Difference]: With dead ends: 7410 [2021-08-06 13:48:44,252 INFO L226 Difference]: Without dead ends: 6282 [2021-08-06 13:48:44,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 188.9ms TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2021-08-06 13:48:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2021-08-06 13:48:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 6282. [2021-08-06 13:48:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6282 states, 6280 states have (on average 3.3418789808917198) internal successors, (20987), 6281 states have internal predecessors, (20987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6282 states to 6282 states and 20987 transitions. [2021-08-06 13:48:44,412 INFO L78 Accepts]: Start accepts. Automaton has 6282 states and 20987 transitions. Word has length 72 [2021-08-06 13:48:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:44,413 INFO L470 AbstractCegarLoop]: Abstraction has 6282 states and 20987 transitions. [2021-08-06 13:48:44,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 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) [2021-08-06 13:48:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 6282 states and 20987 transitions. [2021-08-06 13:48:44,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-06 13:48:44,423 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:44,423 INFO L512 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] [2021-08-06 13:48:44,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 13:48:44,424 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:44,424 INFO L82 PathProgramCache]: Analyzing trace with hash 724084473, now seen corresponding path program 1 times [2021-08-06 13:48:44,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:44,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693387996] [2021-08-06 13:48:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:44,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:44,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:44,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693387996] [2021-08-06 13:48:44,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693387996] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:44,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:44,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:48:44,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846855016] [2021-08-06 13:48:44,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:48:44,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:44,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:48:44,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:48:44,676 INFO L87 Difference]: Start difference. First operand 6282 states and 20987 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:44,994 INFO L93 Difference]: Finished difference Result 6387 states and 21322 transitions. [2021-08-06 13:48:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 13:48:44,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-06 13:48:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:45,014 INFO L225 Difference]: With dead ends: 6387 [2021-08-06 13:48:45,015 INFO L226 Difference]: Without dead ends: 5555 [2021-08-06 13:48:45,015 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 153.1ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-08-06 13:48:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2021-08-06 13:48:45,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 5555. [2021-08-06 13:48:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5555 states, 5554 states have (on average 3.3525387108390348) internal successors, (18620), 5554 states have internal predecessors, (18620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5555 states to 5555 states and 18620 transitions. [2021-08-06 13:48:45,142 INFO L78 Accepts]: Start accepts. Automaton has 5555 states and 18620 transitions. Word has length 73 [2021-08-06 13:48:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:45,143 INFO L470 AbstractCegarLoop]: Abstraction has 5555 states and 18620 transitions. [2021-08-06 13:48:45,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 5555 states and 18620 transitions. [2021-08-06 13:48:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-06 13:48:45,152 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:45,152 INFO L512 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] [2021-08-06 13:48:45,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 13:48:45,152 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:45,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:45,153 INFO L82 PathProgramCache]: Analyzing trace with hash -585578471, now seen corresponding path program 1 times [2021-08-06 13:48:45,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:45,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245016080] [2021-08-06 13:48:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:45,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:45,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:45,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245016080] [2021-08-06 13:48:45,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245016080] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:45,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:45,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-06 13:48:45,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255063649] [2021-08-06 13:48:45,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-06 13:48:45,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:45,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-06 13:48:45,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:48:45,709 INFO L87 Difference]: Start difference. First operand 5555 states and 18620 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 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) [2021-08-06 13:48:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:46,133 INFO L93 Difference]: Finished difference Result 6701 states and 22446 transitions. [2021-08-06 13:48:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-06 13:48:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 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 [2021-08-06 13:48:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:46,166 INFO L225 Difference]: With dead ends: 6701 [2021-08-06 13:48:46,166 INFO L226 Difference]: Without dead ends: 5717 [2021-08-06 13:48:46,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 293.1ms TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2021-08-06 13:48:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5717 states. [2021-08-06 13:48:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5717 to 5645. [2021-08-06 13:48:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5645 states, 5644 states have (on average 3.3479801559177886) internal successors, (18896), 5644 states have internal predecessors, (18896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5645 states to 5645 states and 18896 transitions. [2021-08-06 13:48:46,329 INFO L78 Accepts]: Start accepts. Automaton has 5645 states and 18896 transitions. Word has length 74 [2021-08-06 13:48:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:46,330 INFO L470 AbstractCegarLoop]: Abstraction has 5645 states and 18896 transitions. [2021-08-06 13:48:46,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 14 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) [2021-08-06 13:48:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5645 states and 18896 transitions. [2021-08-06 13:48:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 13:48:46,343 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:46,343 INFO L512 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] [2021-08-06 13:48:46,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 13:48:46,344 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash 404272429, now seen corresponding path program 1 times [2021-08-06 13:48:46,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:46,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342034174] [2021-08-06 13:48:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:46,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:46,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:46,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342034174] [2021-08-06 13:48:46,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342034174] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:46,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:46,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:48:46,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955969306] [2021-08-06 13:48:46,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:48:46,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:46,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:48:46,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:48:46,542 INFO L87 Difference]: Start difference. First operand 5645 states and 18896 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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) [2021-08-06 13:48:46,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:46,741 INFO L93 Difference]: Finished difference Result 6173 states and 20548 transitions. [2021-08-06 13:48:46,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 13:48:46,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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 [2021-08-06 13:48:46,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:46,759 INFO L225 Difference]: With dead ends: 6173 [2021-08-06 13:48:46,759 INFO L226 Difference]: Without dead ends: 5597 [2021-08-06 13:48:46,760 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 125.8ms TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-08-06 13:48:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2021-08-06 13:48:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5325. [2021-08-06 13:48:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5325 states, 5324 states have (on average 3.3388429752066116) internal successors, (17776), 5324 states have internal predecessors, (17776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 17776 transitions. [2021-08-06 13:48:46,893 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 17776 transitions. Word has length 75 [2021-08-06 13:48:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:46,894 INFO L470 AbstractCegarLoop]: Abstraction has 5325 states and 17776 transitions. [2021-08-06 13:48:46,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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) [2021-08-06 13:48:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 17776 transitions. [2021-08-06 13:48:46,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 13:48:46,907 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:46,907 INFO L512 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] [2021-08-06 13:48:46,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 13:48:46,907 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:46,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash -834843237, now seen corresponding path program 1 times [2021-08-06 13:48:46,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:46,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043551876] [2021-08-06 13:48:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:46,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:47,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:47,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043551876] [2021-08-06 13:48:47,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043551876] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:47,099 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:47,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:48:47,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838192810] [2021-08-06 13:48:47,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:48:47,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:47,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:48:47,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:48:47,100 INFO L87 Difference]: Start difference. First operand 5325 states and 17776 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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) [2021-08-06 13:48:47,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:47,433 INFO L93 Difference]: Finished difference Result 6397 states and 21331 transitions. [2021-08-06 13:48:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-06 13:48:47,445 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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 [2021-08-06 13:48:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:47,468 INFO L225 Difference]: With dead ends: 6397 [2021-08-06 13:48:47,468 INFO L226 Difference]: Without dead ends: 5685 [2021-08-06 13:48:47,468 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 155.3ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-08-06 13:48:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5685 states. [2021-08-06 13:48:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5685 to 5475. [2021-08-06 13:48:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5475 states, 5474 states have (on average 3.338874680306905) internal successors, (18277), 5474 states have internal predecessors, (18277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5475 states to 5475 states and 18277 transitions. [2021-08-06 13:48:47,606 INFO L78 Accepts]: Start accepts. Automaton has 5475 states and 18277 transitions. Word has length 75 [2021-08-06 13:48:47,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:47,606 INFO L470 AbstractCegarLoop]: Abstraction has 5475 states and 18277 transitions. [2021-08-06 13:48:47,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 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) [2021-08-06 13:48:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 5475 states and 18277 transitions. [2021-08-06 13:48:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-06 13:48:47,616 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:47,616 INFO L512 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] [2021-08-06 13:48:47,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 13:48:47,617 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2020367204, now seen corresponding path program 1 times [2021-08-06 13:48:47,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:47,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429616530] [2021-08-06 13:48:47,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:47,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:47,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:47,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429616530] [2021-08-06 13:48:47,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429616530] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:47,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:47,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:48:47,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359920053] [2021-08-06 13:48:47,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:48:47,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:47,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:48:47,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:48:47,727 INFO L87 Difference]: Start difference. First operand 5475 states and 18277 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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) [2021-08-06 13:48:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:47,825 INFO L93 Difference]: Finished difference Result 6619 states and 21783 transitions. [2021-08-06 13:48:47,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:48:47,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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 [2021-08-06 13:48:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:47,841 INFO L225 Difference]: With dead ends: 6619 [2021-08-06 13:48:47,841 INFO L226 Difference]: Without dead ends: 4875 [2021-08-06 13:48:47,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 57.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:48:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2021-08-06 13:48:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 4875. [2021-08-06 13:48:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 3.2759540418547393) internal successors, (15967), 4874 states have internal predecessors, (15967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 15967 transitions. [2021-08-06 13:48:47,960 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 15967 transitions. Word has length 76 [2021-08-06 13:48:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:47,961 INFO L470 AbstractCegarLoop]: Abstraction has 4875 states and 15967 transitions. [2021-08-06 13:48:47,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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) [2021-08-06 13:48:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 15967 transitions. [2021-08-06 13:48:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 13:48:47,970 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:47,970 INFO L512 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] [2021-08-06 13:48:47,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 13:48:47,971 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:47,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:47,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1342650372, now seen corresponding path program 1 times [2021-08-06 13:48:47,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:47,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209719586] [2021-08-06 13:48:47,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:47,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:48,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:48,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209719586] [2021-08-06 13:48:48,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209719586] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:48,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:48,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:48:48,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499707156] [2021-08-06 13:48:48,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:48:48,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:48,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:48:48,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:48:48,060 INFO L87 Difference]: Start difference. First operand 4875 states and 15967 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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) [2021-08-06 13:48:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:48,164 INFO L93 Difference]: Finished difference Result 4809 states and 15329 transitions. [2021-08-06 13:48:48,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:48:48,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 [2021-08-06 13:48:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:48,173 INFO L225 Difference]: With dead ends: 4809 [2021-08-06 13:48:48,174 INFO L226 Difference]: Without dead ends: 3417 [2021-08-06 13:48:48,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 67.8ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-06 13:48:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2021-08-06 13:48:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 3357. [2021-08-06 13:48:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3356 states have (on average 3.1197854588796186) internal successors, (10470), 3356 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:48,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 10470 transitions. [2021-08-06 13:48:48,247 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 10470 transitions. Word has length 77 [2021-08-06 13:48:48,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:48,248 INFO L470 AbstractCegarLoop]: Abstraction has 3357 states and 10470 transitions. [2021-08-06 13:48:48,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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) [2021-08-06 13:48:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 10470 transitions. [2021-08-06 13:48:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-06 13:48:48,254 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:48,254 INFO L512 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] [2021-08-06 13:48:48,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-06 13:48:48,254 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:48,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:48,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1481227939, now seen corresponding path program 1 times [2021-08-06 13:48:48,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:48,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374742910] [2021-08-06 13:48:48,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:48,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:48,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:48,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374742910] [2021-08-06 13:48:48,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374742910] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:48,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:48,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 13:48:48,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035979412] [2021-08-06 13:48:48,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 13:48:48,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:48,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 13:48:48,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 13:48:48,382 INFO L87 Difference]: Start difference. First operand 3357 states and 10470 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:48,491 INFO L93 Difference]: Finished difference Result 2763 states and 8427 transitions. [2021-08-06 13:48:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 13:48:48,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-08-06 13:48:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:48,496 INFO L225 Difference]: With dead ends: 2763 [2021-08-06 13:48:48,497 INFO L226 Difference]: Without dead ends: 2115 [2021-08-06 13:48:48,497 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-06 13:48:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2021-08-06 13:48:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1971. [2021-08-06 13:48:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1970 states have (on average 2.981725888324873) internal successors, (5874), 1970 states have internal predecessors, (5874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 5874 transitions. [2021-08-06 13:48:48,527 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 5874 transitions. Word has length 79 [2021-08-06 13:48:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:48,527 INFO L470 AbstractCegarLoop]: Abstraction has 1971 states and 5874 transitions. [2021-08-06 13:48:48,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 5874 transitions. [2021-08-06 13:48:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 13:48:48,531 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:48,531 INFO L512 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] [2021-08-06 13:48:48,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-06 13:48:48,531 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:48,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:48,531 INFO L82 PathProgramCache]: Analyzing trace with hash -76706986, now seen corresponding path program 1 times [2021-08-06 13:48:48,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:48,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075036227] [2021-08-06 13:48:48,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:48,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:48,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:48,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075036227] [2021-08-06 13:48:48,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075036227] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:48,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:48,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-06 13:48:48,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064255008] [2021-08-06 13:48:48,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-06 13:48:48,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:48,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-06 13:48:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:48:48,952 INFO L87 Difference]: Start difference. First operand 1971 states and 5874 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:49,324 INFO L93 Difference]: Finished difference Result 2691 states and 8079 transitions. [2021-08-06 13:48:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-06 13:48:49,325 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-08-06 13:48:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:49,329 INFO L225 Difference]: With dead ends: 2691 [2021-08-06 13:48:49,330 INFO L226 Difference]: Without dead ends: 1925 [2021-08-06 13:48:49,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 372.7ms TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-08-06 13:48:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2021-08-06 13:48:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1715. [2021-08-06 13:48:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 2.922987164527421) internal successors, (5010), 1714 states have internal predecessors, (5010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 5010 transitions. [2021-08-06 13:48:49,351 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 5010 transitions. Word has length 82 [2021-08-06 13:48:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:49,352 INFO L470 AbstractCegarLoop]: Abstraction has 1715 states and 5010 transitions. [2021-08-06 13:48:49,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 5010 transitions. [2021-08-06 13:48:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 13:48:49,355 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:49,355 INFO L512 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] [2021-08-06 13:48:49,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-06 13:48:49,355 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:49,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:49,355 INFO L82 PathProgramCache]: Analyzing trace with hash 390883734, now seen corresponding path program 2 times [2021-08-06 13:48:49,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:49,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304812548] [2021-08-06 13:48:49,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:49,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:48:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:48:49,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:48:49,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304812548] [2021-08-06 13:48:49,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304812548] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:48:49,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:48:49,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-06 13:48:49,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393481991] [2021-08-06 13:48:49,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-06 13:48:49,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:48:49,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-06 13:48:49,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:48:49,675 INFO L87 Difference]: Start difference. First operand 1715 states and 5010 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:48:49,940 INFO L93 Difference]: Finished difference Result 3247 states and 9621 transitions. [2021-08-06 13:48:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-06 13:48:49,940 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-08-06 13:48:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:48:49,946 INFO L225 Difference]: With dead ends: 3247 [2021-08-06 13:48:49,947 INFO L226 Difference]: Without dead ends: 2429 [2021-08-06 13:48:49,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 187.6ms TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-08-06 13:48:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2021-08-06 13:48:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 1467. [2021-08-06 13:48:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1466 states have (on average 2.9481582537517053) internal successors, (4322), 1466 states have internal predecessors, (4322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 4322 transitions. [2021-08-06 13:48:49,968 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 4322 transitions. Word has length 82 [2021-08-06 13:48:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:48:49,968 INFO L470 AbstractCegarLoop]: Abstraction has 1467 states and 4322 transitions. [2021-08-06 13:48:49,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:48:49,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 4322 transitions. [2021-08-06 13:48:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 13:48:49,971 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:48:49,971 INFO L512 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] [2021-08-06 13:48:49,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-06 13:48:49,971 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:48:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:48:49,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1419362646, now seen corresponding path program 3 times [2021-08-06 13:48:49,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:48:49,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682896551] [2021-08-06 13:48:49,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:48:49,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:48:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 13:48:49,995 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-06 13:48:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 13:48:50,068 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-06 13:48:50,068 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-06 13:48:50,069 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 13:48:50,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 13:48:50,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-06 13:48:50,070 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-06 13:48:50,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-06 13:48:50,072 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2021-08-06 13:48:50,075 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 13:48:50,075 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 13:48:50,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 01:48:50 BasicIcfg [2021-08-06 13:48:50,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 13:48:50,182 INFO L168 Benchmark]: Toolchain (without parser) took 11816.97 ms. Allocated memory was 169.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 133.8 MB in the beginning and 1.1 GB in the end (delta: -960.7 MB). Peak memory consumption was 590.0 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:50,182 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 169.9 MB. Free memory was 152.1 MB in the beginning and 151.9 MB in the end (delta: 148.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 13:48:50,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.79 ms. Allocated memory is still 169.9 MB. Free memory was 133.6 MB in the beginning and 139.4 MB in the end (delta: -5.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:50,182 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.14 ms. Allocated memory is still 169.9 MB. Free memory was 139.4 MB in the beginning and 136.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:50,182 INFO L168 Benchmark]: Boogie Preprocessor took 25.16 ms. Allocated memory is still 169.9 MB. Free memory was 136.2 MB in the beginning and 134.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:50,182 INFO L168 Benchmark]: RCFGBuilder took 1266.99 ms. Allocated memory was 169.9 MB in the beginning and 223.3 MB in the end (delta: 53.5 MB). Free memory was 134.1 MB in the beginning and 127.8 MB in the end (delta: 6.4 MB). Peak memory consumption was 80.8 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:50,182 INFO L168 Benchmark]: TraceAbstraction took 10011.88 ms. Allocated memory was 223.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 127.2 MB in the beginning and 1.1 GB in the end (delta: -967.3 MB). Peak memory consumption was 529.6 MB. Max. memory is 8.0 GB. [2021-08-06 13:48:50,183 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.13 ms. Allocated memory is still 169.9 MB. Free memory was 152.1 MB in the beginning and 151.9 MB in the end (delta: 148.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 470.79 ms. Allocated memory is still 169.9 MB. Free memory was 133.6 MB in the beginning and 139.4 MB in the end (delta: -5.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 38.14 ms. Allocated memory is still 169.9 MB. Free memory was 139.4 MB in the beginning and 136.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 25.16 ms. Allocated memory is still 169.9 MB. Free memory was 136.2 MB in the beginning and 134.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1266.99 ms. Allocated memory was 169.9 MB in the beginning and 223.3 MB in the end (delta: 53.5 MB). Free memory was 134.1 MB in the beginning and 127.8 MB in the end (delta: 6.4 MB). Peak memory consumption was 80.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10011.88 ms. Allocated memory was 223.3 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 127.2 MB in the beginning and 1.1 GB in the end (delta: -967.3 MB). Peak memory consumption was 529.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, 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] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L776] 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) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] 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) [L776] 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) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 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 [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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] [L793] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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=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] [L796] 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) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] 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) [L796] 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) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 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 [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 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 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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=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] [L756] 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) [L756] 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) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 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 [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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=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] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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] [L829] 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) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] 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) [L829] 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) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 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 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 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) [L840] 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) [L841] 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)) [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 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] 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)) [L841] 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)) [L842] 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)) [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 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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) [L843] 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)) [L843] 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)) [L844] 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)) [L844] 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) [L844] 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)) [L844] 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)) [L845] 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)) [L845] 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) [L845] 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)) [L845] 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)) [L846] 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)) [L846] 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) [L846] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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 [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9829.9ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 216.0ms, AutomataDifference: 3757.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 351.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1744 SDtfs, 3226 SDslu, 7565 SDs, 0 SdLazy, 1231 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1124.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1926.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9822occurred in iteration=0, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1884.8ms AutomataMinimizationTime, 13 MinimizatonAttempts, 1930 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.1ms SsaConstructionTime, 528.7ms SatisfiabilityAnalysisTime, 2659.4ms InterpolantComputationTime, 1054 NumberOfCodeBlocks, 1054 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 959 ConstructedInterpolants, 0 QuantifiedInterpolants, 7284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-06 13:48:50,221 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...