/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/safe032_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 16:51:57,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 16:51:57,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 16:51:57,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 16:51:57,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 16:51:57,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 16:51:57,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 16:51:57,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 16:51:57,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 16:51:57,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 16:51:57,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 16:51:57,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 16:51:57,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 16:51:57,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 16:51:57,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 16:51:57,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 16:51:57,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 16:51:57,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 16:51:57,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 16:51:57,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 16:51:57,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 16:51:57,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 16:51:57,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 16:51:57,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 16:51:57,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 16:51:57,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 16:51:57,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 16:51:57,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 16:51:57,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 16:51:57,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 16:51:57,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 16:51:57,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 16:51:57,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 16:51:57,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 16:51:57,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 16:51:57,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 16:51:57,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 16:51:57,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 16:51:57,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 16:51:57,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 16:51:57,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 16:51:57,377 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-07-09 16:51:57,400 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 16:51:57,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 16:51:57,400 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 16:51:57,400 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 16:51:57,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 16:51:57,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 16:51:57,402 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 16:51:57,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 16:51:57,403 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 16:51:57,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 16:51:57,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 16:51:57,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 16:51:57,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 16:51:57,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 16:51:57,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 16:51:57,404 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 16:51:57,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 16:51:57,404 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 16:51:57,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 16:51:57,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 16:51:57,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 16:51:57,405 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 16:51:57,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 16:51:57,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:51:57,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 16:51:57,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 16:51:57,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 16:51:57,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 16:51:57,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 16:51:57,406 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 16:51:57,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 16:51:57,406 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-07-09 16:51:57,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 16:51:57,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 16:51:57,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 16:51:57,711 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 16:51:57,711 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 16:51:57,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i [2021-07-09 16:51:57,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763a40dab/c0835945f4de46e99c990ace84ac9632/FLAG652fea541 [2021-07-09 16:51:58,180 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 16:51:58,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i [2021-07-09 16:51:58,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763a40dab/c0835945f4de46e99c990ace84ac9632/FLAG652fea541 [2021-07-09 16:51:58,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763a40dab/c0835945f4de46e99c990ace84ac9632 [2021-07-09 16:51:58,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 16:51:58,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 16:51:58,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 16:51:58,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 16:51:58,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 16:51:58,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bea006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58, skipping insertion in model container [2021-07-09 16:51:58,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 16:51:58,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 16:51:58,449 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/safe032_power.opt.i[994,1007] [2021-07-09 16:51:58,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:51:58,631 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 16:51:58,639 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/safe032_power.opt.i[994,1007] [2021-07-09 16:51:58,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:51:58,698 INFO L208 MainTranslator]: Completed translation [2021-07-09 16:51:58,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58 WrapperNode [2021-07-09 16:51:58,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 16:51:58,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 16:51:58,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 16:51:58,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 16:51:58,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 16:51:58,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 16:51:58,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 16:51:58,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 16:51:58,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (1/1) ... [2021-07-09 16:51:58,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 16:51:58,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 16:51:58,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 16:51:58,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 16:51:58,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:51:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 16:51:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 16:51:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 16:51:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 16:51:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 16:51:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 16:51:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 16:51:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 16:51:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-09 16:51:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-09 16:51:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 16:51:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 16:51:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 16:51:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 16:51:58,850 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 16:52:01,108 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 16:52:01,108 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 16:52:01,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:52:01 BoogieIcfgContainer [2021-07-09 16:52:01,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 16:52:01,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 16:52:01,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 16:52:01,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 16:52:01,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 04:51:58" (1/3) ... [2021-07-09 16:52:01,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c800ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:52:01, skipping insertion in model container [2021-07-09 16:52:01,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:58" (2/3) ... [2021-07-09 16:52:01,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c800ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:52:01, skipping insertion in model container [2021-07-09 16:52:01,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:52:01" (3/3) ... [2021-07-09 16:52:01,115 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.opt.i [2021-07-09 16:52:01,119 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 16:52:01,119 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 16:52:01,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 16:52:01,120 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 16:52:01,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,192 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,193 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,205 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,206 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:01,216 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 16:52:01,231 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 16:52:01,247 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:52:01,247 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:52:01,247 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:52:01,247 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:52:01,247 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:52:01,247 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:52:01,247 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:52:01,247 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork0======== [2021-07-09 16:52:01,258 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-07-09 16:52:01,388 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5632 states, 5630 states have (on average 3.3650088809946714) internal successors, (18945), 5631 states have internal predecessors, (18945), 0 states have call successors, (0), 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-07-09 16:52:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 5632 states, 5630 states have (on average 3.3650088809946714) internal successors, (18945), 5631 states have internal predecessors, (18945), 0 states have call successors, (0), 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-07-09 16:52:01,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-07-09 16:52:01,413 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:01,413 INFO L508 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] [2021-07-09 16:52:01,414 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1914108186, now seen corresponding path program 1 times [2021-07-09 16:52:01,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:01,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213312195] [2021-07-09 16:52:01,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:01,613 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:01,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213312195] [2021-07-09 16:52:01,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213312195] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:01,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:01,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-09 16:52:01,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715683500] [2021-07-09 16:52:01,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 16:52:01,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:01,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 16:52:01,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:52:01,680 INFO L87 Difference]: Start difference. First operand has 5632 states, 5630 states have (on average 3.3650088809946714) internal successors, (18945), 5631 states have internal predecessors, (18945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-07-09 16:52:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:01,777 INFO L93 Difference]: Finished difference Result 3805 states and 11849 transitions. [2021-07-09 16:52:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 16:52:01,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-07-09 16:52:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:01,785 INFO L225 Difference]: With dead ends: 3805 [2021-07-09 16:52:01,785 INFO L226 Difference]: Without dead ends: 0 [2021-07-09 16:52:01,786 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:52:01,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-09 16:52:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-09 16:52:01,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-07-09 16:52:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-09 16:52:01,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2021-07-09 16:52:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:01,801 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-09 16:52:01,801 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-07-09 16:52:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-09 16:52:01,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 16:52:01,802 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 16:52:01,802 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/2) [2021-07-09 16:52:01,804 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-09 16:52:01,805 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:52:01,805 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:52:01,805 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:52:01,805 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:52:01,805 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:52:01,805 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:52:01,805 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:52:01,805 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 16:52:01,809 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-07-09 16:52:01,959 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9601 states, 9599 states have (on average 3.5750599020731326) internal successors, (34317), 9600 states have internal predecessors, (34317), 0 states have call successors, (0), 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-07-09 16:52:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 9601 states, 9599 states have (on average 3.5750599020731326) internal successors, (34317), 9600 states have internal predecessors, (34317), 0 states have call successors, (0), 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-07-09 16:52:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-09 16:52:01,998 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:01,998 INFO L508 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-07-09 16:52:01,998 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1969788092, now seen corresponding path program 1 times [2021-07-09 16:52:02,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:02,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119681622] [2021-07-09 16:52:02,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:02,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:02,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119681622] [2021-07-09 16:52:02,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119681622] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:02,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:02,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:52:02,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587617722] [2021-07-09 16:52:02,209 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:52:02,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:52:02,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:52:02,230 INFO L87 Difference]: Start difference. First operand has 9601 states, 9599 states have (on average 3.5750599020731326) internal successors, (34317), 9600 states have internal predecessors, (34317), 0 states have call successors, (0), 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-07-09 16:52:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:02,465 INFO L93 Difference]: Finished difference Result 10357 states and 36015 transitions. [2021-07-09 16:52:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:02,465 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-07-09 16:52:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:02,519 INFO L225 Difference]: With dead ends: 10357 [2021-07-09 16:52:02,520 INFO L226 Difference]: Without dead ends: 7522 [2021-07-09 16:52:02,520 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:52:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2021-07-09 16:52:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2021-07-09 16:52:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7522 states, 7520 states have (on average 3.460771276595745) internal successors, (26025), 7521 states have internal predecessors, (26025), 0 states have call successors, (0), 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-07-09 16:52:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 26025 transitions. [2021-07-09 16:52:02,802 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 26025 transitions. Word has length 67 [2021-07-09 16:52:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:02,803 INFO L482 AbstractCegarLoop]: Abstraction has 7522 states and 26025 transitions. [2021-07-09 16:52:02,803 INFO L483 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-07-09 16:52:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 26025 transitions. [2021-07-09 16:52:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 16:52:02,818 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:02,818 INFO L508 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-07-09 16:52:02,818 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 16:52:02,818 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:02,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:02,818 INFO L82 PathProgramCache]: Analyzing trace with hash -175824292, now seen corresponding path program 1 times [2021-07-09 16:52:02,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:02,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577606628] [2021-07-09 16:52:02,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:03,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:03,066 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:03,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577606628] [2021-07-09 16:52:03,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577606628] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:03,066 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:03,066 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:52:03,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153167319] [2021-07-09 16:52:03,067 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:52:03,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:03,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:52:03,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:52:03,068 INFO L87 Difference]: Start difference. First operand 7522 states and 26025 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-07-09 16:52:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:03,219 INFO L93 Difference]: Finished difference Result 8542 states and 29306 transitions. [2021-07-09 16:52:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:03,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-07-09 16:52:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:03,272 INFO L225 Difference]: With dead ends: 8542 [2021-07-09 16:52:03,272 INFO L226 Difference]: Without dead ends: 7282 [2021-07-09 16:52:03,273 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:52:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2021-07-09 16:52:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 7282. [2021-07-09 16:52:03,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7282 states, 7280 states have (on average 3.449587912087912) internal successors, (25113), 7281 states have internal predecessors, (25113), 0 states have call successors, (0), 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-07-09 16:52:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7282 states to 7282 states and 25113 transitions. [2021-07-09 16:52:03,492 INFO L78 Accepts]: Start accepts. Automaton has 7282 states and 25113 transitions. Word has length 71 [2021-07-09 16:52:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:03,493 INFO L482 AbstractCegarLoop]: Abstraction has 7282 states and 25113 transitions. [2021-07-09 16:52:03,493 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-07-09 16:52:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 7282 states and 25113 transitions. [2021-07-09 16:52:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:52:03,506 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:03,506 INFO L508 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-07-09 16:52:03,506 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 16:52:03,506 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:03,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:03,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1596498909, now seen corresponding path program 1 times [2021-07-09 16:52:03,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:03,507 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279580897] [2021-07-09 16:52:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:03,769 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:03,770 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279580897] [2021-07-09 16:52:03,770 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279580897] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:03,770 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:03,770 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:52:03,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862965002] [2021-07-09 16:52:03,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:52:03,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:03,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:52:03,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:52:03,775 INFO L87 Difference]: Start difference. First operand 7282 states and 25113 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 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-07-09 16:52:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:04,375 INFO L93 Difference]: Finished difference Result 8569 states and 29393 transitions. [2021-07-09 16:52:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-09 16:52:04,380 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 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-07-09 16:52:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:04,406 INFO L225 Difference]: With dead ends: 8569 [2021-07-09 16:52:04,407 INFO L226 Difference]: Without dead ends: 7345 [2021-07-09 16:52:04,407 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 277.3ms TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2021-07-09 16:52:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7345 states. [2021-07-09 16:52:04,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7345 to 6895. [2021-07-09 16:52:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6895 states, 6894 states have (on average 3.432840150855817) internal successors, (23666), 6894 states have internal predecessors, (23666), 0 states have call successors, (0), 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-07-09 16:52:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6895 states to 6895 states and 23666 transitions. [2021-07-09 16:52:04,631 INFO L78 Accepts]: Start accepts. Automaton has 6895 states and 23666 transitions. Word has length 73 [2021-07-09 16:52:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:04,632 INFO L482 AbstractCegarLoop]: Abstraction has 6895 states and 23666 transitions. [2021-07-09 16:52:04,632 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 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-07-09 16:52:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 6895 states and 23666 transitions. [2021-07-09 16:52:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:52:04,646 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:04,646 INFO L508 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-07-09 16:52:04,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 16:52:04,646 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:04,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:04,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1326386689, now seen corresponding path program 1 times [2021-07-09 16:52:04,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:04,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519328857] [2021-07-09 16:52:04,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:04,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:04,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519328857] [2021-07-09 16:52:04,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519328857] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:04,776 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:04,776 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:52:04,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293998883] [2021-07-09 16:52:04,776 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:52:04,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:04,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:52:04,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:52:04,778 INFO L87 Difference]: Start difference. First operand 6895 states and 23666 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:04,898 INFO L93 Difference]: Finished difference Result 10615 states and 36012 transitions. [2021-07-09 16:52:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:04,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-09 16:52:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:04,919 INFO L225 Difference]: With dead ends: 10615 [2021-07-09 16:52:04,920 INFO L226 Difference]: Without dead ends: 6621 [2021-07-09 16:52:04,920 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 71.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:52:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6621 states. [2021-07-09 16:52:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6621 to 5871. [2021-07-09 16:52:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5871 states, 5870 states have (on average 3.3282793867120954) internal successors, (19537), 5870 states have internal predecessors, (19537), 0 states have call successors, (0), 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-07-09 16:52:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5871 states to 5871 states and 19537 transitions. [2021-07-09 16:52:05,143 INFO L78 Accepts]: Start accepts. Automaton has 5871 states and 19537 transitions. Word has length 74 [2021-07-09 16:52:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:05,145 INFO L482 AbstractCegarLoop]: Abstraction has 5871 states and 19537 transitions. [2021-07-09 16:52:05,145 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5871 states and 19537 transitions. [2021-07-09 16:52:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-09 16:52:05,156 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:05,157 INFO L508 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-07-09 16:52:05,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 16:52:05,157 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1145074345, now seen corresponding path program 1 times [2021-07-09 16:52:05,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:05,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041760679] [2021-07-09 16:52:05,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:05,467 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:05,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041760679] [2021-07-09 16:52:05,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041760679] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:05,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:05,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:52:05,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660080894] [2021-07-09 16:52:05,469 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:52:05,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:52:05,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:52:05,470 INFO L87 Difference]: Start difference. First operand 5871 states and 19537 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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-07-09 16:52:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:05,841 INFO L93 Difference]: Finished difference Result 9979 states and 32878 transitions. [2021-07-09 16:52:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:52:05,842 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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-07-09 16:52:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:05,866 INFO L225 Difference]: With dead ends: 9979 [2021-07-09 16:52:05,867 INFO L226 Difference]: Without dead ends: 8907 [2021-07-09 16:52:05,867 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 211.4ms TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2021-07-09 16:52:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8907 states. [2021-07-09 16:52:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8907 to 6279. [2021-07-09 16:52:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6279 states, 6278 states have (on average 3.307582032494425) internal successors, (20765), 6278 states have internal predecessors, (20765), 0 states have call successors, (0), 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-07-09 16:52:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6279 states to 6279 states and 20765 transitions. [2021-07-09 16:52:06,056 INFO L78 Accepts]: Start accepts. Automaton has 6279 states and 20765 transitions. Word has length 75 [2021-07-09 16:52:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:06,056 INFO L482 AbstractCegarLoop]: Abstraction has 6279 states and 20765 transitions. [2021-07-09 16:52:06,056 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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-07-09 16:52:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6279 states and 20765 transitions. [2021-07-09 16:52:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-09 16:52:06,068 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:06,068 INFO L508 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-07-09 16:52:06,069 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 16:52:06,069 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1784406377, now seen corresponding path program 2 times [2021-07-09 16:52:06,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:06,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603822573] [2021-07-09 16:52:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:06,298 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:06,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603822573] [2021-07-09 16:52:06,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603822573] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:06,299 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:06,299 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:52:06,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200478932] [2021-07-09 16:52:06,299 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:52:06,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:06,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:52:06,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:52:06,300 INFO L87 Difference]: Start difference. First operand 6279 states and 20765 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-07-09 16:52:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:06,618 INFO L93 Difference]: Finished difference Result 7263 states and 24030 transitions. [2021-07-09 16:52:06,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:06,619 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-07-09 16:52:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:06,634 INFO L225 Difference]: With dead ends: 7263 [2021-07-09 16:52:06,635 INFO L226 Difference]: Without dead ends: 6663 [2021-07-09 16:52:06,635 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 204.2ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:52:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2021-07-09 16:52:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6311. [2021-07-09 16:52:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6311 states, 6310 states have (on average 3.304120443740095) internal successors, (20849), 6310 states have internal predecessors, (20849), 0 states have call successors, (0), 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-07-09 16:52:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6311 states to 6311 states and 20849 transitions. [2021-07-09 16:52:06,768 INFO L78 Accepts]: Start accepts. Automaton has 6311 states and 20849 transitions. Word has length 75 [2021-07-09 16:52:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:06,768 INFO L482 AbstractCegarLoop]: Abstraction has 6311 states and 20849 transitions. [2021-07-09 16:52:06,768 INFO L483 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-07-09 16:52:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6311 states and 20849 transitions. [2021-07-09 16:52:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-09 16:52:06,779 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:06,779 INFO L508 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-07-09 16:52:06,779 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 16:52:06,779 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1477414137, now seen corresponding path program 3 times [2021-07-09 16:52:06,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:06,780 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407591294] [2021-07-09 16:52:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:07,081 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:07,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407591294] [2021-07-09 16:52:07,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407591294] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:07,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:07,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:52:07,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853019915] [2021-07-09 16:52:07,082 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:52:07,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:52:07,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:52:07,082 INFO L87 Difference]: Start difference. First operand 6311 states and 20849 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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-07-09 16:52:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:07,635 INFO L93 Difference]: Finished difference Result 12321 states and 40534 transitions. [2021-07-09 16:52:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-09 16:52:07,640 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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-07-09 16:52:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:07,658 INFO L225 Difference]: With dead ends: 12321 [2021-07-09 16:52:07,659 INFO L226 Difference]: Without dead ends: 7633 [2021-07-09 16:52:07,660 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 426.5ms TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2021-07-09 16:52:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7633 states. [2021-07-09 16:52:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7633 to 5897. [2021-07-09 16:52:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5897 states, 5896 states have (on average 3.2316824966078697) internal successors, (19054), 5896 states have internal predecessors, (19054), 0 states have call successors, (0), 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-07-09 16:52:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 19054 transitions. [2021-07-09 16:52:07,789 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 19054 transitions. Word has length 75 [2021-07-09 16:52:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:07,789 INFO L482 AbstractCegarLoop]: Abstraction has 5897 states and 19054 transitions. [2021-07-09 16:52:07,789 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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-07-09 16:52:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 19054 transitions. [2021-07-09 16:52:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:07,799 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:07,799 INFO L508 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-07-09 16:52:07,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 16:52:07,799 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:07,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1708555019, now seen corresponding path program 1 times [2021-07-09 16:52:07,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:07,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035422168] [2021-07-09 16:52:07,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:08,128 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:08,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035422168] [2021-07-09 16:52:08,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035422168] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:08,128 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:08,128 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-09 16:52:08,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962203822] [2021-07-09 16:52:08,129 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-09 16:52:08,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:08,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-09 16:52:08,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:52:08,129 INFO L87 Difference]: Start difference. First operand 5897 states and 19054 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 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-07-09 16:52:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:08,647 INFO L93 Difference]: Finished difference Result 8223 states and 26343 transitions. [2021-07-09 16:52:08,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-09 16:52:08,648 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 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-07-09 16:52:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:08,662 INFO L225 Difference]: With dead ends: 8223 [2021-07-09 16:52:08,662 INFO L226 Difference]: Without dead ends: 6207 [2021-07-09 16:52:08,662 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 294.6ms TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2021-07-09 16:52:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6207 states. [2021-07-09 16:52:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6207 to 6179. [2021-07-09 16:52:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6179 states, 6178 states have (on average 3.2238588539980575) internal successors, (19917), 6178 states have internal predecessors, (19917), 0 states have call successors, (0), 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-07-09 16:52:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6179 states to 6179 states and 19917 transitions. [2021-07-09 16:52:08,798 INFO L78 Accepts]: Start accepts. Automaton has 6179 states and 19917 transitions. Word has length 76 [2021-07-09 16:52:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:08,799 INFO L482 AbstractCegarLoop]: Abstraction has 6179 states and 19917 transitions. [2021-07-09 16:52:08,799 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 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-07-09 16:52:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 6179 states and 19917 transitions. [2021-07-09 16:52:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:08,810 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:08,810 INFO L508 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-07-09 16:52:08,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 16:52:08,811 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:08,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:08,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1122461241, now seen corresponding path program 2 times [2021-07-09 16:52:08,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:08,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323378695] [2021-07-09 16:52:08,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:09,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:09,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323378695] [2021-07-09 16:52:09,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323378695] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:09,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:09,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-07-09 16:52:09,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136805031] [2021-07-09 16:52:09,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-07-09 16:52:09,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:09,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-07-09 16:52:09,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:52:09,074 INFO L87 Difference]: Start difference. First operand 6179 states and 19917 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 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-07-09 16:52:09,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:09,946 INFO L93 Difference]: Finished difference Result 8995 states and 28936 transitions. [2021-07-09 16:52:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-07-09 16:52:09,946 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 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-07-09 16:52:09,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:09,957 INFO L225 Difference]: With dead ends: 8995 [2021-07-09 16:52:09,958 INFO L226 Difference]: Without dead ends: 5545 [2021-07-09 16:52:09,958 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 607.2ms TimeCoverageRelationStatistics Valid=281, Invalid=775, Unknown=0, NotChecked=0, Total=1056 [2021-07-09 16:52:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2021-07-09 16:52:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 5117. [2021-07-09 16:52:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5117 states, 5116 states have (on average 3.2689601250977325) internal successors, (16724), 5116 states have internal predecessors, (16724), 0 states have call successors, (0), 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-07-09 16:52:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 16724 transitions. [2021-07-09 16:52:10,058 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 16724 transitions. Word has length 76 [2021-07-09 16:52:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:10,059 INFO L482 AbstractCegarLoop]: Abstraction has 5117 states and 16724 transitions. [2021-07-09 16:52:10,059 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 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-07-09 16:52:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 16724 transitions. [2021-07-09 16:52:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:10,067 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:10,067 INFO L508 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-07-09 16:52:10,068 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 16:52:10,068 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash 955902061, now seen corresponding path program 3 times [2021-07-09 16:52:10,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:10,068 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331165464] [2021-07-09 16:52:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:10,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:10,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331165464] [2021-07-09 16:52:10,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331165464] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:10,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:10,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:52:10,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562121238] [2021-07-09 16:52:10,289 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:52:10,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:10,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:52:10,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:52:10,290 INFO L87 Difference]: Start difference. First operand 5117 states and 16724 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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-07-09 16:52:10,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:10,640 INFO L93 Difference]: Finished difference Result 8223 states and 26845 transitions. [2021-07-09 16:52:10,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:52:10,640 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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-07-09 16:52:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:10,652 INFO L225 Difference]: With dead ends: 8223 [2021-07-09 16:52:10,652 INFO L226 Difference]: Without dead ends: 5502 [2021-07-09 16:52:10,652 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 181.1ms TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:52:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5502 states. [2021-07-09 16:52:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5502 to 5439. [2021-07-09 16:52:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5439 states, 5438 states have (on average 3.2629643251195293) internal successors, (17744), 5438 states have internal predecessors, (17744), 0 states have call successors, (0), 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-07-09 16:52:10,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5439 states to 5439 states and 17744 transitions. [2021-07-09 16:52:10,765 INFO L78 Accepts]: Start accepts. Automaton has 5439 states and 17744 transitions. Word has length 76 [2021-07-09 16:52:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:10,765 INFO L482 AbstractCegarLoop]: Abstraction has 5439 states and 17744 transitions. [2021-07-09 16:52:10,765 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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-07-09 16:52:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 5439 states and 17744 transitions. [2021-07-09 16:52:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:10,775 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:10,775 INFO L508 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-07-09 16:52:10,775 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 16:52:10,775 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:10,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:10,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1875114199, now seen corresponding path program 4 times [2021-07-09 16:52:10,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:10,776 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029475637] [2021-07-09 16:52:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:11,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:11,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029475637] [2021-07-09 16:52:11,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029475637] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:11,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:11,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-09 16:52:11,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649810461] [2021-07-09 16:52:11,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-09 16:52:11,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:11,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-09 16:52:11,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:52:11,049 INFO L87 Difference]: Start difference. First operand 5439 states and 17744 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 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-07-09 16:52:11,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:11,947 INFO L93 Difference]: Finished difference Result 10362 states and 33628 transitions. [2021-07-09 16:52:11,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-07-09 16:52:11,948 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 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-07-09 16:52:11,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:11,963 INFO L225 Difference]: With dead ends: 10362 [2021-07-09 16:52:11,964 INFO L226 Difference]: Without dead ends: 6586 [2021-07-09 16:52:11,964 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 654.5ms TimeCoverageRelationStatistics Valid=244, Invalid=568, Unknown=0, NotChecked=0, Total=812 [2021-07-09 16:52:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6586 states. [2021-07-09 16:52:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6586 to 4738. [2021-07-09 16:52:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4738 states, 4737 states have (on average 3.2239814228414607) internal successors, (15272), 4737 states have internal predecessors, (15272), 0 states have call successors, (0), 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-07-09 16:52:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4738 states to 4738 states and 15272 transitions. [2021-07-09 16:52:12,075 INFO L78 Accepts]: Start accepts. Automaton has 4738 states and 15272 transitions. Word has length 76 [2021-07-09 16:52:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:12,075 INFO L482 AbstractCegarLoop]: Abstraction has 4738 states and 15272 transitions. [2021-07-09 16:52:12,075 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 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-07-09 16:52:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 4738 states and 15272 transitions. [2021-07-09 16:52:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-09 16:52:12,086 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:12,086 INFO L508 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-07-09 16:52:12,086 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 16:52:12,087 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:12,087 INFO L82 PathProgramCache]: Analyzing trace with hash 587070336, now seen corresponding path program 1 times [2021-07-09 16:52:12,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:12,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216924762] [2021-07-09 16:52:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:12,169 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:12,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216924762] [2021-07-09 16:52:12,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216924762] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:12,169 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:12,169 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:52:12,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671881801] [2021-07-09 16:52:12,170 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:52:12,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:12,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:52:12,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:52:12,170 INFO L87 Difference]: Start difference. First operand 4738 states and 15272 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:12,264 INFO L93 Difference]: Finished difference Result 5787 states and 18396 transitions. [2021-07-09 16:52:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:12,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-07-09 16:52:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:12,273 INFO L225 Difference]: With dead ends: 5787 [2021-07-09 16:52:12,273 INFO L226 Difference]: Without dead ends: 4043 [2021-07-09 16:52:12,273 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 64.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:52:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4043 states. [2021-07-09 16:52:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4043 to 4043. [2021-07-09 16:52:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4043 states, 4042 states have (on average 3.1781296387926767) internal successors, (12846), 4042 states have internal predecessors, (12846), 0 states have call successors, (0), 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-07-09 16:52:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 12846 transitions. [2021-07-09 16:52:12,346 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 12846 transitions. Word has length 77 [2021-07-09 16:52:12,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:12,346 INFO L482 AbstractCegarLoop]: Abstraction has 4043 states and 12846 transitions. [2021-07-09 16:52:12,346 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 12846 transitions. [2021-07-09 16:52:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-09 16:52:12,356 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:12,356 INFO L508 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] [2021-07-09 16:52:12,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 16:52:12,357 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:12,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1281429161, now seen corresponding path program 1 times [2021-07-09 16:52:12,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:12,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880855377] [2021-07-09 16:52:12,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:12,442 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:12,442 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880855377] [2021-07-09 16:52:12,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880855377] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:12,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:12,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:52:12,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78858100] [2021-07-09 16:52:12,442 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:52:12,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:12,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:52:12,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:52:12,443 INFO L87 Difference]: Start difference. First operand 4043 states and 12846 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:12,540 INFO L93 Difference]: Finished difference Result 4157 states and 12913 transitions. [2021-07-09 16:52:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 16:52:12,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-07-09 16:52:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:12,545 INFO L225 Difference]: With dead ends: 4157 [2021-07-09 16:52:12,545 INFO L226 Difference]: Without dead ends: 2837 [2021-07-09 16:52:12,545 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:52:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2021-07-09 16:52:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2837. [2021-07-09 16:52:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2837 states, 2836 states have (on average 3.0613540197461213) internal successors, (8682), 2836 states have internal predecessors, (8682), 0 states have call successors, (0), 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-07-09 16:52:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 8682 transitions. [2021-07-09 16:52:12,581 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 8682 transitions. Word has length 78 [2021-07-09 16:52:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:12,581 INFO L482 AbstractCegarLoop]: Abstraction has 2837 states and 8682 transitions. [2021-07-09 16:52:12,581 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 8682 transitions. [2021-07-09 16:52:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-09 16:52:12,585 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:12,585 INFO L508 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] [2021-07-09 16:52:12,585 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-09 16:52:12,585 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:12,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:12,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1288565066, now seen corresponding path program 1 times [2021-07-09 16:52:12,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:12,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977523674] [2021-07-09 16:52:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:12,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:12,675 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:12,675 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977523674] [2021-07-09 16:52:12,675 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977523674] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:12,675 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:12,675 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 16:52:12,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914116986] [2021-07-09 16:52:12,676 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 16:52:12,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:12,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 16:52:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-09 16:52:12,676 INFO L87 Difference]: Start difference. First operand 2837 states and 8682 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:12,794 INFO L93 Difference]: Finished difference Result 2423 states and 7248 transitions. [2021-07-09 16:52:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:52:12,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-07-09 16:52:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:12,797 INFO L225 Difference]: With dead ends: 2423 [2021-07-09 16:52:12,797 INFO L226 Difference]: Without dead ends: 1526 [2021-07-09 16:52:12,797 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 87.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:52:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2021-07-09 16:52:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1346. [2021-07-09 16:52:12,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1345 states have (on average 2.887732342007435) internal successors, (3884), 1345 states have internal predecessors, (3884), 0 states have call successors, (0), 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-07-09 16:52:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 3884 transitions. [2021-07-09 16:52:12,812 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 3884 transitions. Word has length 80 [2021-07-09 16:52:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:12,812 INFO L482 AbstractCegarLoop]: Abstraction has 1346 states and 3884 transitions. [2021-07-09 16:52:12,812 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 3884 transitions. [2021-07-09 16:52:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:52:12,814 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:12,814 INFO L508 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-07-09 16:52:12,814 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-09 16:52:12,814 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:12,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:12,815 INFO L82 PathProgramCache]: Analyzing trace with hash -380848171, now seen corresponding path program 1 times [2021-07-09 16:52:12,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:12,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797557430] [2021-07-09 16:52:12,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:12,960 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:12,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797557430] [2021-07-09 16:52:12,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797557430] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:12,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:12,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 16:52:12,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892480044] [2021-07-09 16:52:12,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 16:52:12,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:12,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 16:52:12,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-07-09 16:52:12,962 INFO L87 Difference]: Start difference. First operand 1346 states and 3884 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-07-09 16:52:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:13,104 INFO L93 Difference]: Finished difference Result 2489 states and 7367 transitions. [2021-07-09 16:52:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-07-09 16:52:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:13,107 INFO L225 Difference]: With dead ends: 2489 [2021-07-09 16:52:13,107 INFO L226 Difference]: Without dead ends: 1344 [2021-07-09 16:52:13,107 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 106.1ms TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:52:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2021-07-09 16:52:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2021-07-09 16:52:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 2.9128816083395384) internal successors, (3912), 1343 states have internal predecessors, (3912), 0 states have call successors, (0), 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-07-09 16:52:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 3912 transitions. [2021-07-09 16:52:13,123 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 3912 transitions. Word has length 82 [2021-07-09 16:52:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:13,123 INFO L482 AbstractCegarLoop]: Abstraction has 1344 states and 3912 transitions. [2021-07-09 16:52:13,123 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-07-09 16:52:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 3912 transitions. [2021-07-09 16:52:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:52:13,125 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:13,125 INFO L508 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-07-09 16:52:13,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-09 16:52:13,125 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:13,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2015125931, now seen corresponding path program 2 times [2021-07-09 16:52:13,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:13,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171256289] [2021-07-09 16:52:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:13,286 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:13,286 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171256289] [2021-07-09 16:52:13,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171256289] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:13,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:13,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:52:13,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912504639] [2021-07-09 16:52:13,287 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:52:13,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:13,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:52:13,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:52:13,287 INFO L87 Difference]: Start difference. First operand 1344 states and 3912 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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-07-09 16:52:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:13,438 INFO L93 Difference]: Finished difference Result 1854 states and 5434 transitions. [2021-07-09 16:52:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:13,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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-07-09 16:52:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:13,440 INFO L225 Difference]: With dead ends: 1854 [2021-07-09 16:52:13,440 INFO L226 Difference]: Without dead ends: 1075 [2021-07-09 16:52:13,440 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 133.0ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-07-09 16:52:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2021-07-09 16:52:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1027. [2021-07-09 16:52:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 2.7982456140350878) internal successors, (2871), 1026 states have internal predecessors, (2871), 0 states have call successors, (0), 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-07-09 16:52:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 2871 transitions. [2021-07-09 16:52:13,451 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 2871 transitions. Word has length 82 [2021-07-09 16:52:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:13,451 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 2871 transitions. [2021-07-09 16:52:13,451 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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-07-09 16:52:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 2871 transitions. [2021-07-09 16:52:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:52:13,452 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:13,452 INFO L508 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-07-09 16:52:13,452 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-09 16:52:13,452 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:13,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1941565299, now seen corresponding path program 3 times [2021-07-09 16:52:13,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:13,453 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765222031] [2021-07-09 16:52:13,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:13,598 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:13,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765222031] [2021-07-09 16:52:13,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765222031] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:13,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:13,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:52:13,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707683658] [2021-07-09 16:52:13,598 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:52:13,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:52:13,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:52:13,599 INFO L87 Difference]: Start difference. First operand 1027 states and 2871 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 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-07-09 16:52:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:13,785 INFO L93 Difference]: Finished difference Result 1588 states and 4514 transitions. [2021-07-09 16:52:13,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:52:13,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 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-07-09 16:52:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:13,787 INFO L225 Difference]: With dead ends: 1588 [2021-07-09 16:52:13,787 INFO L226 Difference]: Without dead ends: 986 [2021-07-09 16:52:13,787 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 131.1ms TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:52:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2021-07-09 16:52:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2021-07-09 16:52:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 2.8) internal successors, (2758), 985 states have internal predecessors, (2758), 0 states have call successors, (0), 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-07-09 16:52:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2758 transitions. [2021-07-09 16:52:13,798 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2758 transitions. Word has length 82 [2021-07-09 16:52:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:13,798 INFO L482 AbstractCegarLoop]: Abstraction has 986 states and 2758 transitions. [2021-07-09 16:52:13,798 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 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-07-09 16:52:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2758 transitions. [2021-07-09 16:52:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:52:13,799 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:13,799 INFO L508 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-07-09 16:52:13,800 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-09 16:52:13,800 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:13,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1585756151, now seen corresponding path program 4 times [2021-07-09 16:52:13,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:13,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030598908] [2021-07-09 16:52:13,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:13,997 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:13,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030598908] [2021-07-09 16:52:13,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030598908] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:13,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:13,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:52:13,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036849282] [2021-07-09 16:52:13,998 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:52:13,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:13,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:52:13,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:52:13,998 INFO L87 Difference]: Start difference. First operand 986 states and 2758 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-07-09 16:52:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:14,233 INFO L93 Difference]: Finished difference Result 1943 states and 5622 transitions. [2021-07-09 16:52:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:52:14,233 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-07-09 16:52:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:14,236 INFO L225 Difference]: With dead ends: 1943 [2021-07-09 16:52:14,236 INFO L226 Difference]: Without dead ends: 1331 [2021-07-09 16:52:14,236 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 189.3ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:52:14,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2021-07-09 16:52:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 956. [2021-07-09 16:52:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 2.7853403141361257) internal successors, (2660), 955 states have internal predecessors, (2660), 0 states have call successors, (0), 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-07-09 16:52:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2660 transitions. [2021-07-09 16:52:14,248 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2660 transitions. Word has length 82 [2021-07-09 16:52:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:14,248 INFO L482 AbstractCegarLoop]: Abstraction has 956 states and 2660 transitions. [2021-07-09 16:52:14,248 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 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-07-09 16:52:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2660 transitions. [2021-07-09 16:52:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:52:14,250 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:14,250 INFO L508 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-07-09 16:52:14,250 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-09 16:52:14,250 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:14,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2051057673, now seen corresponding path program 5 times [2021-07-09 16:52:14,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:14,251 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555239032] [2021-07-09 16:52:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:14,408 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:14,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555239032] [2021-07-09 16:52:14,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555239032] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:14,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:14,408 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:52:14,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841553737] [2021-07-09 16:52:14,409 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:52:14,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:14,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:52:14,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:52:14,410 INFO L87 Difference]: Start difference. First operand 956 states and 2660 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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-07-09 16:52:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:14,583 INFO L93 Difference]: Finished difference Result 1466 states and 4182 transitions. [2021-07-09 16:52:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 16:52:14,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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-07-09 16:52:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:14,584 INFO L225 Difference]: With dead ends: 1466 [2021-07-09 16:52:14,584 INFO L226 Difference]: Without dead ends: 807 [2021-07-09 16:52:14,585 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 135.8ms TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-07-09 16:52:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-07-09 16:52:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2021-07-09 16:52:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 2.7841191066997517) internal successors, (2244), 806 states have internal predecessors, (2244), 0 states have call successors, (0), 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-07-09 16:52:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2244 transitions. [2021-07-09 16:52:14,593 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2244 transitions. Word has length 82 [2021-07-09 16:52:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:14,593 INFO L482 AbstractCegarLoop]: Abstraction has 807 states and 2244 transitions. [2021-07-09 16:52:14,593 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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-07-09 16:52:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2244 transitions. [2021-07-09 16:52:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:52:14,594 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:14,594 INFO L508 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-07-09 16:52:14,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-09 16:52:14,595 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1752140297, now seen corresponding path program 6 times [2021-07-09 16:52:14,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:14,595 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138253390] [2021-07-09 16:52:14,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:52:14,629 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:52:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:52:14,675 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:52:14,716 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 16:52:14,716 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 16:52:14,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-07-09 16:52:14,717 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-09 16:52:14,718 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 16:52:14,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 04:52:14 BasicIcfg [2021-07-09 16:52:14,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 16:52:14,823 INFO L168 Benchmark]: Toolchain (without parser) took 16606.59 ms. Allocated memory was 207.6 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 169.8 MB in the beginning and 1.1 GB in the end (delta: -891.0 MB). Peak memory consumption was 837.8 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:14,823 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 207.6 MB. Free memory is still 188.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 16:52:14,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.35 ms. Allocated memory is still 207.6 MB. Free memory was 169.8 MB in the beginning and 175.0 MB in the end (delta: -5.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:14,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.33 ms. Allocated memory is still 207.6 MB. Free memory was 175.0 MB in the beginning and 171.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:14,823 INFO L168 Benchmark]: Boogie Preprocessor took 44.76 ms. Allocated memory is still 207.6 MB. Free memory was 171.9 MB in the beginning and 168.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:14,823 INFO L168 Benchmark]: RCFGBuilder took 2320.81 ms. Allocated memory was 207.6 MB in the beginning and 307.2 MB in the end (delta: 99.6 MB). Free memory was 168.2 MB in the beginning and 201.1 MB in the end (delta: -32.9 MB). Peak memory consumption was 127.0 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:14,823 INFO L168 Benchmark]: TraceAbstraction took 13711.56 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 200.5 MB in the beginning and 1.1 GB in the end (delta: -860.3 MB). Peak memory consumption was 768.5 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:14,824 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.12 ms. Allocated memory is still 207.6 MB. Free memory is still 188.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 480.35 ms. Allocated memory is still 207.6 MB. Free memory was 169.8 MB in the beginning and 175.0 MB in the end (delta: -5.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 43.33 ms. Allocated memory is still 207.6 MB. Free memory was 175.0 MB in the beginning and 171.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.76 ms. Allocated memory is still 207.6 MB. Free memory was 171.9 MB in the beginning and 168.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2320.81 ms. Allocated memory was 207.6 MB in the beginning and 307.2 MB in the end (delta: 99.6 MB). Free memory was 168.2 MB in the beginning and 201.1 MB in the end (delta: -32.9 MB). Peak memory consumption was 127.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13711.56 ms. Allocated memory was 307.2 MB in the beginning and 1.9 GB in the end (delta: 1.6 GB). Free memory was 200.5 MB in the beginning and 1.1 GB in the end (delta: -860.3 MB). Peak memory consumption was 768.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t2540; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2540, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2541; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t2541, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2542; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2542, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 556.9ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 24.8ms, AutomataDifference: 167.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 140.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 87 SDtfs, 33 SDslu, 26 SDs, 0 SdLazy, 6 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5632occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.0ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 5.2ms SsaConstructionTime, 30.6ms SatisfiabilityAnalysisTime, 108.4ms InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - 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. VerificationResult: UNSAFE, OverallTime: 12912.0ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 184.0ms, AutomataDifference: 6526.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 153.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2722 SDtfs, 4033 SDslu, 13824 SDs, 0 SdLazy, 2673 SolverSat, 566 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2454.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 4003.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9601occurred in iteration=0, InterpolantAutomatonStates: 240, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2037.2ms AutomataMinimizationTime, 19 MinimizatonAttempts, 8886 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 70.7ms SsaConstructionTime, 870.3ms SatisfiabilityAnalysisTime, 2834.6ms InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1440 ConstructedInterpolants, 0 QuantifiedInterpolants, 8847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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! Received shutdown request...