/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 10:09:50,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 10:09:50,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 10:09:50,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 10:09:50,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 10:09:50,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 10:09:50,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 10:09:50,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 10:09:50,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 10:09:50,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 10:09:50,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 10:09:50,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 10:09:50,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 10:09:50,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 10:09:50,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 10:09:50,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 10:09:50,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 10:09:50,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 10:09:50,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 10:09:50,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 10:09:50,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 10:09:50,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 10:09:50,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 10:09:50,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 10:09:50,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 10:09:50,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 10:09:50,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 10:09:50,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 10:09:50,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 10:09:50,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 10:09:50,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 10:09:50,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 10:09:50,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 10:09:50,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 10:09:50,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 10:09:50,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 10:09:50,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 10:09:50,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 10:09:50,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 10:09:50,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 10:09:50,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 10:09:50,216 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-Separate.epf [2021-06-05 10:09:50,246 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 10:09:50,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 10:09:50,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 10:09:50,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 10:09:50,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 10:09:50,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 10:09:50,249 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 10:09:50,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 10:09:50,249 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 10:09:50,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 10:09:50,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 10:09:50,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 10:09:50,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 10:09:50,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 10:09:50,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 10:09:50,250 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 10:09:50,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 10:09:50,250 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 10:09:50,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 10:09:50,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 10:09:50,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 10:09:50,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 10:09:50,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 10:09:50,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 10:09:50,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 10:09:50,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 10:09:50,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 10:09:50,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 10:09:50,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 10:09:50,251 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 10:09:50,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 10:09:50,251 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 10:09:50,252 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-06-05 10:09:50,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 10:09:50,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 10:09:50,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 10:09:50,522 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 10:09:50,523 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 10:09:50,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i [2021-06-05 10:09:50,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a22b021/003d1e548a4b41ee87c1a9ae1cdfa816/FLAG801c59238 [2021-06-05 10:09:50,959 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 10:09:50,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i [2021-06-05 10:09:50,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a22b021/003d1e548a4b41ee87c1a9ae1cdfa816/FLAG801c59238 [2021-06-05 10:09:50,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a22b021/003d1e548a4b41ee87c1a9ae1cdfa816 [2021-06-05 10:09:50,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 10:09:50,995 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 10:09:50,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 10:09:50,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 10:09:51,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 10:09:51,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:09:50" (1/1) ... [2021-06-05 10:09:51,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7946f29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51, skipping insertion in model container [2021-06-05 10:09:51,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:09:50" (1/1) ... [2021-06-05 10:09:51,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 10:09:51,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 10:09:51,178 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/safe023_pso.opt.i[992,1005] [2021-06-05 10:09:51,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:09:51,294 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 10:09:51,302 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/safe023_pso.opt.i[992,1005] [2021-06-05 10:09:51,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:09:51,376 INFO L208 MainTranslator]: Completed translation [2021-06-05 10:09:51,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51 WrapperNode [2021-06-05 10:09:51,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 10:09:51,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 10:09:51,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 10:09:51,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 10:09:51,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (1/1) ... [2021-06-05 10:09:51,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (1/1) ... [2021-06-05 10:09:51,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 10:09:51,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 10:09:51,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 10:09:51,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 10:09:51,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (1/1) ... [2021-06-05 10:09:51,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (1/1) ... [2021-06-05 10:09:51,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (1/1) ... [2021-06-05 10:09:51,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (1/1) ... [2021-06-05 10:09:51,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (1/1) ... [2021-06-05 10:09:51,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (1/1) ... [2021-06-05 10:09:51,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (1/1) ... [2021-06-05 10:09:51,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 10:09:51,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 10:09:51,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 10:09:51,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 10:09:51,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (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-06-05 10:09:51,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 10:09:51,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 10:09:51,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 10:09:51,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 10:09:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 10:09:51,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 10:09:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 10:09:51,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 10:09:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 10:09:51,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 10:09:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 10:09:51,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 10:09:51,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 10:09:51,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 10:09:51,507 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 10:09:54,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 10:09:54,803 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 10:09:54,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:09:54 BoogieIcfgContainer [2021-06-05 10:09:54,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 10:09:54,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 10:09:54,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 10:09:54,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 10:09:54,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 10:09:50" (1/3) ... [2021-06-05 10:09:54,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f31cebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:09:54, skipping insertion in model container [2021-06-05 10:09:54,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:09:51" (2/3) ... [2021-06-05 10:09:54,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f31cebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:09:54, skipping insertion in model container [2021-06-05 10:09:54,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:09:54" (3/3) ... [2021-06-05 10:09:54,810 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_pso.opt.i [2021-06-05 10:09:54,814 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 10:09:54,814 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 10:09:54,814 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 10:09:54,815 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 10:09:54,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,859 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,859 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,859 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,859 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,863 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,864 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,865 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,866 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,867 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,868 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,874 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,875 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,875 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,875 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,875 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,876 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,877 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,883 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,884 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,885 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,888 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,893 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:09:54,901 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 10:09:54,915 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 10:09:54,927 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:09:54,927 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:09:54,928 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:09:54,928 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:09:54,928 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:09:54,928 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:09:54,928 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:09:54,928 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 10:09:54,935 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow [2021-06-05 10:09:55,808 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 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-06-05 10:09:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 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-06-05 10:09:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-06-05 10:09:55,850 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:55,850 INFO L521 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] [2021-06-05 10:09:55,851 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash -865950546, now seen corresponding path program 1 times [2021-06-05 10:09:55,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:55,861 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062032825] [2021-06-05 10:09:55,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:56,031 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:56,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062032825] [2021-06-05 10:09:56,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062032825] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:56,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:56,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 10:09:56,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795124918] [2021-06-05 10:09:56,035 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 10:09:56,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:56,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 10:09:56,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:09:56,078 INFO L87 Difference]: Start difference. First operand has 18166 states, 18162 states have (on average 3.649983481995375) internal successors, (66291), 18165 states have internal predecessors, (66291), 0 states have call successors, (0), 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 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-06-05 10:09:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:56,418 INFO L93 Difference]: Finished difference Result 15583 states and 55472 transitions. [2021-06-05 10:09:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 10:09:56,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2021-06-05 10:09:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:56,487 INFO L225 Difference]: With dead ends: 15583 [2021-06-05 10:09:56,487 INFO L226 Difference]: Without dead ends: 9247 [2021-06-05 10:09:56,488 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:09:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9247 states. [2021-06-05 10:09:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9247 to 9247. [2021-06-05 10:09:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9247 states, 9246 states have (on average 3.505948518278174) internal successors, (32416), 9246 states have internal predecessors, (32416), 0 states have call successors, (0), 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-06-05 10:09:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9247 states to 9247 states and 32416 transitions. [2021-06-05 10:09:56,850 INFO L78 Accepts]: Start accepts. Automaton has 9247 states and 32416 transitions. Word has length 49 [2021-06-05 10:09:56,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:56,850 INFO L482 AbstractCegarLoop]: Abstraction has 9247 states and 32416 transitions. [2021-06-05 10:09:56,850 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-06-05 10:09:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 9247 states and 32416 transitions. [2021-06-05 10:09:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 10:09:56,866 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:56,866 INFO L521 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] [2021-06-05 10:09:56,866 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 10:09:56,867 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:56,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:56,869 INFO L82 PathProgramCache]: Analyzing trace with hash -64619290, now seen corresponding path program 1 times [2021-06-05 10:09:56,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:56,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663217591] [2021-06-05 10:09:56,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:57,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:57,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663217591] [2021-06-05 10:09:57,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663217591] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:57,174 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:57,174 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:09:57,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396745316] [2021-06-05 10:09:57,175 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:09:57,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:57,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:09:57,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:09:57,175 INFO L87 Difference]: Start difference. First operand 9247 states and 32416 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-06-05 10:09:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:57,377 INFO L93 Difference]: Finished difference Result 10687 states and 37116 transitions. [2021-06-05 10:09:57,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:09:57,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-05 10:09:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:57,411 INFO L225 Difference]: With dead ends: 10687 [2021-06-05 10:09:57,411 INFO L226 Difference]: Without dead ends: 8383 [2021-06-05 10:09:57,412 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 121.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:09:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8383 states. [2021-06-05 10:09:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8383 to 8383. [2021-06-05 10:09:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8383 states, 8382 states have (on average 3.4793605344786447) internal successors, (29164), 8382 states have internal predecessors, (29164), 0 states have call successors, (0), 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-06-05 10:09:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8383 states to 8383 states and 29164 transitions. [2021-06-05 10:09:57,646 INFO L78 Accepts]: Start accepts. Automaton has 8383 states and 29164 transitions. Word has length 68 [2021-06-05 10:09:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:57,647 INFO L482 AbstractCegarLoop]: Abstraction has 8383 states and 29164 transitions. [2021-06-05 10:09:57,647 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-06-05 10:09:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8383 states and 29164 transitions. [2021-06-05 10:09:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 10:09:57,656 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:57,657 INFO L521 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] [2021-06-05 10:09:57,657 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 10:09:57,657 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1523198617, now seen corresponding path program 1 times [2021-06-05 10:09:57,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:57,657 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156101297] [2021-06-05 10:09:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:57,799 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:57,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156101297] [2021-06-05 10:09:57,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156101297] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:57,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:57,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:09:57,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142584679] [2021-06-05 10:09:57,801 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:09:57,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:57,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:09:57,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:09:57,801 INFO L87 Difference]: Start difference. First operand 8383 states and 29164 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-06-05 10:09:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:58,008 INFO L93 Difference]: Finished difference Result 11569 states and 40051 transitions. [2021-06-05 10:09:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:09:58,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-06-05 10:09:58,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:58,025 INFO L225 Difference]: With dead ends: 11569 [2021-06-05 10:09:58,025 INFO L226 Difference]: Without dead ends: 5953 [2021-06-05 10:09:58,026 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 154.4ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 10:09:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2021-06-05 10:09:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 5953. [2021-06-05 10:09:58,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5953 states, 5952 states have (on average 3.3665994623655915) internal successors, (20038), 5952 states have internal predecessors, (20038), 0 states have call successors, (0), 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-06-05 10:09:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5953 states to 5953 states and 20038 transitions. [2021-06-05 10:09:58,237 INFO L78 Accepts]: Start accepts. Automaton has 5953 states and 20038 transitions. Word has length 70 [2021-06-05 10:09:58,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:58,238 INFO L482 AbstractCegarLoop]: Abstraction has 5953 states and 20038 transitions. [2021-06-05 10:09:58,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-06-05 10:09:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 5953 states and 20038 transitions. [2021-06-05 10:09:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:09:58,247 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:58,248 INFO L521 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-06-05 10:09:58,248 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 10:09:58,248 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:58,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:58,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2049871650, now seen corresponding path program 1 times [2021-06-05 10:09:58,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:58,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295402008] [2021-06-05 10:09:58,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:58,432 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:58,432 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295402008] [2021-06-05 10:09:58,432 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295402008] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:58,432 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:58,432 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:09:58,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430049241] [2021-06-05 10:09:58,432 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:09:58,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:09:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:09:58,433 INFO L87 Difference]: Start difference. First operand 5953 states and 20038 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:09:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:58,589 INFO L93 Difference]: Finished difference Result 6313 states and 21076 transitions. [2021-06-05 10:09:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:09:58,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:09:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:58,604 INFO L225 Difference]: With dead ends: 6313 [2021-06-05 10:09:58,605 INFO L226 Difference]: Without dead ends: 5233 [2021-06-05 10:09:58,605 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 120.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:09:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2021-06-05 10:09:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 5233. [2021-06-05 10:09:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 3.3298929663608563) internal successors, (17422), 5232 states have internal predecessors, (17422), 0 states have call successors, (0), 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-06-05 10:09:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 17422 transitions. [2021-06-05 10:09:58,755 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 17422 transitions. Word has length 73 [2021-06-05 10:09:58,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:58,755 INFO L482 AbstractCegarLoop]: Abstraction has 5233 states and 17422 transitions. [2021-06-05 10:09:58,755 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:09:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 17422 transitions. [2021-06-05 10:09:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 10:09:58,764 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:09:58,764 INFO L521 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-06-05 10:09:58,764 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 10:09:58,764 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:09:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:09:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash -189757990, now seen corresponding path program 1 times [2021-06-05 10:09:58,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:09:58,765 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141865349] [2021-06-05 10:09:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:09:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:09:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:09:59,104 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:09:59,104 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141865349] [2021-06-05 10:09:59,104 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141865349] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:09:59,104 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:09:59,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 10:09:59,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614112357] [2021-06-05 10:09:59,105 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 10:09:59,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:09:59,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 10:09:59,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:09:59,105 INFO L87 Difference]: Start difference. First operand 5233 states and 17422 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-06-05 10:09:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:09:59,873 INFO L93 Difference]: Finished difference Result 6719 states and 22349 transitions. [2021-06-05 10:09:59,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 10:09:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-06-05 10:09:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:09:59,889 INFO L225 Difference]: With dead ends: 6719 [2021-06-05 10:09:59,889 INFO L226 Difference]: Without dead ends: 6099 [2021-06-05 10:09:59,889 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 468.6ms TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2021-06-05 10:09:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6099 states. [2021-06-05 10:09:59,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6099 to 5615. [2021-06-05 10:09:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5615 states, 5614 states have (on average 3.326861417883862) internal successors, (18677), 5614 states have internal predecessors, (18677), 0 states have call successors, (0), 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-06-05 10:09:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5615 states to 5615 states and 18677 transitions. [2021-06-05 10:09:59,996 INFO L78 Accepts]: Start accepts. Automaton has 5615 states and 18677 transitions. Word has length 77 [2021-06-05 10:09:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:09:59,996 INFO L482 AbstractCegarLoop]: Abstraction has 5615 states and 18677 transitions. [2021-06-05 10:09:59,997 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-06-05 10:09:59,997 INFO L276 IsEmpty]: Start isEmpty. Operand 5615 states and 18677 transitions. [2021-06-05 10:10:00,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 10:10:00,007 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:00,007 INFO L521 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-06-05 10:10:00,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 10:10:00,007 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:00,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:00,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1192464058, now seen corresponding path program 2 times [2021-06-05 10:10:00,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:00,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614075942] [2021-06-05 10:10:00,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:00,391 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:00,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614075942] [2021-06-05 10:10:00,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614075942] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:00,392 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:00,392 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 10:10:00,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874432395] [2021-06-05 10:10:00,392 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 10:10:00,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 10:10:00,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:10:00,393 INFO L87 Difference]: Start difference. First operand 5615 states and 18677 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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-06-05 10:10:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:01,085 INFO L93 Difference]: Finished difference Result 6628 states and 21989 transitions. [2021-06-05 10:10:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 10:10:01,086 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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-06-05 10:10:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:01,100 INFO L225 Difference]: With dead ends: 6628 [2021-06-05 10:10:01,100 INFO L226 Difference]: Without dead ends: 6028 [2021-06-05 10:10:01,101 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 544.7ms TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-06-05 10:10:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2021-06-05 10:10:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 5646. [2021-06-05 10:10:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5646 states, 5645 states have (on average 3.333746678476528) internal successors, (18819), 5645 states have internal predecessors, (18819), 0 states have call successors, (0), 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-06-05 10:10:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 18819 transitions. [2021-06-05 10:10:01,209 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 18819 transitions. Word has length 77 [2021-06-05 10:10:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:01,209 INFO L482 AbstractCegarLoop]: Abstraction has 5646 states and 18819 transitions. [2021-06-05 10:10:01,209 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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-06-05 10:10:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 18819 transitions. [2021-06-05 10:10:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 10:10:01,223 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:01,223 INFO L521 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-06-05 10:10:01,223 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 10:10:01,223 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:01,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash -767553414, now seen corresponding path program 3 times [2021-06-05 10:10:01,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:01,224 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80726603] [2021-06-05 10:10:01,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:01,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:01,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80726603] [2021-06-05 10:10:01,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80726603] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:01,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:01,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 10:10:01,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991798562] [2021-06-05 10:10:01,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 10:10:01,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:01,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 10:10:01,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:10:01,583 INFO L87 Difference]: Start difference. First operand 5646 states and 18819 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-06-05 10:10:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:02,261 INFO L93 Difference]: Finished difference Result 9323 states and 31028 transitions. [2021-06-05 10:10:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 10:10:02,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-06-05 10:10:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:02,277 INFO L225 Difference]: With dead ends: 9323 [2021-06-05 10:10:02,278 INFO L226 Difference]: Without dead ends: 6847 [2021-06-05 10:10:02,278 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 412.3ms TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2021-06-05 10:10:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6847 states. [2021-06-05 10:10:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6847 to 6434. [2021-06-05 10:10:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6434 states, 6433 states have (on average 3.3172703248873) internal successors, (21340), 6433 states have internal predecessors, (21340), 0 states have call successors, (0), 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-06-05 10:10:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6434 states to 6434 states and 21340 transitions. [2021-06-05 10:10:02,427 INFO L78 Accepts]: Start accepts. Automaton has 6434 states and 21340 transitions. Word has length 77 [2021-06-05 10:10:02,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:02,427 INFO L482 AbstractCegarLoop]: Abstraction has 6434 states and 21340 transitions. [2021-06-05 10:10:02,428 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 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-06-05 10:10:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 6434 states and 21340 transitions. [2021-06-05 10:10:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 10:10:02,439 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:02,439 INFO L521 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-06-05 10:10:02,440 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 10:10:02,440 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash -200937414, now seen corresponding path program 1 times [2021-06-05 10:10:02,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:02,440 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957877521] [2021-06-05 10:10:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:03,036 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2021-06-05 10:10:03,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:03,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:03,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957877521] [2021-06-05 10:10:03,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957877521] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:03,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:03,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 10:10:03,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678219104] [2021-06-05 10:10:03,072 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 10:10:03,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:03,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 10:10:03,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-06-05 10:10:03,072 INFO L87 Difference]: Start difference. First operand 6434 states and 21340 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 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-06-05 10:10:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:04,321 INFO L93 Difference]: Finished difference Result 9352 states and 30873 transitions. [2021-06-05 10:10:04,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 10:10:04,321 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 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-06-05 10:10:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:04,337 INFO L225 Difference]: With dead ends: 9352 [2021-06-05 10:10:04,337 INFO L226 Difference]: Without dead ends: 7284 [2021-06-05 10:10:04,337 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1245.3ms TimeCoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2021-06-05 10:10:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7284 states. [2021-06-05 10:10:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7284 to 5712. [2021-06-05 10:10:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5712 states, 5711 states have (on average 3.271931360532306) internal successors, (18686), 5711 states have internal predecessors, (18686), 0 states have call successors, (0), 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-06-05 10:10:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 18686 transitions. [2021-06-05 10:10:04,463 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 18686 transitions. Word has length 78 [2021-06-05 10:10:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:04,463 INFO L482 AbstractCegarLoop]: Abstraction has 5712 states and 18686 transitions. [2021-06-05 10:10:04,463 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 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-06-05 10:10:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 18686 transitions. [2021-06-05 10:10:04,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-05 10:10:04,477 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:04,477 INFO L521 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-06-05 10:10:04,478 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 10:10:04,478 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:04,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:04,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1908818524, now seen corresponding path program 2 times [2021-06-05 10:10:04,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:04,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128288130] [2021-06-05 10:10:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:04,599 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:04,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128288130] [2021-06-05 10:10:04,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128288130] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:04,599 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:04,599 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:10:04,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099519082] [2021-06-05 10:10:04,600 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:10:04,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:04,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:10:04,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:10:04,600 INFO L87 Difference]: Start difference. First operand 5712 states and 18686 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:04,738 INFO L93 Difference]: Finished difference Result 6848 states and 22091 transitions. [2021-06-05 10:10:04,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:10:04,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-06-05 10:10:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:04,747 INFO L225 Difference]: With dead ends: 6848 [2021-06-05 10:10:04,747 INFO L226 Difference]: Without dead ends: 5028 [2021-06-05 10:10:04,748 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 101.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:10:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5028 states. [2021-06-05 10:10:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5028 to 5028. [2021-06-05 10:10:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5028 states, 5027 states have (on average 3.2038989456932563) internal successors, (16106), 5027 states have internal predecessors, (16106), 0 states have call successors, (0), 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-06-05 10:10:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5028 states to 5028 states and 16106 transitions. [2021-06-05 10:10:04,846 INFO L78 Accepts]: Start accepts. Automaton has 5028 states and 16106 transitions. Word has length 78 [2021-06-05 10:10:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:04,847 INFO L482 AbstractCegarLoop]: Abstraction has 5028 states and 16106 transitions. [2021-06-05 10:10:04,847 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 5028 states and 16106 transitions. [2021-06-05 10:10:04,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 10:10:04,855 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:04,855 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:10:04,855 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 10:10:04,856 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:04,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1007997177, now seen corresponding path program 1 times [2021-06-05 10:10:04,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:04,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454348272] [2021-06-05 10:10:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:04,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:04,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454348272] [2021-06-05 10:10:04,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454348272] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:04,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:04,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:10:04,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707760873] [2021-06-05 10:10:04,963 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:10:04,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:04,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:10:04,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:10:04,963 INFO L87 Difference]: Start difference. First operand 5028 states and 16106 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:05,122 INFO L93 Difference]: Finished difference Result 4974 states and 15581 transitions. [2021-06-05 10:10:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:10:05,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 10:10:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:05,128 INFO L225 Difference]: With dead ends: 4974 [2021-06-05 10:10:05,128 INFO L226 Difference]: Without dead ends: 3570 [2021-06-05 10:10:05,129 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 127.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:10:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2021-06-05 10:10:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3555. [2021-06-05 10:10:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3555 states, 3554 states have (on average 3.068655036578503) internal successors, (10906), 3554 states have internal predecessors, (10906), 0 states have call successors, (0), 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-06-05 10:10:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 10906 transitions. [2021-06-05 10:10:05,192 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 10906 transitions. Word has length 79 [2021-06-05 10:10:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:05,192 INFO L482 AbstractCegarLoop]: Abstraction has 3555 states and 10906 transitions. [2021-06-05 10:10:05,192 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 10906 transitions. [2021-06-05 10:10:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 10:10:05,198 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:05,198 INFO L521 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] [2021-06-05 10:10:05,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 10:10:05,198 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1111193274, now seen corresponding path program 1 times [2021-06-05 10:10:05,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:05,198 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246233791] [2021-06-05 10:10:05,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:05,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:05,305 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:05,305 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246233791] [2021-06-05 10:10:05,306 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246233791] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:05,306 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:05,306 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 10:10:05,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328636697] [2021-06-05 10:10:05,306 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 10:10:05,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:05,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 10:10:05,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 10:10:05,307 INFO L87 Difference]: Start difference. First operand 3555 states and 10906 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:05,474 INFO L93 Difference]: Finished difference Result 3033 states and 9103 transitions. [2021-06-05 10:10:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:10:05,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-05 10:10:05,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:05,478 INFO L225 Difference]: With dead ends: 3033 [2021-06-05 10:10:05,479 INFO L226 Difference]: Without dead ends: 2421 [2021-06-05 10:10:05,479 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 142.1ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:10:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2021-06-05 10:10:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1981. [2021-06-05 10:10:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1980 states have (on average 2.9313131313131313) internal successors, (5804), 1980 states have internal predecessors, (5804), 0 states have call successors, (0), 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-06-05 10:10:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 5804 transitions. [2021-06-05 10:10:05,514 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 5804 transitions. Word has length 81 [2021-06-05 10:10:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:05,515 INFO L482 AbstractCegarLoop]: Abstraction has 1981 states and 5804 transitions. [2021-06-05 10:10:05,515 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:05,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 5804 transitions. [2021-06-05 10:10:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:10:05,518 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:05,518 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:10:05,518 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 10:10:05,518 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:05,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1099569061, now seen corresponding path program 1 times [2021-06-05 10:10:05,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:05,519 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226144235] [2021-06-05 10:10:05,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:05,714 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:05,714 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226144235] [2021-06-05 10:10:05,714 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226144235] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:05,714 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:05,714 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 10:10:05,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374109129] [2021-06-05 10:10:05,714 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 10:10:05,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:05,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 10:10:05,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-05 10:10:05,715 INFO L87 Difference]: Start difference. First operand 1981 states and 5804 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:05,997 INFO L93 Difference]: Finished difference Result 4229 states and 12581 transitions. [2021-06-05 10:10:05,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:10:05,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 10:10:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:06,002 INFO L225 Difference]: With dead ends: 4229 [2021-06-05 10:10:06,002 INFO L226 Difference]: Without dead ends: 2896 [2021-06-05 10:10:06,002 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 147.9ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-06-05 10:10:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2021-06-05 10:10:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2347. [2021-06-05 10:10:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 2346 states have (on average 2.9049445865302643) internal successors, (6815), 2346 states have internal predecessors, (6815), 0 states have call successors, (0), 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-06-05 10:10:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 6815 transitions. [2021-06-05 10:10:06,043 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 6815 transitions. Word has length 84 [2021-06-05 10:10:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:06,043 INFO L482 AbstractCegarLoop]: Abstraction has 2347 states and 6815 transitions. [2021-06-05 10:10:06,043 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 6815 transitions. [2021-06-05 10:10:06,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:10:06,047 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:06,047 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:10:06,047 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 10:10:06,047 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:06,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:06,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2136865025, now seen corresponding path program 2 times [2021-06-05 10:10:06,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:06,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246325699] [2021-06-05 10:10:06,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:06,326 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:06,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246325699] [2021-06-05 10:10:06,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246325699] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:06,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:06,326 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 10:10:06,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462181033] [2021-06-05 10:10:06,326 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 10:10:06,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:06,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 10:10:06,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:10:06,327 INFO L87 Difference]: Start difference. First operand 2347 states and 6815 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:06,854 INFO L93 Difference]: Finished difference Result 4905 states and 14443 transitions. [2021-06-05 10:10:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:10:06,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 10:10:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:06,859 INFO L225 Difference]: With dead ends: 4905 [2021-06-05 10:10:06,860 INFO L226 Difference]: Without dead ends: 3811 [2021-06-05 10:10:06,860 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 421.0ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-06-05 10:10:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2021-06-05 10:10:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 2190. [2021-06-05 10:10:06,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 2189 states have (on average 2.8839652809502057) internal successors, (6313), 2189 states have internal predecessors, (6313), 0 states have call successors, (0), 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-06-05 10:10:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 6313 transitions. [2021-06-05 10:10:06,896 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 6313 transitions. Word has length 84 [2021-06-05 10:10:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:06,896 INFO L482 AbstractCegarLoop]: Abstraction has 2190 states and 6313 transitions. [2021-06-05 10:10:06,896 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 6313 transitions. [2021-06-05 10:10:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:10:06,899 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:06,899 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:10:06,899 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 10:10:06,899 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:06,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1379615141, now seen corresponding path program 3 times [2021-06-05 10:10:06,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:06,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100714684] [2021-06-05 10:10:06,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:07,135 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:07,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100714684] [2021-06-05 10:10:07,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100714684] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:07,135 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:07,135 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 10:10:07,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386025397] [2021-06-05 10:10:07,135 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 10:10:07,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:07,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 10:10:07,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:10:07,136 INFO L87 Difference]: Start difference. First operand 2190 states and 6313 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:07,404 INFO L93 Difference]: Finished difference Result 3064 states and 8921 transitions. [2021-06-05 10:10:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 10:10:07,405 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 10:10:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:07,407 INFO L225 Difference]: With dead ends: 3064 [2021-06-05 10:10:07,408 INFO L226 Difference]: Without dead ends: 2027 [2021-06-05 10:10:07,408 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 223.4ms TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:10:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2021-06-05 10:10:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2000. [2021-06-05 10:10:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1999 states have (on average 2.9019509754877437) internal successors, (5801), 1999 states have internal predecessors, (5801), 0 states have call successors, (0), 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-06-05 10:10:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 5801 transitions. [2021-06-05 10:10:07,470 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 5801 transitions. Word has length 84 [2021-06-05 10:10:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:07,470 INFO L482 AbstractCegarLoop]: Abstraction has 2000 states and 5801 transitions. [2021-06-05 10:10:07,470 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 5801 transitions. [2021-06-05 10:10:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:10:07,473 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:07,473 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:10:07,473 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 10:10:07,473 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:07,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:07,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2112122047, now seen corresponding path program 4 times [2021-06-05 10:10:07,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:07,474 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578145365] [2021-06-05 10:10:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:08,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:08,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578145365] [2021-06-05 10:10:08,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578145365] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:08,050 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:08,050 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-06-05 10:10:08,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361582365] [2021-06-05 10:10:08,051 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 10:10:08,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:08,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 10:10:08,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-06-05 10:10:08,051 INFO L87 Difference]: Start difference. First operand 2000 states and 5801 transitions. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:08,718 INFO L93 Difference]: Finished difference Result 3166 states and 9285 transitions. [2021-06-05 10:10:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 10:10:08,720 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 10:10:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:08,722 INFO L225 Difference]: With dead ends: 3166 [2021-06-05 10:10:08,722 INFO L226 Difference]: Without dead ends: 1750 [2021-06-05 10:10:08,722 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 824.8ms TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2021-06-05 10:10:08,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2021-06-05 10:10:08,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1750. [2021-06-05 10:10:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 2.910234419668382) internal successors, (5090), 1749 states have internal predecessors, (5090), 0 states have call successors, (0), 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-06-05 10:10:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 5090 transitions. [2021-06-05 10:10:08,749 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 5090 transitions. Word has length 84 [2021-06-05 10:10:08,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:08,749 INFO L482 AbstractCegarLoop]: Abstraction has 1750 states and 5090 transitions. [2021-06-05 10:10:08,749 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 5090 transitions. [2021-06-05 10:10:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:10:08,752 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:08,752 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:10:08,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 10:10:08,752 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:08,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:08,753 INFO L82 PathProgramCache]: Analyzing trace with hash 372066565, now seen corresponding path program 5 times [2021-06-05 10:10:08,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:08,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993069847] [2021-06-05 10:10:08,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:08,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:08,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993069847] [2021-06-05 10:10:08,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993069847] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:08,969 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:08,970 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 10:10:08,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553145200] [2021-06-05 10:10:08,970 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 10:10:08,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:08,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 10:10:08,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-06-05 10:10:08,970 INFO L87 Difference]: Start difference. First operand 1750 states and 5090 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:09,495 INFO L93 Difference]: Finished difference Result 3687 states and 10914 transitions. [2021-06-05 10:10:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 10:10:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 10:10:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:09,498 INFO L225 Difference]: With dead ends: 3687 [2021-06-05 10:10:09,498 INFO L226 Difference]: Without dead ends: 1953 [2021-06-05 10:10:09,498 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 367.6ms TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2021-06-05 10:10:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2021-06-05 10:10:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1494. [2021-06-05 10:10:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1493 states have (on average 2.8539852645679837) internal successors, (4261), 1493 states have internal predecessors, (4261), 0 states have call successors, (0), 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-06-05 10:10:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 4261 transitions. [2021-06-05 10:10:09,518 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 4261 transitions. Word has length 84 [2021-06-05 10:10:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:09,518 INFO L482 AbstractCegarLoop]: Abstraction has 1494 states and 4261 transitions. [2021-06-05 10:10:09,518 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 4261 transitions. [2021-06-05 10:10:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:10:09,520 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:09,520 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:10:09,520 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 10:10:09,520 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1687737505, now seen corresponding path program 6 times [2021-06-05 10:10:09,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:09,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830325095] [2021-06-05 10:10:09,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:09,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:09,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830325095] [2021-06-05 10:10:09,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830325095] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:09,934 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:09,934 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 10:10:09,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689726140] [2021-06-05 10:10:09,934 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 10:10:09,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 10:10:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-06-05 10:10:09,935 INFO L87 Difference]: Start difference. First operand 1494 states and 4261 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:10,246 INFO L93 Difference]: Finished difference Result 2064 states and 5976 transitions. [2021-06-05 10:10:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 10:10:10,247 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 10:10:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:10,248 INFO L225 Difference]: With dead ends: 2064 [2021-06-05 10:10:10,248 INFO L226 Difference]: Without dead ends: 971 [2021-06-05 10:10:10,249 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 425.7ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-06-05 10:10:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-06-05 10:10:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 971. [2021-06-05 10:10:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 2.804123711340206) internal successors, (2720), 970 states have internal predecessors, (2720), 0 states have call successors, (0), 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-06-05 10:10:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 2720 transitions. [2021-06-05 10:10:10,259 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 2720 transitions. Word has length 84 [2021-06-05 10:10:10,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:10,259 INFO L482 AbstractCegarLoop]: Abstraction has 971 states and 2720 transitions. [2021-06-05 10:10:10,259 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 2720 transitions. [2021-06-05 10:10:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:10:10,260 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:10,260 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:10:10,261 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-05 10:10:10,261 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:10,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:10,261 INFO L82 PathProgramCache]: Analyzing trace with hash -584032603, now seen corresponding path program 7 times [2021-06-05 10:10:10,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:10,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054623496] [2021-06-05 10:10:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:10,865 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:10,865 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054623496] [2021-06-05 10:10:10,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054623496] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:10,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:10,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 10:10:10,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497044755] [2021-06-05 10:10:10,866 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 10:10:10,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:10,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 10:10:10,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-06-05 10:10:10,866 INFO L87 Difference]: Start difference. First operand 971 states and 2720 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:11,499 INFO L93 Difference]: Finished difference Result 1565 states and 4493 transitions. [2021-06-05 10:10:11,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 10:10:11,500 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 10:10:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:11,501 INFO L225 Difference]: With dead ends: 1565 [2021-06-05 10:10:11,501 INFO L226 Difference]: Without dead ends: 947 [2021-06-05 10:10:11,501 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 816.9ms TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2021-06-05 10:10:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2021-06-05 10:10:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2021-06-05 10:10:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 946 states have (on average 2.807610993657505) internal successors, (2656), 946 states have internal predecessors, (2656), 0 states have call successors, (0), 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-06-05 10:10:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 2656 transitions. [2021-06-05 10:10:11,510 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 2656 transitions. Word has length 84 [2021-06-05 10:10:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:11,511 INFO L482 AbstractCegarLoop]: Abstraction has 947 states and 2656 transitions. [2021-06-05 10:10:11,511 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 2656 transitions. [2021-06-05 10:10:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:10:11,512 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:11,512 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:10:11,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 10:10:11,512 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:11,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:11,513 INFO L82 PathProgramCache]: Analyzing trace with hash 251171015, now seen corresponding path program 8 times [2021-06-05 10:10:11,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:11,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196531289] [2021-06-05 10:10:11,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:10:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 10:10:11,749 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:10:11,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196531289] [2021-06-05 10:10:11,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196531289] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:10:11,749 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:10:11,749 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 10:10:11,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059527192] [2021-06-05 10:10:11,750 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 10:10:11,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:10:11,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 10:10:11,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:10:11,751 INFO L87 Difference]: Start difference. First operand 947 states and 2656 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:10:12,079 INFO L93 Difference]: Finished difference Result 1892 states and 5515 transitions. [2021-06-05 10:10:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 10:10:12,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-06-05 10:10:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:10:12,081 INFO L225 Difference]: With dead ends: 1892 [2021-06-05 10:10:12,081 INFO L226 Difference]: Without dead ends: 1298 [2021-06-05 10:10:12,082 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 284.0ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-06-05 10:10:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2021-06-05 10:10:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 923. [2021-06-05 10:10:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 2.811279826464208) internal successors, (2592), 922 states have internal predecessors, (2592), 0 states have call successors, (0), 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-06-05 10:10:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 2592 transitions. [2021-06-05 10:10:12,093 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 2592 transitions. Word has length 84 [2021-06-05 10:10:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:10:12,093 INFO L482 AbstractCegarLoop]: Abstraction has 923 states and 2592 transitions. [2021-06-05 10:10:12,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:10:12,093 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 2592 transitions. [2021-06-05 10:10:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-06-05 10:10:12,095 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:10:12,095 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 10:10:12,095 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 10:10:12,095 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:10:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:10:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2088761, now seen corresponding path program 9 times [2021-06-05 10:10:12,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:10:12,096 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385977163] [2021-06-05 10:10:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:10:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:10:12,156 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:10:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:10:12,212 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:10:12,254 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 10:10:12,254 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 10:10:12,255 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 10:10:12,257 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 10:10:12,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:10:12 BasicIcfg [2021-06-05 10:10:12,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 10:10:12,366 INFO L168 Benchmark]: Toolchain (without parser) took 21370.41 ms. Allocated memory was 367.0 MB in the beginning and 2.2 GB in the end (delta: 1.8 GB). Free memory was 328.6 MB in the beginning and 745.9 MB in the end (delta: -417.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB. [2021-06-05 10:10:12,366 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 367.0 MB. Free memory is still 346.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 10:10:12,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.84 ms. Allocated memory is still 367.0 MB. Free memory was 328.4 MB in the beginning and 322.1 MB in the end (delta: 6.3 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-05 10:10:12,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.69 ms. Allocated memory is still 367.0 MB. Free memory was 322.1 MB in the beginning and 319.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-05 10:10:12,366 INFO L168 Benchmark]: Boogie Preprocessor took 27.22 ms. Allocated memory is still 367.0 MB. Free memory was 319.0 MB in the beginning and 315.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:10:12,366 INFO L168 Benchmark]: RCFGBuilder took 3360.87 ms. Allocated memory was 367.0 MB in the beginning and 440.4 MB in the end (delta: 73.4 MB). Free memory was 315.8 MB in the beginning and 269.4 MB in the end (delta: 46.4 MB). Peak memory consumption was 163.9 MB. Max. memory is 16.0 GB. [2021-06-05 10:10:12,366 INFO L168 Benchmark]: TraceAbstraction took 17559.86 ms. Allocated memory was 440.4 MB in the beginning and 2.2 GB in the end (delta: 1.7 GB). Free memory was 268.3 MB in the beginning and 745.9 MB in the end (delta: -477.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. [2021-06-05 10:10:12,367 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.10 ms. Allocated memory is still 367.0 MB. Free memory is still 346.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 380.84 ms. Allocated memory is still 367.0 MB. Free memory was 328.4 MB in the beginning and 322.1 MB in the end (delta: 6.3 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 37.69 ms. Allocated memory is still 367.0 MB. Free memory was 322.1 MB in the beginning and 319.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 27.22 ms. Allocated memory is still 367.0 MB. Free memory was 319.0 MB in the beginning and 315.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 3360.87 ms. Allocated memory was 367.0 MB in the beginning and 440.4 MB in the end (delta: 73.4 MB). Free memory was 315.8 MB in the beginning and 269.4 MB in the end (delta: 46.4 MB). Peak memory consumption was 163.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17559.86 ms. Allocated memory was 440.4 MB in the beginning and 2.2 GB in the end (delta: 1.7 GB). Free memory was 268.3 MB in the beginning and 745.9 MB in the end (delta: -477.5 MB). Peak memory consumption was 1.3 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L732] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L733] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L734] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L735] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L736] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L737] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L738] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2330; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t2330, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2331; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t2331, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2332; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t2332, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17329.3ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 166.2ms, AutomataDifference: 8597.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 880.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2692 SDtfs, 5268 SDslu, 13500 SDs, 0 SdLazy, 2596 SolverSat, 736 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3094.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 6957.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=18166occurred in iteration=0, InterpolantAutomatonStates: 228, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1849.5ms AutomataMinimizationTime, 19 MinimizatonAttempts, 6337 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 68.1ms SsaConstructionTime, 939.1ms SatisfiabilityAnalysisTime, 4516.4ms InterpolantComputationTime, 1563 NumberOfCodeBlocks, 1563 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1460 ConstructedInterpolants, 0 QuantifiedInterpolants, 12008 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...