/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/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 10:05:59,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 10:05:59,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 10:05:59,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 10:05:59,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 10:05:59,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 10:05:59,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 10:05:59,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 10:05:59,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 10:05:59,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 10:05:59,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 10:05:59,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 10:05:59,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 10:05:59,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 10:05:59,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 10:05:59,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 10:05:59,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 10:05:59,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 10:05:59,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 10:05:59,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 10:05:59,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 10:05:59,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 10:05:59,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 10:05:59,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 10:05:59,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 10:05:59,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 10:05:59,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 10:05:59,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 10:05:59,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 10:05:59,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 10:05:59,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 10:05:59,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 10:05:59,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 10:05:59,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 10:05:59,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 10:05:59,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 10:05:59,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 10:05:59,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 10:05:59,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 10:05:59,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 10:05:59,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 10:05:59,466 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:05:59,494 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 10:05:59,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 10:05:59,495 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 10:05:59,495 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 10:05:59,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 10:05:59,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 10:05:59,497 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 10:05:59,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 10:05:59,497 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 10:05:59,497 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 10:05:59,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 10:05:59,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 10:05:59,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 10:05:59,498 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 10:05:59,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 10:05:59,498 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 10:05:59,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 10:05:59,498 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 10:05:59,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 10:05:59,499 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 10:05:59,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 10:05:59,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 10:05:59,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 10:05:59,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 10:05:59,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 10:05:59,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 10:05:59,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 10:05:59,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 10:05:59,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 10:05:59,499 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 10:05:59,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 10:05:59,500 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 10:05:59,500 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:05:59,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 10:05:59,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 10:05:59,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 10:05:59,780 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 10:05:59,781 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 10:05:59,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2021-06-05 10:05:59,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2aa6432/cea155a48495449f99eee2c091b021ab/FLAGca463aa74 [2021-06-05 10:06:00,268 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 10:06:00,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2021-06-05 10:06:00,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2aa6432/cea155a48495449f99eee2c091b021ab/FLAGca463aa74 [2021-06-05 10:06:00,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df2aa6432/cea155a48495449f99eee2c091b021ab [2021-06-05 10:06:00,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 10:06:00,562 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 10:06:00,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 10:06:00,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 10:06:00,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 10:06:00,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:06:00" (1/1) ... [2021-06-05 10:06:00,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3069f00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00, skipping insertion in model container [2021-06-05 10:06:00,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 10:06:00" (1/1) ... [2021-06-05 10:06:00,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 10:06:00,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 10:06:00,705 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i[952,965] [2021-06-05 10:06:00,847 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:06:00,852 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 10:06:00,866 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i[952,965] [2021-06-05 10:06:00,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 10:06:00,971 INFO L208 MainTranslator]: Completed translation [2021-06-05 10:06:00,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00 WrapperNode [2021-06-05 10:06:00,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 10:06:00,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 10:06:00,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 10:06:00,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 10:06:00,978 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:06:00" (1/1) ... [2021-06-05 10:06:01,004 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:06:00" (1/1) ... [2021-06-05 10:06:01,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 10:06:01,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 10:06:01,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 10:06:01,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 10:06:01,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00" (1/1) ... [2021-06-05 10:06:01,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00" (1/1) ... [2021-06-05 10:06:01,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00" (1/1) ... [2021-06-05 10:06:01,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00" (1/1) ... [2021-06-05 10:06:01,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00" (1/1) ... [2021-06-05 10:06:01,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00" (1/1) ... [2021-06-05 10:06:01,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00" (1/1) ... [2021-06-05 10:06:01,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 10:06:01,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 10:06:01,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 10:06:01,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 10:06:01,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00" (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:06:01,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 10:06:01,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-05 10:06:01,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 10:06:01,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 10:06:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-05 10:06:01,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-05 10:06:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-05 10:06:01,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-05 10:06:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-05 10:06:01,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-05 10:06:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 10:06:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-05 10:06:01,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 10:06:01,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 10:06:01,173 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:06:02,485 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 10:06:02,486 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-05 10:06:02,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:06:02 BoogieIcfgContainer [2021-06-05 10:06:02,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 10:06:02,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 10:06:02,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 10:06:02,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 10:06:02,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 10:06:00" (1/3) ... [2021-06-05 10:06:02,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1a8fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:06:02, skipping insertion in model container [2021-06-05 10:06:02,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 10:06:00" (2/3) ... [2021-06-05 10:06:02,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1a8fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 10:06:02, skipping insertion in model container [2021-06-05 10:06:02,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 10:06:02" (3/3) ... [2021-06-05 10:06:02,493 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2021-06-05 10:06:02,499 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 10:06:02,499 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 10:06:02,500 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 10:06:02,500 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 10:06:02,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,527 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,527 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,534 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,535 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,536 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,542 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,544 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,548 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,550 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,550 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 10:06:02,551 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 10:06:02,567 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-05 10:06:02,589 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 10:06:02,589 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 10:06:02,589 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 10:06:02,590 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 10:06:02,590 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 10:06:02,590 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 10:06:02,590 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 10:06:02,590 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 10:06:02,598 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-06-05 10:06:03,288 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 0 states have call successors, (0), 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:06:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 0 states have call successors, (0), 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:06:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 10:06:03,317 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:03,317 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] [2021-06-05 10:06:03,318 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:03,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1091169302, now seen corresponding path program 1 times [2021-06-05 10:06:03,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:03,328 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782009177] [2021-06-05 10:06:03,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:03,492 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:06:03,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:03,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782009177] [2021-06-05 10:06:03,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782009177] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:03,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:03,493 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 10:06:03,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523223116] [2021-06-05 10:06:03,496 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 10:06:03,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:03,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 10:06:03,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:06:03,524 INFO L87 Difference]: Start difference. First operand has 16158 states, 16154 states have (on average 3.63495109570385) internal successors, (58719), 16157 states have internal predecessors, (58719), 0 states have call successors, (0), 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 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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:06:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:03,745 INFO L93 Difference]: Finished difference Result 13855 states and 49120 transitions. [2021-06-05 10:06:03,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 10:06:03,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-06-05 10:06:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:03,858 INFO L225 Difference]: With dead ends: 13855 [2021-06-05 10:06:03,858 INFO L226 Difference]: Without dead ends: 8223 [2021-06-05 10:06:03,859 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 10:06:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8223 states. [2021-06-05 10:06:04,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8223 to 8223. [2021-06-05 10:06:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8223 states, 8222 states have (on average 3.4911213816589637) internal successors, (28704), 8222 states have internal predecessors, (28704), 0 states have call successors, (0), 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:06:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8223 states to 8223 states and 28704 transitions. [2021-06-05 10:06:04,206 INFO L78 Accepts]: Start accepts. Automaton has 8223 states and 28704 transitions. Word has length 41 [2021-06-05 10:06:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:04,206 INFO L482 AbstractCegarLoop]: Abstraction has 8223 states and 28704 transitions. [2021-06-05 10:06:04,207 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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:06:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 8223 states and 28704 transitions. [2021-06-05 10:06:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 10:06:04,216 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:04,217 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] [2021-06-05 10:06:04,217 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 10:06:04,217 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:04,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:04,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1685543287, now seen corresponding path program 1 times [2021-06-05 10:06:04,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:04,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942372955] [2021-06-05 10:06:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:04,509 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:06:04,510 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:04,510 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942372955] [2021-06-05 10:06:04,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942372955] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:04,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:04,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 10:06:04,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159156335] [2021-06-05 10:06:04,512 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 10:06:04,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:04,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 10:06:04,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 10:06:04,513 INFO L87 Difference]: Start difference. First operand 8223 states and 28704 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:04,867 INFO L93 Difference]: Finished difference Result 10151 states and 35160 transitions. [2021-06-05 10:06:04,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 10:06:04,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-06-05 10:06:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:04,913 INFO L225 Difference]: With dead ends: 10151 [2021-06-05 10:06:04,913 INFO L226 Difference]: Without dead ends: 8103 [2021-06-05 10:06:04,914 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 151.2ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-06-05 10:06:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8103 states. [2021-06-05 10:06:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8103 to 8079. [2021-06-05 10:06:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8079 states, 8078 states have (on average 3.4820500123793017) internal successors, (28128), 8078 states have internal predecessors, (28128), 0 states have call successors, (0), 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:06:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8079 states to 8079 states and 28128 transitions. [2021-06-05 10:06:05,158 INFO L78 Accepts]: Start accepts. Automaton has 8079 states and 28128 transitions. Word has length 67 [2021-06-05 10:06:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:05,159 INFO L482 AbstractCegarLoop]: Abstraction has 8079 states and 28128 transitions. [2021-06-05 10:06:05,159 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8079 states and 28128 transitions. [2021-06-05 10:06:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 10:06:05,170 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:05,170 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] [2021-06-05 10:06:05,170 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 10:06:05,170 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:05,170 INFO L82 PathProgramCache]: Analyzing trace with hash -845757237, now seen corresponding path program 1 times [2021-06-05 10:06:05,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:05,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607122027] [2021-06-05 10:06:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:05,261 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:06:05,261 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:05,261 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607122027] [2021-06-05 10:06:05,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607122027] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:05,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:05,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:06:05,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717259197] [2021-06-05 10:06:05,262 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:06:05,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:05,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:06:05,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:06:05,263 INFO L87 Difference]: Start difference. First operand 8079 states and 28128 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:05,397 INFO L93 Difference]: Finished difference Result 9199 states and 31728 transitions. [2021-06-05 10:06:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:06:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 10:06:05,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:05,419 INFO L225 Difference]: With dead ends: 9199 [2021-06-05 10:06:05,420 INFO L226 Difference]: Without dead ends: 7407 [2021-06-05 10:06:05,420 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 81.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:06:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7407 states. [2021-06-05 10:06:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7407 to 7407. [2021-06-05 10:06:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7407 states, 7406 states have (on average 3.4609775857412908) internal successors, (25632), 7406 states have internal predecessors, (25632), 0 states have call successors, (0), 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:06:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7407 states to 7407 states and 25632 transitions. [2021-06-05 10:06:05,657 INFO L78 Accepts]: Start accepts. Automaton has 7407 states and 25632 transitions. Word has length 69 [2021-06-05 10:06:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:05,657 INFO L482 AbstractCegarLoop]: Abstraction has 7407 states and 25632 transitions. [2021-06-05 10:06:05,657 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 7407 states and 25632 transitions. [2021-06-05 10:06:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-05 10:06:05,666 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:05,666 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:06:05,666 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 10:06:05,666 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1768458327, now seen corresponding path program 1 times [2021-06-05 10:06:05,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:05,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855197824] [2021-06-05 10:06:05,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:05,827 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:06:05,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:05,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855197824] [2021-06-05 10:06:05,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855197824] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:05,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:05,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:06:05,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647810815] [2021-06-05 10:06:05,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:06:05,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:05,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:06:05,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:06:05,829 INFO L87 Difference]: Start difference. First operand 7407 states and 25632 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:06:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:05,970 INFO L93 Difference]: Finished difference Result 10243 states and 35286 transitions. [2021-06-05 10:06:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:06:05,971 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:06:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:05,984 INFO L225 Difference]: With dead ends: 10243 [2021-06-05 10:06:05,984 INFO L226 Difference]: Without dead ends: 5283 [2021-06-05 10:06:05,984 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 88.4ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 10:06:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5283 states. [2021-06-05 10:06:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5283 to 5283. [2021-06-05 10:06:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5283 states, 5282 states have (on average 3.3498674744414996) internal successors, (17694), 5282 states have internal predecessors, (17694), 0 states have call successors, (0), 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:06:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 17694 transitions. [2021-06-05 10:06:06,094 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 17694 transitions. Word has length 70 [2021-06-05 10:06:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:06,095 INFO L482 AbstractCegarLoop]: Abstraction has 5283 states and 17694 transitions. [2021-06-05 10:06:06,095 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:06:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 17694 transitions. [2021-06-05 10:06:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:06:06,103 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:06,103 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:06:06,103 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 10:06:06,104 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1067583572, now seen corresponding path program 1 times [2021-06-05 10:06:06,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:06,104 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783598288] [2021-06-05 10:06:06,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:06,288 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:06:06,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:06,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783598288] [2021-06-05 10:06:06,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783598288] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:06,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:06,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 10:06:06,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030708006] [2021-06-05 10:06:06,290 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 10:06:06,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:06,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 10:06:06,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 10:06:06,290 INFO L87 Difference]: Start difference. First operand 5283 states and 17694 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:06,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:06,622 INFO L93 Difference]: Finished difference Result 6223 states and 20782 transitions. [2021-06-05 10:06:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 10:06:06,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:06:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:06,636 INFO L225 Difference]: With dead ends: 6223 [2021-06-05 10:06:06,636 INFO L226 Difference]: Without dead ends: 5391 [2021-06-05 10:06:06,636 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 244.3ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-06-05 10:06:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5391 states. [2021-06-05 10:06:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5391 to 5343. [2021-06-05 10:06:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5343 states, 5342 states have (on average 3.3523025084238114) internal successors, (17908), 5342 states have internal predecessors, (17908), 0 states have call successors, (0), 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:06:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5343 states to 5343 states and 17908 transitions. [2021-06-05 10:06:06,743 INFO L78 Accepts]: Start accepts. Automaton has 5343 states and 17908 transitions. Word has length 73 [2021-06-05 10:06:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:06,744 INFO L482 AbstractCegarLoop]: Abstraction has 5343 states and 17908 transitions. [2021-06-05 10:06:06,744 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5343 states and 17908 transitions. [2021-06-05 10:06:06,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 10:06:06,752 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:06,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] [2021-06-05 10:06:06,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 10:06:06,752 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:06,752 INFO L82 PathProgramCache]: Analyzing trace with hash 326345816, now seen corresponding path program 1 times [2021-06-05 10:06:06,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:06,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152365963] [2021-06-05 10:06:06,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:07,063 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:06:07,063 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:07,063 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152365963] [2021-06-05 10:06:07,063 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152365963] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:07,064 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:07,064 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 10:06:07,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309896657] [2021-06-05 10:06:07,064 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 10:06:07,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:07,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 10:06:07,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:06:07,065 INFO L87 Difference]: Start difference. First operand 5343 states and 17908 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:07,348 INFO L93 Difference]: Finished difference Result 6499 states and 21706 transitions. [2021-06-05 10:06:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 10:06:07,349 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 10:06:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:07,367 INFO L225 Difference]: With dead ends: 6499 [2021-06-05 10:06:07,367 INFO L226 Difference]: Without dead ends: 5555 [2021-06-05 10:06:07,368 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 222.5ms TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2021-06-05 10:06:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2021-06-05 10:06:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 5555. [2021-06-05 10:06:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5555 states, 5554 states have (on average 3.3525387108390348) internal successors, (18620), 5554 states have internal predecessors, (18620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5555 states to 5555 states and 18620 transitions. [2021-06-05 10:06:07,494 INFO L78 Accepts]: Start accepts. Automaton has 5555 states and 18620 transitions. Word has length 73 [2021-06-05 10:06:07,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:07,494 INFO L482 AbstractCegarLoop]: Abstraction has 5555 states and 18620 transitions. [2021-06-05 10:06:07,494 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5555 states and 18620 transitions. [2021-06-05 10:06:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 10:06:07,503 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:07,503 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] [2021-06-05 10:06:07,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 10:06:07,503 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:07,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:07,504 INFO L82 PathProgramCache]: Analyzing trace with hash 468080022, now seen corresponding path program 1 times [2021-06-05 10:06:07,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:07,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037420392] [2021-06-05 10:06:07,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:07,670 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:06:07,670 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:07,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037420392] [2021-06-05 10:06:07,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037420392] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:07,671 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:07,671 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 10:06:07,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173245849] [2021-06-05 10:06:07,671 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 10:06:07,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:07,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 10:06:07,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-06-05 10:06:07,672 INFO L87 Difference]: Start difference. First operand 5555 states and 18620 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:07,929 INFO L93 Difference]: Finished difference Result 9283 states and 30875 transitions. [2021-06-05 10:06:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 10:06:07,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 10:06:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:07,948 INFO L225 Difference]: With dead ends: 9283 [2021-06-05 10:06:07,948 INFO L226 Difference]: Without dead ends: 7115 [2021-06-05 10:06:07,949 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 179.1ms TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2021-06-05 10:06:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2021-06-05 10:06:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 6275. [2021-06-05 10:06:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6275 states, 6274 states have (on average 3.3313675486133247) internal successors, (20901), 6274 states have internal predecessors, (20901), 0 states have call successors, (0), 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:06:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6275 states to 6275 states and 20901 transitions. [2021-06-05 10:06:08,124 INFO L78 Accepts]: Start accepts. Automaton has 6275 states and 20901 transitions. Word has length 74 [2021-06-05 10:06:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:08,124 INFO L482 AbstractCegarLoop]: Abstraction has 6275 states and 20901 transitions. [2021-06-05 10:06:08,124 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 6275 states and 20901 transitions. [2021-06-05 10:06:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 10:06:08,134 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:08,134 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] [2021-06-05 10:06:08,134 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-05 10:06:08,135 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash 354457601, now seen corresponding path program 1 times [2021-06-05 10:06:08,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:08,135 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126991500] [2021-06-05 10:06:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:08,317 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:06:08,317 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:08,317 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126991500] [2021-06-05 10:06:08,317 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126991500] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:08,317 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:08,318 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 10:06:08,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700301551] [2021-06-05 10:06:08,318 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 10:06:08,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:08,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 10:06:08,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 10:06:08,318 INFO L87 Difference]: Start difference. First operand 6275 states and 20901 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:08,620 INFO L93 Difference]: Finished difference Result 6867 states and 22761 transitions. [2021-06-05 10:06:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 10:06:08,621 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 10:06:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:08,639 INFO L225 Difference]: With dead ends: 6867 [2021-06-05 10:06:08,639 INFO L226 Difference]: Without dead ends: 6227 [2021-06-05 10:06:08,639 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 213.0ms TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2021-06-05 10:06:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6227 states. [2021-06-05 10:06:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6227 to 6227. [2021-06-05 10:06:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6227 states, 6226 states have (on average 3.328140057822037) internal successors, (20721), 6226 states have internal predecessors, (20721), 0 states have call successors, (0), 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:06:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6227 states to 6227 states and 20721 transitions. [2021-06-05 10:06:08,759 INFO L78 Accepts]: Start accepts. Automaton has 6227 states and 20721 transitions. Word has length 74 [2021-06-05 10:06:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:08,759 INFO L482 AbstractCegarLoop]: Abstraction has 6227 states and 20721 transitions. [2021-06-05 10:06:08,759 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6227 states and 20721 transitions. [2021-06-05 10:06:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 10:06:08,768 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:08,768 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] [2021-06-05 10:06:08,768 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-05 10:06:08,768 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1588688614, now seen corresponding path program 1 times [2021-06-05 10:06:08,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:08,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661482910] [2021-06-05 10:06:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:08,999 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:06:08,999 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:08,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661482910] [2021-06-05 10:06:08,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661482910] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:08,999 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:08,999 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 10:06:08,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538446646] [2021-06-05 10:06:09,000 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 10:06:09,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:09,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 10:06:09,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:06:09,000 INFO L87 Difference]: Start difference. First operand 6227 states and 20721 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:09,467 INFO L93 Difference]: Finished difference Result 7039 states and 23357 transitions. [2021-06-05 10:06:09,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 10:06:09,469 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 10:06:09,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:09,483 INFO L225 Difference]: With dead ends: 7039 [2021-06-05 10:06:09,483 INFO L226 Difference]: Without dead ends: 6463 [2021-06-05 10:06:09,486 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 364.4ms TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-06-05 10:06:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6463 states. [2021-06-05 10:06:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6463 to 6087. [2021-06-05 10:06:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6087 states, 6086 states have (on average 3.323529411764706) internal successors, (20227), 6086 states have internal predecessors, (20227), 0 states have call successors, (0), 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:06:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6087 states to 6087 states and 20227 transitions. [2021-06-05 10:06:09,620 INFO L78 Accepts]: Start accepts. Automaton has 6087 states and 20227 transitions. Word has length 75 [2021-06-05 10:06:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:09,620 INFO L482 AbstractCegarLoop]: Abstraction has 6087 states and 20227 transitions. [2021-06-05 10:06:09,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 6087 states and 20227 transitions. [2021-06-05 10:06:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 10:06:09,630 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:09,630 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] [2021-06-05 10:06:09,630 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-05 10:06:09,630 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:09,631 INFO L82 PathProgramCache]: Analyzing trace with hash 57671256, now seen corresponding path program 2 times [2021-06-05 10:06:09,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:09,631 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87677884] [2021-06-05 10:06:09,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:09,853 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:06:09,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:09,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87677884] [2021-06-05 10:06:09,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87677884] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:09,853 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:09,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 10:06:09,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984591821] [2021-06-05 10:06:09,854 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 10:06:09,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:09,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 10:06:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:06:09,857 INFO L87 Difference]: Start difference. First operand 6087 states and 20227 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:10,137 INFO L93 Difference]: Finished difference Result 6615 states and 21879 transitions. [2021-06-05 10:06:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 10:06:10,138 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 10:06:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:10,151 INFO L225 Difference]: With dead ends: 6615 [2021-06-05 10:06:10,151 INFO L226 Difference]: Without dead ends: 6039 [2021-06-05 10:06:10,151 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 262.4ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-06-05 10:06:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2021-06-05 10:06:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 6015. [2021-06-05 10:06:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6015 states, 6014 states have (on average 3.3224143664782173) internal successors, (19981), 6014 states have internal predecessors, (19981), 0 states have call successors, (0), 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:06:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6015 states to 6015 states and 19981 transitions. [2021-06-05 10:06:10,275 INFO L78 Accepts]: Start accepts. Automaton has 6015 states and 19981 transitions. Word has length 75 [2021-06-05 10:06:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:10,275 INFO L482 AbstractCegarLoop]: Abstraction has 6015 states and 19981 transitions. [2021-06-05 10:06:10,275 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6015 states and 19981 transitions. [2021-06-05 10:06:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 10:06:10,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:10,285 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] [2021-06-05 10:06:10,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-05 10:06:10,285 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash 715388759, now seen corresponding path program 1 times [2021-06-05 10:06:10,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:10,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357404760] [2021-06-05 10:06:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:10,564 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:06:10,564 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:10,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357404760] [2021-06-05 10:06:10,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357404760] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:10,564 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:10,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-06-05 10:06:10,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558757346] [2021-06-05 10:06:10,565 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 10:06:10,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:10,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 10:06:10,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-06-05 10:06:10,566 INFO L87 Difference]: Start difference. First operand 6015 states and 19981 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:10,879 INFO L93 Difference]: Finished difference Result 6335 states and 20941 transitions. [2021-06-05 10:06:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 10:06:10,880 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 10:06:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:10,890 INFO L225 Difference]: With dead ends: 6335 [2021-06-05 10:06:10,890 INFO L226 Difference]: Without dead ends: 5823 [2021-06-05 10:06:10,891 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 279.4ms TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2021-06-05 10:06:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5823 states. [2021-06-05 10:06:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5823 to 5823. [2021-06-05 10:06:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5823 states, 5822 states have (on average 3.316557883888698) internal successors, (19309), 5822 states have internal predecessors, (19309), 0 states have call successors, (0), 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:06:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5823 states to 5823 states and 19309 transitions. [2021-06-05 10:06:11,003 INFO L78 Accepts]: Start accepts. Automaton has 5823 states and 19309 transitions. Word has length 75 [2021-06-05 10:06:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:11,003 INFO L482 AbstractCegarLoop]: Abstraction has 5823 states and 19309 transitions. [2021-06-05 10:06:11,004 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 17 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 5823 states and 19309 transitions. [2021-06-05 10:06:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 10:06:11,012 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:11,013 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] [2021-06-05 10:06:11,013 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 10:06:11,013 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash 838493874, now seen corresponding path program 1 times [2021-06-05 10:06:11,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:11,013 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443951186] [2021-06-05 10:06:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:11,074 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:06:11,074 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:11,074 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443951186] [2021-06-05 10:06:11,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443951186] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:11,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:11,075 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 10:06:11,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558584199] [2021-06-05 10:06:11,075 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 10:06:11,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:11,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 10:06:11,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 10:06:11,075 INFO L87 Difference]: Start difference. First operand 5823 states and 19309 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:11,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:11,169 INFO L93 Difference]: Finished difference Result 7093 states and 23177 transitions. [2021-06-05 10:06:11,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 10:06:11,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 10:06:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:11,179 INFO L225 Difference]: With dead ends: 7093 [2021-06-05 10:06:11,179 INFO L226 Difference]: Without dead ends: 5181 [2021-06-05 10:06:11,179 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 60.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 10:06:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5181 states. [2021-06-05 10:06:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5181 to 5181. [2021-06-05 10:06:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5181 states, 5180 states have (on average 3.255019305019305) internal successors, (16861), 5180 states have internal predecessors, (16861), 0 states have call successors, (0), 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:06:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 16861 transitions. [2021-06-05 10:06:11,272 INFO L78 Accepts]: Start accepts. Automaton has 5181 states and 16861 transitions. Word has length 76 [2021-06-05 10:06:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:11,272 INFO L482 AbstractCegarLoop]: Abstraction has 5181 states and 16861 transitions. [2021-06-05 10:06:11,272 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5181 states and 16861 transitions. [2021-06-05 10:06:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 10:06:11,280 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:11,281 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:06:11,281 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-05 10:06:11,281 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash -902903539, now seen corresponding path program 1 times [2021-06-05 10:06:11,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:11,281 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641178300] [2021-06-05 10:06:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:11,360 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:06:11,360 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:11,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641178300] [2021-06-05 10:06:11,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641178300] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:11,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:11,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 10:06:11,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882278859] [2021-06-05 10:06:11,361 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 10:06:11,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:11,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 10:06:11,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 10:06:11,362 INFO L87 Difference]: Start difference. First operand 5181 states and 16861 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:11,473 INFO L93 Difference]: Finished difference Result 5187 states and 16421 transitions. [2021-06-05 10:06:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 10:06:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-06-05 10:06:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:11,479 INFO L225 Difference]: With dead ends: 5187 [2021-06-05 10:06:11,479 INFO L226 Difference]: Without dead ends: 3651 [2021-06-05 10:06:11,480 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 83.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-05 10:06:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2021-06-05 10:06:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 3621. [2021-06-05 10:06:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 3620 states have (on average 3.10414364640884) internal successors, (11237), 3620 states have internal predecessors, (11237), 0 states have call successors, (0), 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:06:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 11237 transitions. [2021-06-05 10:06:11,544 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 11237 transitions. Word has length 77 [2021-06-05 10:06:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:11,544 INFO L482 AbstractCegarLoop]: Abstraction has 3621 states and 11237 transitions. [2021-06-05 10:06:11,544 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 11237 transitions. [2021-06-05 10:06:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-06-05 10:06:11,550 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:11,550 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:06:11,550 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-05 10:06:11,550 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1895442222, now seen corresponding path program 1 times [2021-06-05 10:06:11,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:11,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176822669] [2021-06-05 10:06:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:11,632 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:06:11,632 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:11,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176822669] [2021-06-05 10:06:11,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176822669] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:11,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:11,632 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 10:06:11,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139958349] [2021-06-05 10:06:11,633 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 10:06:11,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:11,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 10:06:11,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 10:06:11,633 INFO L87 Difference]: Start difference. First operand 3621 states and 11237 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:11,752 INFO L93 Difference]: Finished difference Result 2991 states and 9092 transitions. [2021-06-05 10:06:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:06:11,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-06-05 10:06:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:11,756 INFO L225 Difference]: With dead ends: 2991 [2021-06-05 10:06:11,756 INFO L226 Difference]: Without dead ends: 2015 [2021-06-05 10:06:11,756 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 92.1ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 10:06:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2021-06-05 10:06:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1715. [2021-06-05 10:06:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 2.922987164527421) internal successors, (5010), 1714 states have internal predecessors, (5010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 5010 transitions. [2021-06-05 10:06:11,783 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 5010 transitions. Word has length 79 [2021-06-05 10:06:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:11,783 INFO L482 AbstractCegarLoop]: Abstraction has 1715 states and 5010 transitions. [2021-06-05 10:06:11,783 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 5010 transitions. [2021-06-05 10:06:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 10:06:11,786 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:11,786 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] [2021-06-05 10:06:11,786 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-05 10:06:11,786 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash -575909962, now seen corresponding path program 1 times [2021-06-05 10:06:11,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:11,787 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125694175] [2021-06-05 10:06:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 10:06:12,004 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:06:12,004 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 10:06:12,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125694175] [2021-06-05 10:06:12,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125694175] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 10:06:12,004 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 10:06:12,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-06-05 10:06:12,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273705451] [2021-06-05 10:06:12,005 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 10:06:12,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 10:06:12,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 10:06:12,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2021-06-05 10:06:12,005 INFO L87 Difference]: Start difference. First operand 1715 states and 5010 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 10:06:12,274 INFO L93 Difference]: Finished difference Result 2285 states and 6725 transitions. [2021-06-05 10:06:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 10:06:12,275 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 10:06:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 10:06:12,277 INFO L225 Difference]: With dead ends: 2285 [2021-06-05 10:06:12,277 INFO L226 Difference]: Without dead ends: 1467 [2021-06-05 10:06:12,277 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 256.0ms TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2021-06-05 10:06:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2021-06-05 10:06:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2021-06-05 10:06:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1466 states have (on average 2.9481582537517053) internal successors, (4322), 1466 states have internal predecessors, (4322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 4322 transitions. [2021-06-05 10:06:12,297 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 4322 transitions. Word has length 82 [2021-06-05 10:06:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 10:06:12,297 INFO L482 AbstractCegarLoop]: Abstraction has 1467 states and 4322 transitions. [2021-06-05 10:06:12,297 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 10:06:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 4322 transitions. [2021-06-05 10:06:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 10:06:12,299 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 10:06:12,299 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] [2021-06-05 10:06:12,299 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-05 10:06:12,299 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 10:06:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 10:06:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2009377846, now seen corresponding path program 2 times [2021-06-05 10:06:12,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 10:06:12,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484255690] [2021-06-05 10:06:12,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 10:06:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:06:12,336 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:06:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 10:06:12,368 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 10:06:12,394 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 10:06:12,394 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 10:06:12,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-05 10:06:12,396 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 10:06:12,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 10:06:12 BasicIcfg [2021-06-05 10:06:12,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 10:06:12,510 INFO L168 Benchmark]: Toolchain (without parser) took 11947.78 ms. Allocated memory was 383.8 MB in the beginning and 3.0 GB in the end (delta: 2.6 GB). Free memory was 346.2 MB in the beginning and 1.3 GB in the end (delta: -938.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. [2021-06-05 10:06:12,510 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 383.8 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 10:06:12,510 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.36 ms. Allocated memory is still 383.8 MB. Free memory was 345.9 MB in the beginning and 344.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-05 10:06:12,510 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.51 ms. Allocated memory is still 383.8 MB. Free memory was 343.6 MB in the beginning and 341.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:06:12,510 INFO L168 Benchmark]: Boogie Preprocessor took 32.94 ms. Allocated memory is still 383.8 MB. Free memory was 341.5 MB in the beginning and 339.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 10:06:12,510 INFO L168 Benchmark]: RCFGBuilder took 1417.90 ms. Allocated memory is still 383.8 MB. Free memory was 339.4 MB in the beginning and 259.4 MB in the end (delta: 80.0 MB). Peak memory consumption was 134.6 MB. Max. memory is 16.0 GB. [2021-06-05 10:06:12,510 INFO L168 Benchmark]: TraceAbstraction took 10020.78 ms. Allocated memory was 383.8 MB in the beginning and 3.0 GB in the end (delta: 2.6 GB). Free memory was 259.4 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. [2021-06-05 10:06:12,511 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.09 ms. Allocated memory is still 383.8 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 407.36 ms. Allocated memory is still 383.8 MB. Free memory was 345.9 MB in the beginning and 344.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.51 ms. Allocated memory is still 383.8 MB. Free memory was 343.6 MB in the beginning and 341.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 32.94 ms. Allocated memory is still 383.8 MB. Free memory was 341.5 MB in the beginning and 339.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1417.90 ms. Allocated memory is still 383.8 MB. Free memory was 339.4 MB in the beginning and 259.4 MB in the end (delta: 80.0 MB). Peak memory consumption was 134.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 10020.78 ms. Allocated memory was 383.8 MB in the beginning and 3.0 GB in the end (delta: 2.6 GB). Free memory was 259.4 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2025; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9807.0ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 145.9ms, AutomataDifference: 4049.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 698.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1941 SDtfs, 3607 SDslu, 8198 SDs, 0 SdLazy, 1316 SolverSat, 305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1173.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 2585.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=16158occurred in iteration=0, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2029.3ms AutomataMinimizationTime, 15 MinimizatonAttempts, 1642 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 43.2ms SsaConstructionTime, 517.3ms SatisfiabilityAnalysisTime, 2101.3ms InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1065 ConstructedInterpolants, 0 QuantifiedInterpolants, 8325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...